ask others

Algorithmica, Volume 31, 2001

> Home > Journals > Algorithmica

Volume 31, Number 1, 2001

- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/algorithmica/EfratIK01
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/algorithmica/EfratIK01
Alon Efrat, Alon Itai, Matthew J. Katz:
Geometry Helps in Bottleneck Matching and Related Problems. 1-28
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/algorithmica/AwerbuchAFLR01
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/algorithmica/AwerbuchAFLR01
Baruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, Adi Rosén:
On-Line Competitive Algorithms for Call Admission in Optical Networks. 29-43
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/algorithmica/CogolludoR01
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/algorithmica/CogolludoR01
J. C. Cogolludo, Sanguthevar Rajasekaran:
Permutation Routing on Reconfigurable Meshes. 44-57
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/algorithmica/RaviMRRH01
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/algorithmica/RaviMRRH01
R. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III:
Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems. 58-78
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/algorithmica/EidenbenzSW01
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/algorithmica/EidenbenzSW01
Stephan Eidenbenz, Christoph Stamm, Peter Widmayer:
Inapproximability Results for Guarding Polygons and Terrains. 79-113

Volume 31, Number 2, 2001

- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/algorithmica/CsirikJ01
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/algorithmica/CsirikJ01
János Csirik, David S. Johnson:
Bounded Space On-Line Bin Packing: Best Is Better than First. 115-138
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/algorithmica/GolumbicHL01
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/algorithmica/GolumbicHL01
Martin Charles Golumbic, Tirza Hirst, Moshe Lewenstein:
Uniquely Restricted Matchings. 139-154
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/algorithmica/NarayananOS01
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/algorithmica/NarayananOS01
Lata Narayanan, Jaroslav Opatrny, Dominique Sotteau:
All-to-All Optical Routing in Chordal Rings of Degree 4. 155-178
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/algorithmica/GuptaS01
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/algorithmica/GuptaS01
Neelima Gupta, Sandeep Sen:
An Efficient Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains. 179-207
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/algorithmica/YamashitaUSK01
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/algorithmica/YamashitaUSK01
Masafumi Yamashita, Hideki Umemoto, Ichiro Suzuki, Tsunehiko Kameda:
Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers. 208-236

Volume 31, Number 3, 2001

- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/algorithmica/ChoiG01
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/algorithmica/ChoiG01
Vicky Siu-Ngan Choi, Mordecai J. Golin:
Lopsided Trees, I: Analyses. 240-290
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/algorithmica/Devroye01
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/algorithmica/Devroye01
Luc Devroye:
On the Probablistic Worst-Case Time of "Find". 291-303
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/algorithmica/Drmota01a
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/algorithmica/Drmota01a
Michael Drmota:
The Asymptotic Number of Leftist Trees. 304-317
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/algorithmica/JacquetST01
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/algorithmica/JacquetST01
Philippe Jacquet, Wojciech Szpankowski, Jing Tang:
Average Profile of the Lempel-Ziv Parsing Scheme for a Markovian Source. 318-360
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/algorithmica/FlajoletL01
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/algorithmica/FlajoletL01
Philippe Flajolet, Guy Louchard:
Analytic Variations on the Airy Distribution. 361-377
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/algorithmica/HofriS01
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/algorithmica/HofriS01
Micha Hofri, Hadas Shachnai:
Efficient Reorganization of Binary Search Trees. 378-402
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/algorithmica/TsukijiM01
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/algorithmica/TsukijiM01
Tatsuie Tsukiji, Hosam M. Mahmoud:
A Limit Law for Outputs in Random Recursive Circuits. 403-412
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/algorithmica/PanarioR01a
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/algorithmica/PanarioR01a
Daniel Panario, L. Bruce Richmond:
Exact Largest and Smallest Size of Components. 413-432
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/algorithmica/Prodinger01
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/algorithmica/Prodinger01
Helmut Prodinger:
A q-Analogue of the Path Length of Binary Search Trees. 433-441
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/algorithmica/SmytheW01
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/algorithmica/SmytheW01
Robert T. Smythe, J. Wellner:
Stochastic Analysis of Shell Sort. 442-457

Volume 31, Number 4, 2001

- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/algorithmica/Beling01
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/algorithmica/Beling01
Peter A. Beling:
Exact Algorithms for Linear Programming over Algebraic Extensions. 459-478
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/algorithmica/XueLD01
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/algorithmica/XueLD01
Guoliang Xue, Guo-Hui Lin, Ding-Zhu Du:
Grade of Service Steiner Minimum Trees in the Euclidean Plane. 479-500
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/algorithmica/LarsenSW01
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/algorithmica/LarsenSW01
Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer:
Relaxed Balance Using Standard Rotations. 501-512
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/algorithmica/MilidiuL01
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/algorithmica/MilidiuL01
Ruy Luiz Milidiú, Eduardo Sany Laber:
Bounding the Inefficiency of Length-Restricted Prefix Codes. 513-529
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/algorithmica/DasL01
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/algorithmica/DasL01
B. Das, Michael C. Loui:
Reconstructing a Minimum Spanning Tree after Deletion of Any Node. 530-547

maintained by

at