Journal of Algorithms, Volume 30

Volume 30, Number 1, January 1999

Arne Andersson: General Balanced Trees. 1-18 BibTeX
Hanmao Shi, Thomas H. Spencer: Time-Work Tradeoffs of the Single-Source Shortest Paths Problem. 19-32 BibTeX
Paul F. Dietz, Rajeev Raman: Small-Rank Selection in Parallel, with Applications to Heap Construction. 33-51 BibTeX
Shang-Hua Teng: Low Energy and Mutually Distant Sampling. 52-67 BibTeX
Yehuda Afek, Eytan Weisberger: The Instancy of Snapshots and Commuting Objects. 68-105 BibTeX
Yehuda Afek, Yishay Mansour, Zvi Ostfeld: Convergence Complexity of Optimistic Rate-Based Flow-Control Algorithms. 106-143 BibTeX
Shay Kutten, David Peleg: Fault-Local Distributed Mending. 144-165 BibTeX
Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan: Distance Approximating Trees for Chordal and Dually Chordal Graphs. 166-184 BibTeX
Javier Yáñez, Javier Montero: A Poset Dimension Algorithm. 185-208 BibTeX

Edith Cohen, David D. Lewis: Approximating Matrix Multiplication for Pattern Recognition Tasks. 211-252 BibTeX
Hiroshi Nagamochi, Toshihide Ibaraki: Augmenting Edge-Connectivity over the Entire Range in Õ(nm) Time. 253-301 BibTeX
Nina Amenta, Marshall W. Bern, David Eppstein: Optimal Point Placement for Mesh Smoothing. 302-322 BibTeX
Fabián A. Chudak, David B. Shmoys: Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds. 323-343 BibTeX
Heather Booth, Rajeev Govindan, Michael A. Langston, Siddharthan Ramachandramurthi: Fast Algorithms forK4Immersion Testing. 344-378 BibTeX
Shlomi Dolev, Evangelos Kranakis, Danny Krizanc: Baked-Potato Routing. 379-399 BibTeX
Aviv Lustig, Oded Shmueli: Acyclic Hypergraph Projections. 400-422 BibTeX
Wei-Mei Chen, Hsien-Kuei Hwang, Gen-Huey Chen: The Cost Distribution of Queue-Mergesort, Optimal Mergesorts, and Power-of-2 Rules. 423-448 BibTeX
Samir Khuller, Pankaj K. Agarwal, Joseph O'Rourke: Open Problems Presented at SCG'98. 449-453 BibTeX