Algorithmica, Volume 23, 1999

Volume 23, Number 1, 1999

• Dennis Moore, William F. Smyth, D. Miller:
  Counting Distinct Strings. 1-13
  
• Xiaotie Deng, Elias Koutsoupias, Philip D. MacKenzie:
  Competitive Implementation of Parallel Programs. 14-30
  
• P. Krishnan, Philip M. Long, Jeffrey Scott Vitter:
  Adaptive Disk Spindown via Optimal Rent-to-Buy in Probabilistic Environments. 31-56
  
• Hristo Djidjev, John R. Gilbert:
  Separators in Graphs with Negative and Multiple Vertex Weights. 57-71
  
• Lata Narayanan, Jaroslav Opatrny:
  Compact Routing on Chordal Rings of Degree 4. 72-96
  

Volume 23, Number 2, 1999

• Luc Devroye:
  A Note on the Expected Time for Finding Maxima by List Algorithms. 97-108
  
• S. Nicoloso, Majid Sarrafzadeh, X. Song:
  On the Sum Coloring Problem on Interval Graphs. 109-126
  
• Ricardo A. Baeza-Yates, Gonzalo Navarro:
  Faster Approximate String Matching. 127-158
  
• Konstantinos Kalpakis, Yaacov Yesha:
  Upper and Lower Bounds on the Makespan of Schedules for Tree Dags on Linear Arrays. 159-179
  
• Marek Chrobak, John Noga:
  LRU Is Better than FIFO. 180-185
  

Volume 23, Number 3, 1999

• Amir H. Farrahi, D. T. Lee, Majid Sarrafzadeh:
  Two-Way and Multiway Partitioning of a Set of Intervals for Clique-Width Maximization. 187-210
  
• Panos M. Pardalos, Guoliang Xue:
  Algorithms for a Class of Isotonic Regression Problems. 211-222
  
• Vincenzo Auletta, Angelo Monti, Mimmo Parente, Pino Persiano:
  A Linear-Time Algorithm for the Feasibility of Pebble Motion on Trees. 223-245
  
• Arne Andersson, N. Jesper Larsson, Kurt Swanson:
  Suffix Trees on Words. 246-260
  
• G. Ramalingam, Junehwa Song, Leo Joskowicz, Raymond E. Miller:
  Solving Systems of Difference Constraints Incrementally. 261-275
  

Volume 23, Number 4, 1999

• Jin-yi Cai, C. K. Wong:
  Foreword. 277
  
• Matthew Andrews, Michel X. Goemans, Lisa Zhang:
  Improved Bounds for On-Line Load Balancing. 278-301
  
• Giuseppe Di Battista, Roberto Tamassia, Luca Vismara:
  Output-Sensitive Reporting of Disjoint Paths. 302-340
  
• Vince Grolmusz:
  Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions. 341-353
  
• Guoliang Xue, Ding-Zhu Du:
  An O(n log n) Average Time Algorithm for Computing the Shortest Network under a Given Topology. 354-362
  
• Jay Belanger, Aduri Pavan, Jie Wang:
  Reductions Do Not Preserve Fast Convergence Rates in Average Time. 363-373