Journal: J. Algorithms

Volume 30, Issue 2

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

Volume 30, Issue 1

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