Algorithmica, Volume 32, 2001

Volume 32, Number 1, 2002

• Andreas Crauser, Paolo Ferragina:
  A Theoretical and Experimental Study on the Construction of Suffix Arrays in External Memory. 1-35
  Electronic Edition (Springer LINK) BibTeX
• Esteban Feuerstein, Alejandro Strejilevich de Loma:
  On-Line Multi-Threaded Paging. 36-60
  Electronic Edition (Springer LINK) BibTeX
• John G. Del Greco, Chandra N. Sekharan, R. Sridhar:
  Fast Parallel Reordering and Isomorphism Testing of k-Trees. 61-72
  Electronic Edition (Springer LINK) BibTeX
• Dan Gusfield, Charles U. Martel:
  The Structure and Complexity of Sports Elimination Numbers. 73-86
  Electronic Edition (Springer LINK) BibTeX
• David Eppstein, Marshall W. Bern, Brad L. Hutchings:
  Algorithms for Coloring Quadtrees. 87-94
  Electronic Edition (Springer LINK) BibTeX
• Yin Li, William F. Smyth:
  Computing the Cover Array in Linear Time. 95-106
  Electronic Edition (Springer LINK) BibTeX
• Tracy Kimbrel:
  Interleaved Prefetching. 107-122
  Electronic Edition (Springer LINK) BibTeX
• Susanne Albers, Klaus Kursawe, Sven Schuierer:
  Exploring Unknown Environments with Obstacles. 123-143
  Electronic Edition (Springer LINK) BibTeX
• Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid:
  Improved Algorithms for Constructing Fault-Tolerant Spanners. 144-156
  Electronic Edition (Springer LINK) BibTeX
• Eric T. Bax, Joel Franklin:
  A Permanent Algorithm with exp[Omega (n^1/3/2 ln n )] Expected Speedup for 0-1 Matrices. 157-162
  Electronic Edition (Springer LINK) BibTeX

Volume 32, Number 2, 2002

• Cynthia A. Phillips, Clifford Stein, Eric Torng, Joel Wein:
  Optimal Time-Critical Scheduling via Resource Augmentation. 163-200
  Electronic Edition (Springer LINK) BibTeX
• Ran Bachrach, Ran El-Yaniv, M. Reinstadtler:
  On the Competitive Theory and Practice of Online List Accessing Algorithms. 201-245
  Electronic Edition (Springer LINK) BibTeX
• Abdel Krim Amoura, Evripidis Bampis, Claire Kenyon, Yannis Manoussakis:
  Scheduling Independent Multiprocessor Tasks. 247-261
  Electronic Edition (Springer LINK) BibTeX
• Yoko Kamidoi, Shin'ichi Wakabayashi, Noriyoshi Yoshida:
  A Divide-and-Conquer Approach to the Minimum k-Way Cut Problem. 262-276
  Electronic Edition (Springer LINK) BibTeX
• Matthew Andrews, Michael A. Bender, Lisa Zhang:
  New Algorithms for Disk Scheduling. 277-301
  Electronic Edition (Springer LINK) BibTeX
• Oded Goldreich, Dana Ron:
  Property Testing in Bounded Degree Graphs. 302-343
  Electronic Edition (Springer LINK) BibTeX

Volume 32, Number 3, 2002

• Jop F. Sibeyn:
  One-by-One Cleaning for Practical Parallel List Ranking. 345-363
  Electronic Edition (Springer LINK) BibTeX
• Amir M. Ben-Amram, Zvi Galil:
  Lower Bounds for Dynamic Data Structures on Algebraic RAMs. 364-395
  Electronic Edition (Springer LINK) BibTeX
• Dimitris Fotakis, Paul G. Spirakis:
  Minimum Congestion Redundant Assignments to Tolerate Random Faults. 396-422
  Electronic Edition (Springer LINK) BibTeX
• Susan Landau, Neil Immerman:
  Embedding Linkages on an Integer Lattice. 423-436
  Electronic Edition (Springer LINK) BibTeX
• James Abello, Adam L. Buchsbaum, Jeffery Westbrook:
  A Functional Approach to External Graph Algorithms. 437-458
  Electronic Edition (Springer LINK) BibTeX
• Edith Cohen, Haim Kaplan:
  Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach. 459-466
  Electronic Edition (Springer LINK) BibTeX
• Thomas Erlebach, Torben Hagerup:
  Routing Flow Through a Strongly Connected Graph. 467-473
  Electronic Edition (Springer LINK) BibTeX
• Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo:
  Quasi-Upward Planarity. 474-506
  Electronic Edition (Springer LINK) BibTeX
• Klaus Jansen, Lorant Porkolab:
  Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks. 507-520
  Electronic Edition (Springer LINK) BibTeX

Volume 32, Number 4, 2002

• Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen:
  Improved Algorithms for Uniform Partitions of Points. 521-539
  Electronic Edition (Springer LINK) BibTeX
• Baruch Awerbuch, Tripurari Singh:
  An Online Algorithm for the Dynamic Maximal Dense Tree Problem. 540-553
  Electronic Edition (Springer LINK) BibTeX
• Lusheng Wang, Ding-Zhu Du:
  Approximations for a Bottleneck Steiner Tree Problem. 554-561
  Electronic Edition (Springer LINK) BibTeX
• Tzuoo-Hawn Yeh, Cheng-Ming Kuo, Chin-Laung Lei, Hsu-Chun Yen:
  Distributed and On-Line Routing on Tori. 562-593
  Electronic Edition (Springer LINK) BibTeX
• Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller:
  A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems. 594-610
  Electronic Edition (Springer LINK) BibTeX
• Noga Alon, Ayal Zaks:
  Algorithmic Aspects of Acyclic Edge Colorings. 611-614
  Electronic Edition (Springer LINK) BibTeX
• Uwe Schöning:
  A Probabilistic Algorithm for k -SAT Based on Limited Local Search and Restart. 615-623
  Electronic Edition (Springer LINK) BibTeX
• Sandy Irani:
  Randomized Weighted Caching with Two Page Weights. 624-640
  Electronic Edition (Springer LINK) BibTeX
• Andris Ambainis, Stephen A. Bloch, David L. Schweizer:
  Delayed Binary Search, or Playing Twenty Questions with a Procrastinator. 641-651
  Electronic Edition (Springer LINK) BibTeX
• Hadas Shachnai, Tami Tamir:
  Multiprocessor Scheduling with Machine Allotment and Parallelism Constraints. 651-678
  Electronic Edition (Springer LINK) BibTeX
• Lata Narayanan, Sunil M. Shende:
  Corrigendum: Static Frequency Assignment in Cellular Networks. 679
  Electronic Edition (Springer LINK) BibTeX