default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 31, 2001
Volume 31, Number 1, 2001
- Alon Efrat
, Alon Itai, Matthew J. Katz:
Geometry Helps in Bottleneck Matching and Related Problems. 1-28 - Baruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, Adi Rosén:
On-Line Competitive Algorithms for Call Admission in Optical Networks. 29-43 - J. C. Cogolludo, Sanguthevar Rajasekaran:
Permutation Routing on Reconfigurable Meshes. 44-57 - 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 - Stephan J. Eidenbenz, Christoph Stamm, Peter Widmayer:
Inapproximability Results for Guarding Polygons and Terrains. 79-113
Volume 31, Number 2, 2001
- János Csirik, David S. Johnson:
Bounded Space On-Line Bin Packing: Best Is Better than First. 115-138 - Martin Charles Golumbic, Tirza Hirst, Moshe Lewenstein:
Uniquely Restricted Matchings. 139-154 - Lata Narayanan, Jaroslav Opatrny, Dominique Sotteau:
All-to-All Optical Routing in Chordal Rings of Degree 4. 155-178 - Neelima Gupta, Sandeep Sen:
An Efficient Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains. 179-207 - 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
- Vicky Siu-Ngan Choi, Mordecai J. Golin:
Lopsided Trees, I: Analyses. 240-290 - Luc Devroye:
On the Probablistic Worst-Case Time of "Find". 291-303 - Michael Drmota:
The Asymptotic Number of Leftist Trees. 304-317 - Philippe Jacquet, Wojciech Szpankowski, Jing Tang:
Average Profile of the Lempel-Ziv Parsing Scheme for a Markovian Source. 318-360 - Philippe Flajolet, Guy Louchard:
Analytic Variations on the Airy Distribution. 361-377 - Micha Hofri, Hadas Shachnai:
Efficient Reorganization of Binary Search Trees. 378-402 - Tatsuie Tsukiji, Hosam M. Mahmoud:
A Limit Law for Outputs in Random Recursive Circuits. 403-412 - Daniel Panario, L. Bruce Richmond:
Exact Largest and Smallest Size of Components. 413-432 - Helmut Prodinger:
A q-Analogue of the Path Length of Binary Search Trees. 433-441 - Robert T. Smythe, J. Wellner:
Stochastic Analysis of Shell Sort. 442-457
Volume 31, Number 4, 2001
- Peter A. Beling:
Exact Algorithms for Linear Programming over Algebraic Extensions. 459-478 - Guoliang Xue, Guo-Hui Lin, Ding-Zhu Du:
Grade of Service Steiner Minimum Trees in the Euclidean Plane. 479-500 - Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer:
Relaxed Balance Using Standard Rotations. 501-512 - Ruy Luiz Milidiú, Eduardo Sany Laber:
Bounding the Inefficiency of Length-Restricted Prefix Codes. 513-529 - B. Das, Michael C. Loui:
Reconstructing a Minimum Spanning Tree after Deletion of Any Node. 530-547
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.
last updated on 2025-03-21 23:50 CET 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:
