Algorithmica, Volume 24, 1999

Volume 24, Number 1, 1999

• Monika Rauch Henzinger, Valerie King, Tandy Warnow:
  Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology. 1-13
  Electronic Edition (Springer LINK) BibTeX
• Yanjun Zhang, A. Ortynski:
  Efficiency of Randomized Parallel Backtrack Search. 14-28
  Electronic Edition (Springer LINK) BibTeX
• Stefano Leonardi, Alberto Marchetti-Spaccamela:
  On-Line Resource Management with Application to Routing and Scheduling. 29-49
  Electronic Edition (Springer LINK) BibTeX
• Svante Carlsson, Bengt J. Nilsson:
  Computing Vision Points in Polygons. 50-75
  Electronic Edition (Springer LINK) BibTeX
• Paul Pritchard:
  A Fast Bit-Parallel Algorithm for Computing the Subset Partial Order. 76-86
  Electronic Edition (Springer LINK) BibTeX

Volume 24, Number 2, 1999

• Bin Fu, Richard Beigel:
  A Comparison of Resource-Bounded Molecular Computation Models. 87-95
  Electronic Edition (Springer LINK) BibTeX
• Haim Kaplan, Ron Shamir:
  Bounded Degree Interval Sandwich Problems. 96-104
  Electronic Edition (Springer LINK) BibTeX
• Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos:
  Isomorphism for Graphs of Bounded Distance Width. 105-127
  Electronic Edition (Springer LINK) BibTeX
• Ravi Kumar, Alexander Russell, Ravi Sundaram:
  Approximating Latin Square Extensions. 128-138
  Electronic Edition (Springer LINK) BibTeX
• Frank Thomson Leighton, Eric J. Schwabe:
  Efficient Algorithms for Dynamic Allocation of Distributed Memo. 139-171
  Electronic Edition (Springer LINK) BibTeX

Volume 24, Numbers 3-4, 1999

• Frank K. H. A. Dehne:
  Guest Editor's Introduction. 173-176
  Electronic Edition (Springer LINK) BibTeX
• Paolo Ferragina, Fabrizio Luccio:
  String Search in Coarse-Grained Parallel Computers. 177-194
  Electronic Edition (Springer LINK) BibTeX
• Afonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin, Stéphane Ubéda:
  d-Dimensional Range Search on Multicomputers. 195-208
  Electronic Edition (Springer LINK) BibTeX
• Armin Bäumker, Wolfgang Dittrich, Andrea Pietracaprina:
  The Complexity of Parallel Multisearch on Coarse-Grained Machines. 209-242
  Electronic Edition (Springer LINK) BibTeX
• Guy E. Blelloch, Jonathan C. Hardwick, Gary L. Miller, Dafna Talmor:
  Design and Implementation of a Practical Parallel Delaunay Algorithm. 243-269
  Electronic Edition (Springer LINK) BibTeX
• Xiaotie Deng, Binhai Zhu:
  A Randomized Algorithm for the Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors. 270-286
  Electronic Edition (Springer LINK) BibTeX
• William F. McColl, Alexandre Tiskin:
  Memory-Efficient Matrix Multiplication in the BSP Model. 287-297
  Electronic Edition (Springer LINK) BibTeX
• Young Won Lim, Prashanth B. Bhat, Viktor K. Prasanna:
  Efficient Algorithms for Block-Cyclic Redistribution of Arrays. 298-330
  Electronic Edition (Springer LINK) BibTeX
• Erich Kaltofen, A. Lobo:
  Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields. 331-348
  Electronic Edition (Springer LINK) BibTeX
• Thomas H. Cormen, James C. Clippinger:
  Performing BMMC Permutations Efficiently on Distributed-Memory Multiprocessors with MPI. 349-370
  Electronic Edition (Springer LINK) BibTeX
• E. L. G. Saukas, S. W. Song:
  A Note on Parallel Selection on Coarse-Grained Multicomputers. 371-380
  Electronic Edition (Springer LINK) BibTeX
• Micah Adler, Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran:
  Modeling Parallel Bandwidth: Local versus Global Restrictions. 381-404
  Electronic Edition (Springer LINK) BibTeX
• Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Kieran T. Herley, Paul G. Spirakis:
  BSP versus LogP. 405-422
  Electronic Edition (Springer LINK) BibTeX