Volume 24, Number 1, July 1997
- Shlomo Moran, Gadi Taubenfeld:
A Lower Bound on Wait-Free Counting.
1-19
- S. Haldar:
An `All Pairs Shortest Paths' Distributed Algorithm Using 2n² Messages.
20-36
- Greg N. Frederickson:
A Data Structure for Dynamically Maintaining Rooted Trees.
37-65
- Susanne E. Hambrusch, Hung-Yi Tu:
Edge Weight Reduction Problems in Directed Acyclic Graphs.
66-93
- Hans L. Bodlaender, Joost Engelfriet:
Domino Treewidth.
94-123
- Marek Chrobak, Lawrence L. Larmore, Nick Reingold, Jeffery Westbrook:
Page Migration Algorithms Using Work Functions.
124-157
- Shimon Even, Ami Litman, Peter Winkler:
Computing with Snakes in Directed Networks of Automata.
158-170
- Andrei Z. Broder, Ernst W. Mayr:
Counting Minimum Weight Spanning Trees.
171-176
- David Eppstein, Daniel S. Hirschberg:
Choosing Subsets with Maximum Weighted Average.
177-193
- Monika Rauch Henzinger:
A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity.
194-220
Volume 24, Number 2, August 1997
- Raffaele Giancarlo, Roberto Grossi:
Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms.
223-265
- Nili Guttmann-Beck, Refael Hassin:
Approximation Algorithms for Min-Max Tree Partition.
266-286
- J. Andrew Fingerhut, Subhash Suri, Jonathan S. Turner:
Designing Least-Cost Nonblocking Broadband Networks.
287-309
- Sándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal E. Young:
A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees.
310-324
- Amihood Amir, Alberto Apostolico, Moshe Lewenstein:
Inverse Pattern Matching.
325-339
- Dany Breslauer, Tao Jiang, Zhigen Jiang:
Rotations of Periodic Strings and Short Superstrings.
340-353
- Amihood Amir, Gary Benson, Martin Farach:
Optimal Two-Dimensional Compressed Matching.
354-379
- R. Balasubramanian, Venkatesh Raman, G. Srinivasaragavan:
Finding Scores in Tournaments.
380-394
- O. Dubios, Yacine Boufkhad:
A General Upper Bound for the Satisfiability Threshold of Random r-SAT Formulae.
395-420
Last update Fri May 17 20:22:57 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
