Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/algorithmica/algorithmica29.bht:"
download as .bib file
@article{DBLP:journals/algorithmica/AndrewsK01,
author = {George E. Andrews and
Arnold Knopfmacher},
title = {An Algorithmic Approach to Discovering and Proving q-Series Identities},
journal = {Algorithmica},
volume = {29},
number = {1},
pages = {34--43},
year = {2001},
url = {https://doi.org/10.1007/BF02679612},
doi = {10.1007/BF02679612},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AndrewsK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AtallahCD01,
author = {Mikhail J. Atallah and
Fr{\'{e}}d{\'{e}}ric Chyzak and
Philippe Dumas},
title = {A Randomized Algorithm for Approximate String Matching},
journal = {Algorithmica},
volume = {29},
number = {3},
pages = {468--486},
year = {2001},
url = {https://doi.org/10.1007/s004530010062},
doi = {10.1007/S004530010062},
timestamp = {Mon, 09 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AtallahCD01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AusielloFLST01,
author = {Giorgio Ausiello and
Esteban Feuerstein and
Stefano Leonardi and
Leen Stougie and
Maurizio Talamo},
title = {Algorithms for the On-Line Travelling Salesman},
journal = {Algorithmica},
volume = {29},
number = {4},
pages = {560--581},
year = {2001},
url = {https://doi.org/10.1007/s004530010071},
doi = {10.1007/S004530010071},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AusielloFLST01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AvidorAS01,
author = {Adi Avidor and
Yossi Azar and
Jir{\'{\i}} Sgall},
title = {Ancient and New Algorithms for Load Balancing in the \emph{l}\({}_{\mbox{p}}\)
Norm},
journal = {Algorithmica},
volume = {29},
number = {3},
pages = {422--441},
year = {2001},
url = {https://doi.org/10.1007/s004530010051},
doi = {10.1007/S004530010051},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AvidorAS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Bar-YehudaR01,
author = {Reuven Bar{-}Yehuda and
Dror Rawitz},
title = {Efficient Algorithms for Integer Programs with Two Variables per Constraint},
journal = {Algorithmica},
volume = {29},
number = {4},
pages = {595--609},
year = {2001},
url = {https://doi.org/10.1007/s004530010075},
doi = {10.1007/S004530010075},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Bar-YehudaR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BattitiP01,
author = {Roberto Battiti and
Marco Protasi},
title = {Reactive Local Search for the Maximum Clique Problem},
journal = {Algorithmica},
volume = {29},
number = {4},
pages = {610--637},
year = {2001},
url = {https://doi.org/10.1007/s004530010074},
doi = {10.1007/S004530010074},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BattitiP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BodlaenderF01,
author = {Hans L. Bodlaender and
Babette van Antwerpen{-}de Fluiter},
title = {Parallel Algorithms for Series Parallel Graphs and Graphs with Treewidth
Two},
journal = {Algorithmica},
volume = {29},
number = {4},
pages = {534--559},
year = {2001},
url = {https://doi.org/10.1007/s004530010070},
doi = {10.1007/S004530010070},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BodlaenderF01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChernH01,
author = {Hua{-}Huai Chern and
Hsien{-}Kuei Hwang},
title = {Transitional Behaviors of the Average Cost of Quicksort with Median-of-(2t+1)},
journal = {Algorithmica},
volume = {29},
number = {1},
pages = {44--69},
year = {2001},
url = {https://doi.org/10.1007/BF02679613},
doi = {10.1007/BF02679613},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChernH01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ClementFV01,
author = {Julien Cl{\'{e}}ment and
Philippe Flajolet and
Brigitte Vall{\'{e}}e},
title = {Dynamical Sources in Information Theory: {A} General Analysis of Trie
Structures},
journal = {Algorithmica},
volume = {29},
number = {1},
pages = {307--369},
year = {2001},
url = {https://doi.org/10.1007/BF02679623},
doi = {10.1007/BF02679623},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ClementFV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CoffmanS01,
author = {Edward G. Coffman Jr. and
Alexander L. Stolyar},
title = {Bandwidth Packing},
journal = {Algorithmica},
volume = {29},
number = {1},
pages = {70--88},
year = {2001},
url = {https://doi.org/10.1007/BF02679614},
doi = {10.1007/BF02679614},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CoffmanS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Drmota01,
author = {Michael Drmota},
title = {An Analytic Approach to the Height of Binary Search Trees},
journal = {Algorithmica},
volume = {29},
number = {1},
pages = {89--119},
year = {2001},
url = {https://doi.org/10.1007/BF02679615},
doi = {10.1007/BF02679615},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Drmota01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DrmotaGG01,
author = {Michael Drmota and
Dani{\`{e}}le Gardy and
Bernhard Gittenberger},
title = {A Unified Presentation of Some Urn Models},
journal = {Algorithmica},
volume = {29},
number = {1},
pages = {120--147},
year = {2001},
url = {https://doi.org/10.1007/BF02679616},
doi = {10.1007/BF02679616},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DrmotaGG01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FeigePK01,
author = {Uriel Feige and
Guy Kortsarz and
David Peleg},
title = {The Dense \emph{k}-Subgraph Problem},
journal = {Algorithmica},
volume = {29},
number = {3},
pages = {410--421},
year = {2001},
url = {https://doi.org/10.1007/s004530010050},
doi = {10.1007/S004530010050},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FeigePK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Gonzalez01,
author = {Teofilo F. Gonzalez},
title = {Simple Algorithms for Multimessage Multicasting with Forwarding},
journal = {Algorithmica},
volume = {29},
number = {4},
pages = {511--533},
year = {2001},
url = {https://doi.org/10.1007/s004530010072},
doi = {10.1007/S004530010072},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Gonzalez01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HansenS01,
author = {Jennie C. Hansen and
Eric Schmutz},
title = {Near-Optimal Bounded-Degree Spanning Trees},
journal = {Algorithmica},
volume = {29},
number = {1},
pages = {148--180},
year = {2001},
url = {https://doi.org/10.1007/BF02679617},
doi = {10.1007/BF02679617},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HansenS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KabadiA01,
author = {Santosh N. Kabadi and
Yash P. Aneja},
title = {Equivalence of epsilon-Approximate Separation and Optimization in
Fixed Dimensions},
journal = {Algorithmica},
volume = {29},
number = {4},
pages = {582--594},
year = {2001},
url = {https://doi.org/10.1007/s004530010073},
doi = {10.1007/S004530010073},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KabadiA01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MahajanRS01,
author = {Sanjeev Mahajan and
Edgar A. Ramos and
K. V. Subrahmanyam},
title = {Solving Some Discrepancy Problems in {NC}},
journal = {Algorithmica},
volume = {29},
number = {3},
pages = {371--395},
year = {2001},
url = {https://doi.org/10.1007/s004530010046},
doi = {10.1007/S004530010046},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MahajanRS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MartinezPP01,
author = {Conrado Martinez and
Alois Panholzer and
Helmut Prodinger},
title = {Partial Match Queries in Relaxed Multidimensional Search Trees},
journal = {Algorithmica},
volume = {29},
number = {1},
pages = {181--204},
year = {2001},
url = {https://doi.org/10.1007/BF02679618},
doi = {10.1007/BF02679618},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MartinezPP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/NarayananS01,
author = {Lata Narayanan and
Sunil M. Shende},
title = {Static Frequency Assignment in Cellular Networks},
journal = {Algorithmica},
volume = {29},
number = {3},
pages = {396--409},
year = {2001},
url = {https://doi.org/10.1007/s004530010067},
doi = {10.1007/S004530010067},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/NarayananS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PanarioR01,
author = {Daniel Panario and
L. Bruce Richmond},
title = {Smallest Components in Decomposable Structures: Exp-Log Class},
journal = {Algorithmica},
volume = {29},
number = {1},
pages = {205--226},
year = {2001},
url = {https://doi.org/10.1007/BF02679619},
doi = {10.1007/BF02679619},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/PanarioR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Poblete01,
author = {Patricio V. Poblete},
title = {Analysis of an Adaptive Algorithm to Find the Two Nearest Neighbors},
journal = {Algorithmica},
volume = {29},
number = {1},
pages = {227--237},
year = {2001},
url = {https://doi.org/10.1007/BF02679620},
doi = {10.1007/BF02679620},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Poblete01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ProdingerS01,
author = {Helmut Prodinger and
Wojciech Szpankowski},
title = {Average-Case Analysis of Algorithms - Preface},
journal = {Algorithmica},
volume = {29},
number = {1},
pages = {1--2},
year = {2001},
url = {https://doi.org/10.1007/BF02679610},
doi = {10.1007/BF02679610},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ProdingerS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Reif01,
author = {John H. Reif},
title = {Efficient Parallel Computation of the Characteristic Polynomial of
a Sparse, Separable Matrix},
journal = {Algorithmica},
volume = {29},
number = {3},
pages = {487--510},
year = {2001},
url = {https://doi.org/10.1007/s004530010068},
doi = {10.1007/S004530010068},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Reif01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Rosler01,
author = {Uwe R{\"{o}}sler},
title = {On the Analysis of Stochastic Divide and Conquer Algorithms},
journal = {Algorithmica},
volume = {29},
number = {1},
pages = {238--261},
year = {2001},
url = {https://doi.org/10.1007/BF02679621},
doi = {10.1007/BF02679621},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Rosler01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/RoslerR01,
author = {Uwe R{\"{o}}sler and
Ludger R{\"{u}}schendorf},
title = {The Contraction Method for Recursive Algorithms},
journal = {Algorithmica},
volume = {29},
number = {1},
pages = {3--33},
year = {2001},
url = {https://doi.org/10.1007/BF02679611},
doi = {10.1007/BF02679611},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/RoslerR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ShachnaiT01,
author = {Hadas Shachnai and
Tami Tamir},
title = {On Two Class-Constrained Versions of the Multiple Knapsack Problem},
journal = {Algorithmica},
volume = {29},
number = {3},
pages = {442--467},
year = {2001},
url = {https://doi.org/10.1007/s004530010057},
doi = {10.1007/S004530010057},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ShachnaiT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Vallee01,
author = {Brigitte Vall{\'{e}}e},
title = {Dynamical Sources in Information Theory: Fundamental Intervals and
Word Prefixes},
journal = {Algorithmica},
volume = {29},
number = {1},
pages = {262--306},
year = {2001},
url = {https://doi.org/10.1007/BF02679622},
doi = {10.1007/BF02679622},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Vallee01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/WengS01,
author = {J. F. Weng and
J. MacGregor Smith},
title = {Steiner Minimal Trees with One Polygonal Obstacle},
journal = {Algorithmica},
volume = {29},
number = {4},
pages = {638--648},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0002-1},
doi = {10.1007/S00453-001-0002-1},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/WengS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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-07-28 07:56 CEST 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:
