default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 29, 2001
Volume 29, Number 1/2, 2001
- Helmut Prodinger, Wojciech Szpankowski:
Average-Case Analysis of Algorithms - Preface. 1-2 - Uwe Rösler, Ludger Rüschendorf:
The Contraction Method for Recursive Algorithms. 3-33 - George E. Andrews, Arnold Knopfmacher:
An Algorithmic Approach to Discovering and Proving q-Series Identities. 34-43 - Hua-Huai Chern, Hsien-Kuei Hwang
:
Transitional Behaviors of the Average Cost of Quicksort with Median-of-(2t+1). 44-69 - Edward G. Coffman Jr., Alexander L. Stolyar:
Bandwidth Packing. 70-88 - Michael Drmota:
An Analytic Approach to the Height of Binary Search Trees. 89-119 - Michael Drmota, Danièle Gardy, Bernhard Gittenberger:
A Unified Presentation of Some Urn Models. 120-147 - Jennie C. Hansen, Eric Schmutz:
Near-Optimal Bounded-Degree Spanning Trees. 148-180 - Conrado Martinez, Alois Panholzer, Helmut Prodinger:
Partial Match Queries in Relaxed Multidimensional Search Trees. 181-204 - Daniel Panario, L. Bruce Richmond:
Smallest Components in Decomposable Structures: Exp-Log Class. 205-226 - Patricio V. Poblete:
Analysis of an Adaptive Algorithm to Find the Two Nearest Neighbors. 227-237 - Uwe Rösler:
On the Analysis of Stochastic Divide and Conquer Algorithms. 238-261 - Brigitte Vallée:
Dynamical Sources in Information Theory: Fundamental Intervals and Word Prefixes. 262-306 - Julien Clément, Philippe Flajolet, Brigitte Vallée:
Dynamical Sources in Information Theory: A General Analysis of Trie Structures. 307-369
Volume 29, Number 3, 2001
- Sanjeev Mahajan, Edgar A. Ramos, K. V. Subrahmanyam:
Solving Some Discrepancy Problems in NC. 371-395 - Lata Narayanan, Sunil M. Shende:
Static Frequency Assignment in Cellular Networks. 396-409 - Uriel Feige, Guy Kortsarz, David Peleg:
The Dense k-Subgraph Problem. 410-421 - Adi Avidor, Yossi Azar, Jirí Sgall:
Ancient and New Algorithms for Load Balancing in the lp Norm. 422-441 - Hadas Shachnai, Tami Tamir:
On Two Class-Constrained Versions of the Multiple Knapsack Problem. 442-467 - Mikhail J. Atallah, Frédéric Chyzak, Philippe Dumas:
A Randomized Algorithm for Approximate String Matching. 468-486 - John H. Reif:
Efficient Parallel Computation of the Characteristic Polynomial of a Sparse, Separable Matrix. 487-510
Volume 29, Number 4, 2001
- Teofilo F. Gonzalez:
Simple Algorithms for Multimessage Multicasting with Forwarding. 511-533 - Hans L. Bodlaender, Babette van Antwerpen-de Fluiter:
Parallel Algorithms for Series Parallel Graphs and Graphs with Treewidth Two. 534-559 - Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo:
Algorithms for the On-Line Travelling Salesman. 560-581 - Santosh N. Kabadi, Yash P. Aneja:
Equivalence of epsilon-Approximate Separation and Optimization in Fixed Dimensions. 582-594 - Reuven Bar-Yehuda, Dror Rawitz:
Efficient Algorithms for Integer Programs with Two Variables per Constraint. 595-609 - Roberto Battiti, Marco Protasi:
Reactive Local Search for the Maximum Clique Problem. 610-637 - J. F. Weng, J. MacGregor Smith:
Steiner Minimal Trees with One Polygonal Obstacle. 638-648
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-04 21:12 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:
