Search dblp for Publications

export results for "toc:db/journals/algorithmica/algorithmica21.bht:"

 download as .bib file

@article{DBLP:journals/algorithmica/AlbersM98,
  author       = {Susanne Albers and
                  Michael Mitzenmacher},
  title        = {Average Case Analyses of List Update Algorithms, with Applications
                  to Data Compression},
  journal      = {Algorithmica},
  volume       = {21},
  number       = {3},
  pages        = {312--329},
  year         = {1998},
  url          = {https://doi.org/10.1007/PL00009217},
  doi          = {10.1007/PL00009217},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/AlbersM98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlonACESVW98,
  author       = {Noga Alon and
                  Yossi Azar and
                  J{\'{a}}nos Csirik and
                  Leah Epstein and
                  Sergey V. Sevastianov and
                  Arjen P. A. Vestjens and
                  Gerhard J. Woeginger},
  title        = {On-Line and Off-Line Approximation Algorithms for Vector Covering
                  Problems},
  journal      = {Algorithmica},
  volume       = {21},
  number       = {1},
  pages        = {104--118},
  year         = {1998},
  url          = {https://doi.org/10.1007/PL00009203},
  doi          = {10.1007/PL00009203},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/AlonACESVW98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AltFRW98,
  author       = {Helmut Alt and
                  Ulrich Fuchs and
                  G{\"{u}}nter Rote and
                  Gerald Weber},
  title        = {Matching Convex Shapes with Respect to the Symmetric Difference},
  journal      = {Algorithmica},
  volume       = {21},
  number       = {1},
  pages        = {89--103},
  year         = {1998},
  url          = {https://doi.org/10.1007/PL00009210},
  doi          = {10.1007/PL00009210},
  timestamp    = {Sun, 12 Nov 2017 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/AltFRW98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ArkinCHMSSY98,
  author       = {Esther M. Arkin and
                  Yi{-}Jen Chiang and
                  Martin Held and
                  Joseph S. B. Mitchell and
                  Vera Sacrist{\'{a}}n and
                  Steven Skiena and
                  Tae{-}Heng Yang},
  title        = {On Minimum-Area Hulls},
  journal      = {Algorithmica},
  volume       = {21},
  number       = {1},
  pages        = {119--136},
  year         = {1998},
  url          = {https://doi.org/10.1007/PL00009204},
  doi          = {10.1007/PL00009204},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/ArkinCHMSSY98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Ben-AroyaCS98,
  author       = {Ishai Ben{-}Aroya and
                  Donald D. Chinn and
                  Assaf Schuster},
  title        = {A Lower Bound for Nearly Minimal Adaptive and Hot Potato Algorithms},
  journal      = {Algorithmica},
  volume       = {21},
  number       = {4},
  pages        = {347--376},
  year         = {1998},
  url          = {https://doi.org/10.1007/PL00009219},
  doi          = {10.1007/PL00009219},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Ben-AroyaCS98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChaoL98,
  author       = {Liang{-}Fang Chao and
                  Andrea S. LaPaugh},
  title        = {Finding All Minimal Shapes in a Routing Channel},
  journal      = {Algorithmica},
  volume       = {21},
  number       = {2},
  pages        = {211--244},
  year         = {1998},
  url          = {https://doi.org/10.1007/PL00009213},
  doi          = {10.1007/PL00009213},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/ChaoL98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChongL98,
  author       = {Ka Wong Chong and
                  Tak Wah Lam},
  title        = {Approximating Biconnectivity in Parallel},
  journal      = {Algorithmica},
  volume       = {21},
  number       = {4},
  pages        = {395--410},
  year         = {1998},
  url          = {https://doi.org/10.1007/PL00009221},
  doi          = {10.1007/PL00009221},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/ChongL98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CzumajKKL98,
  author       = {Artur Czumaj and
                  Przemyslawa Kanarek and
                  Miroslaw Kutylowski and
                  Krzysztof Lorys},
  title        = {Fast Generation of Random Permutations Via Networks Simulation},
  journal      = {Algorithmica},
  volume       = {21},
  number       = {1},
  pages        = {2--20},
  year         = {1998},
  url          = {https://doi.org/10.1007/PL00009206},
  doi          = {10.1007/PL00009206},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/CzumajKKL98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FraigniaudG98,
  author       = {Pierre Fraigniaud and
                  Cyril Gavoille},
  title        = {Interval Routing Schemes},
  journal      = {Algorithmica},
  volume       = {21},
  number       = {2},
  pages        = {155--182},
  year         = {1998},
  url          = {https://doi.org/10.1007/PL00009211},
  doi          = {10.1007/PL00009211},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/FraigniaudG98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Friedman98,
  author       = {Joel Friedman},
  title        = {Computing Betti Numbers via Combinatiorial Laplacians},
  journal      = {Algorithmica},
  volume       = {21},
  number       = {4},
  pages        = {331--346},
  year         = {1998},
  url          = {https://doi.org/10.1007/PL00009218},
  doi          = {10.1007/PL00009218},
  timestamp    = {Mon, 25 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Friedman98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FriezeS98,
  author       = {Alan M. Frieze and
                  Wojciech Szpankowski},
  title        = {Greedy Algorithms for the Shortest Common Superstring That Are Asymptotically
                  Optimal},
  journal      = {Algorithmica},
  volume       = {21},
  number       = {1},
  pages        = {21--36},
  year         = {1998},
  url          = {https://doi.org/10.1007/PL00009207},
  doi          = {10.1007/PL00009207},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/FriezeS98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GuptaN98,
  author       = {Arvind Gupta and
                  Naomi Nishimura},
  title        = {Finding Largest Subtrees and Smallest Supertrees},
  journal      = {Algorithmica},
  volume       = {21},
  number       = {2},
  pages        = {183--210},
  year         = {1998},
  url          = {https://doi.org/10.1007/PL00009212},
  doi          = {10.1007/PL00009212},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/GuptaN98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JiangK98,
  author       = {Tao Jiang and
                  Richard M. Karp},
  title        = {Mapping Clones with a Given Ordering or Interleaving},
  journal      = {Algorithmica},
  volume       = {21},
  number       = {3},
  pages        = {262--284},
  year         = {1998},
  url          = {https://doi.org/10.1007/PL00009215},
  doi          = {10.1007/PL00009215},
  timestamp    = {Thu, 23 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/JiangK98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KarkkainenS98,
  author       = {Juha K{\"{a}}rkk{\"{a}}inen and
                  Erkki Sutinen},
  title        = {Lempel-Ziv Index for \emph{q}-Grams},
  journal      = {Algorithmica},
  volume       = {21},
  number       = {1},
  pages        = {137--154},
  year         = {1998},
  url          = {https://doi.org/10.1007/PL00009205},
  doi          = {10.1007/PL00009205},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/KarkkainenS98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KhannaMW98,
  author       = {Sanjeev Khanna and
                  Rajeev Motwani and
                  Randall H. Wilson},
  title        = {On Certificates and Lookahead in Dynamic Graph Problems},
  journal      = {Algorithmica},
  volume       = {21},
  number       = {4},
  pages        = {377--394},
  year         = {1998},
  url          = {https://doi.org/10.1007/PL00009220},
  doi          = {10.1007/PL00009220},
  timestamp    = {Thu, 02 Jan 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/KhannaMW98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LevcopoulosK98,
  author       = {Christos Levcopoulos and
                  Drago Krznaric},
  title        = {A Linear-Time Approximation Scheme for Minimum, Weight Triangulation
                  of Convex Polygons},
  journal      = {Algorithmica},
  volume       = {21},
  number       = {3},
  pages        = {285--311},
  year         = {1998},
  url          = {https://doi.org/10.1007/PL00009216},
  doi          = {10.1007/PL00009216},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/LevcopoulosK98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PhillipsW98,
  author       = {Steven J. Phillips and
                  Jeffery R. Westbrook},
  title        = {On-Line Load Balancing and Network Flow},
  journal      = {Algorithmica},
  volume       = {21},
  number       = {3},
  pages        = {245--261},
  year         = {1998},
  url          = {https://doi.org/10.1007/PL00009214},
  doi          = {10.1007/PL00009214},
  timestamp    = {Mon, 08 Apr 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/PhillipsW98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Trevisan98,
  author       = {Luca Trevisan},
  title        = {Parallel Approximation Algorithms by Positive Linear Programming},
  journal      = {Algorithmica},
  volume       = {21},
  number       = {1},
  pages        = {72--88},
  year         = {1998},
  url          = {https://doi.org/10.1007/PL00009209},
  doi          = {10.1007/PL00009209},
  timestamp    = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Trevisan98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ViolaP98,
  author       = {Alfredo Viola and
                  Patricio V. Poblete},
  title        = {The Analysis of Linear Probing Hashing with Buckets},
  journal      = {Algorithmica},
  volume       = {21},
  number       = {1},
  pages        = {37--71},
  year         = {1998},
  url          = {https://doi.org/10.1007/PL00009208},
  doi          = {10.1007/PL00009208},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/ViolaP98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics