default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/algorithmica/algorithmica32.bht:"
download as .bib file
@article{DBLP:journals/algorithmica/AbelloBW02,
author = {James Abello and
Adam L. Buchsbaum and
Jeffery R. Westbrook},
title = {A Functional Approach to External Graph Algorithms},
journal = {Algorithmica},
volume = {32},
number = {3},
pages = {437--458},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0088-5},
doi = {10.1007/S00453-001-0088-5},
timestamp = {Thu, 28 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AbelloBW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AgarwalBS02,
author = {Pankaj K. Agarwal and
Binay K. Bhattacharya and
Sandeep Sen},
title = {Improved Algorithms for Uniform Partitions of Points},
journal = {Algorithmica},
volume = {32},
number = {4},
pages = {521--539},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0084-9},
doi = {10.1007/S00453-001-0084-9},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AgarwalBS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlbersKS02,
author = {Susanne Albers and
Klaus Kursawe and
Sven Schuierer},
title = {Exploring Unknown Environments with Obstacles},
journal = {Algorithmica},
volume = {32},
number = {1},
pages = {123--143},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0067-x},
doi = {10.1007/S00453-001-0067-X},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AlbersKS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlonZ02,
author = {Noga Alon and
Ayal Zaks},
title = {Algorithmic Aspects of Acyclic Edge Colorings},
journal = {Algorithmica},
volume = {32},
number = {4},
pages = {611--614},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0093-8},
doi = {10.1007/S00453-001-0093-8},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AlonZ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AmbainisBS02,
author = {Andris Ambainis and
Stephen A. Bloch and
David L. Schweizer},
title = {Delayed Binary Search, or Playing Twenty Questions with a Procrastinator},
journal = {Algorithmica},
volume = {32},
number = {4},
pages = {641--651},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0097-4},
doi = {10.1007/S00453-001-0097-4},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AmbainisBS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AmouraBKM02,
author = {Abdel Krim Amoura and
Evripidis Bampis and
Claire Kenyon and
Yannis Manoussakis},
title = {Scheduling Independent Multiprocessor Tasks},
journal = {Algorithmica},
volume = {32},
number = {2},
pages = {247--261},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0076-9},
doi = {10.1007/S00453-001-0076-9},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AmouraBKM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AndrewsBZ02,
author = {Matthew Andrews and
Michael A. Bender and
Lisa Zhang},
title = {New Algorithms for Disk Scheduling},
journal = {Algorithmica},
volume = {32},
number = {2},
pages = {277--301},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0071-1},
doi = {10.1007/S00453-001-0071-1},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AndrewsBZ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AwerbuchS02,
author = {Baruch Awerbuch and
Tripurari Singh},
title = {An Online Algorithm for the Dynamic Maximal Dense Tree Problem},
journal = {Algorithmica},
volume = {32},
number = {4},
pages = {540--553},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0086-7},
doi = {10.1007/S00453-001-0086-7},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AwerbuchS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BachrachER02,
author = {Ran Bachrach and
Ran El{-}Yaniv and
M. Reinstadtler},
title = {On the Competitive Theory and Practice of Online List Accessing Algorithms},
journal = {Algorithmica},
volume = {32},
number = {2},
pages = {201--245},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0069-8},
doi = {10.1007/S00453-001-0069-8},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BachrachER02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BaxF02,
author = {Eric T. Bax and
Joel Franklin},
title = {A Permanent Algorithm with exp[Omega (n\({}^{\mbox{1/3}}\)/2 ln n
{)]} Expected Speedup for 0-1 Matrices},
journal = {Algorithmica},
volume = {32},
number = {1},
pages = {157--162},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0072-0},
doi = {10.1007/S00453-001-0072-0},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BaxF02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Ben-AmramG02,
author = {Amir M. Ben{-}Amram and
Zvi Galil},
title = {Lower Bounds for Dynamic Data Structures on Algebraic RAMs},
journal = {Algorithmica},
volume = {32},
number = {3},
pages = {364--395},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0079-6},
doi = {10.1007/S00453-001-0079-6},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Ben-AmramG02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BertolazziBD02,
author = {Paola Bertolazzi and
Giuseppe Di Battista and
Walter Didimo},
title = {Quasi-Upward Planarity},
journal = {Algorithmica},
volume = {32},
number = {3},
pages = {474--506},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0083-x},
doi = {10.1007/S00453-001-0083-X},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BertolazziBD02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BroersmaKKM02,
author = {Hajo Broersma and
Ton Kloks and
Dieter Kratsch and
Haiko M{\"{u}}ller},
title = {A Generalization of AT-Free Graphs and a Generic Algorithm for Solving
Triangulation Problems},
journal = {Algorithmica},
volume = {32},
number = {4},
pages = {594--610},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0091-x},
doi = {10.1007/S00453-001-0091-X},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BroersmaKKM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CohenK02,
author = {Edith Cohen and
Haim Kaplan},
title = {Caching Documents with Variable Sizes and Fetching Costs: An LP-Based
Approach},
journal = {Algorithmica},
volume = {32},
number = {3},
pages = {459--466},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0081-z},
doi = {10.1007/S00453-001-0081-Z},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CohenK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CrauserF02,
author = {Andreas Crauser and
Paolo Ferragina},
title = {A Theoretical and Experimental Study on the Construction of Suffix
Arrays in External Memory},
journal = {Algorithmica},
volume = {32},
number = {1},
pages = {1--35},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0051-5},
doi = {10.1007/S00453-001-0051-5},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CrauserF02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EppsteinBH02,
author = {David Eppstein and
Marshall W. Bern and
Brad L. Hutchings},
title = {Algorithms for Coloring Quadtrees},
journal = {Algorithmica},
volume = {32},
number = {1},
pages = {87--94},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0054-2},
doi = {10.1007/S00453-001-0054-2},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EppsteinBH02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ErlebachH02,
author = {Thomas Erlebach and
Torben Hagerup},
title = {Routing Flow Through a Strongly Connected Graph},
journal = {Algorithmica},
volume = {32},
number = {3},
pages = {467--473},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0082-y},
doi = {10.1007/S00453-001-0082-Y},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ErlebachH02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FeuersteinL02,
author = {Esteban Feuerstein and
Alejandro Strejilevich de Loma},
title = {On-Line Multi-Threaded Paging},
journal = {Algorithmica},
volume = {32},
number = {1},
pages = {36--60},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0073-z},
doi = {10.1007/S00453-001-0073-Z},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FeuersteinL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FotakisS02,
author = {Dimitris Fotakis and
Paul G. Spirakis},
title = {Minimum Congestion Redundant Assignments to Tolerate Random Faults},
journal = {Algorithmica},
volume = {32},
number = {3},
pages = {396--422},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0080-0},
doi = {10.1007/S00453-001-0080-0},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FotakisS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GoldreichR02,
author = {Oded Goldreich and
Dana Ron},
title = {Property Testing in Bounded Degree Graphs},
journal = {Algorithmica},
volume = {32},
number = {2},
pages = {302--343},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0078-7},
doi = {10.1007/S00453-001-0078-7},
timestamp = {Wed, 15 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GoldreichR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GrecoSS02,
author = {John G. Del Greco and
Chandra N. Sekharan and
R. Sridhar},
title = {Fast Parallel Reordering and Isomorphism Testing of k-Trees},
journal = {Algorithmica},
volume = {32},
number = {1},
pages = {61--72},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0052-4},
doi = {10.1007/S00453-001-0052-4},
timestamp = {Wed, 07 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GrecoSS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GusfieldM02,
author = {Dan Gusfield and
Charles U. Martel},
title = {The Structure and Complexity of Sports Elimination Numbers},
journal = {Algorithmica},
volume = {32},
number = {1},
pages = {73--86},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0074-y},
doi = {10.1007/S00453-001-0074-Y},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GusfieldM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Irani02,
author = {Sandy Irani},
title = {Randomized Weighted Caching with Two Page Weights},
journal = {Algorithmica},
volume = {32},
number = {4},
pages = {624--640},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0095-6},
doi = {10.1007/S00453-001-0095-6},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Irani02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JansenP02,
author = {Klaus Jansen and
Lorant Porkolab},
title = {Linear-Time Approximation Schemes for Scheduling Malleable Parallel
Tasks},
journal = {Algorithmica},
volume = {32},
number = {3},
pages = {507--520},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0085-8},
doi = {10.1007/S00453-001-0085-8},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/JansenP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KamidoiWY02,
author = {Yoko Kamidoi and
Shin'ichi Wakabayashi and
Noriyoshi Yoshida},
title = {A Divide-and-Conquer Approach to the Minimum k-Way Cut Problem},
journal = {Algorithmica},
volume = {32},
number = {2},
pages = {262--276},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0070-2},
doi = {10.1007/S00453-001-0070-2},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KamidoiWY02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Kimbrel02,
author = {Tracy Kimbrel},
title = {Interleaved Prefetching},
journal = {Algorithmica},
volume = {32},
number = {1},
pages = {107--122},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0066-y},
doi = {10.1007/S00453-001-0066-Y},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Kimbrel02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LandauI02,
author = {Susan Landau and
Neil Immerman},
title = {Embedding Linkages on an Integer Lattice},
journal = {Algorithmica},
volume = {32},
number = {3},
pages = {423--436},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0087-6},
doi = {10.1007/S00453-001-0087-6},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LandauI02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LevcopoulosNS02,
author = {Christos Levcopoulos and
Giri Narasimhan and
Michiel H. M. Smid},
title = {Improved Algorithms for Constructing Fault-Tolerant Spanners},
journal = {Algorithmica},
volume = {32},
number = {1},
pages = {144--156},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0075-x},
doi = {10.1007/S00453-001-0075-X},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LevcopoulosNS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LiS02,
author = {Yin Li and
William F. Smyth},
title = {Computing the Cover Array in Linear Time},
journal = {Algorithmica},
volume = {32},
number = {1},
pages = {95--106},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0062-2},
doi = {10.1007/S00453-001-0062-2},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LiS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/NarayananS02,
author = {Lata Narayanan and
Sunil M. Shende},
title = {Corrigendum: Static Frequency Assignment in Cellular Networks},
journal = {Algorithmica},
volume = {32},
number = {4},
pages = {679},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0099-2},
doi = {10.1007/S00453-001-0099-2},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/NarayananS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PhillipsSTW02,
author = {Cynthia A. Phillips and
Clifford Stein and
Eric Torng and
Joel Wein},
title = {Optimal Time-Critical Scheduling via Resource Augmentation},
journal = {Algorithmica},
volume = {32},
number = {2},
pages = {163--200},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0068-9},
doi = {10.1007/S00453-001-0068-9},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/PhillipsSTW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Schoning02,
author = {Uwe Sch{\"{o}}ning},
title = {A Probabilistic Algorithm for k -SAT Based on Limited Local Search
and Restart},
journal = {Algorithmica},
volume = {32},
number = {4},
pages = {615--623},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0094-7},
doi = {10.1007/S00453-001-0094-7},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Schoning02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ShachnaiT02,
author = {Hadas Shachnai and
Tami Tamir},
title = {Multiprocessor Scheduling with Machine Allotment and Parallelism Constraints},
journal = {Algorithmica},
volume = {32},
number = {4},
pages = {651--678},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0098-3},
doi = {10.1007/S00453-001-0098-3},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ShachnaiT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Sibeyn02,
author = {Jop F. Sibeyn},
title = {One-by-One Cleaning for Practical Parallel List Ranking},
journal = {Algorithmica},
volume = {32},
number = {3},
pages = {345--363},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0077-8},
doi = {10.1007/S00453-001-0077-8},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Sibeyn02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/WangD02,
author = {Lusheng Wang and
Ding{-}Zhu Du},
title = {Approximations for a Bottleneck Steiner Tree Problem},
journal = {Algorithmica},
volume = {32},
number = {4},
pages = {554--561},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0089-4},
doi = {10.1007/S00453-001-0089-4},
timestamp = {Wed, 07 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/WangD02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/YehKLY02,
author = {Tzuoo{-}Hawn Yeh and
Cheng{-}Ming Kuo and
Chin{-}Laung Lei and
Hsu{-}Chun Yen},
title = {Distributed and On-Line Routing on Tori},
journal = {Algorithmica},
volume = {32},
number = {4},
pages = {562--593},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0090-y},
doi = {10.1007/S00453-001-0090-Y},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/YehKLY02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-11-06 16:12 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
