Volume 63,
Number 1,
14 July 1997
Volume 63,
Number 2,
28 July 1997
- Kuo-Liang Chung:
A Fast Algorithm for Stereo Matching.
57-61
Electronic Edition (link) BibTeX
- Refael Hassin, Shlomi Rubinstein:
An Approximation Algorithm for Maximum Packing of 3-Edge Paths.
63-67
Electronic Edition (link) BibTeX
- J. G. Gaines:
Partitions with Minimum Entropy of Regions in R².
69-73
Electronic Edition (link) BibTeX
- Gudmund Skovbjerg Frandsen, Sven Skyum:
Dynamic Maintenance of Majority Information in Constant Time per Update.
75-78
Electronic Edition (link) BibTeX
- Marek Chrobak, Lawrence L. Larmore, Carsten Lund, Nick Reingold:
A Better Lower Bound on the Competitive Ratio of the Randomized 2-Server Problem.
79-83
Electronic Edition (link) BibTeX
- Costas Busch, Marios Mavronicolas:
Impossibility Results for Weak Threshold Networks.
85-90
Electronic Edition (link) BibTeX
- Wilfried Imrich, Sandi Klavzar:
Recognizing Hamming Graphs in Linear Time and space.
91-95
Electronic Edition (link) BibTeX
- Tiziana Calamoneri, Andrea Sterbini:
3D Straight-Line Grid Drawing of 4-Colorable Graphs.
97-102
Electronic Edition (link) BibTeX
- Jan-Ming Ho, Ming-Tat Ko:
Bounded Fan-Out m-Center Problem.
103-108
Electronic Edition (link) BibTeX
- Yehuda Afek, Menashe Cohen, Eyal Haalman:
The Bit Complexity of the Predecessor Problem.
109-112
Electronic Edition (link) BibTeX
- Robert Geist:
Performance Bounds for Modeling NUMA Architectures.
113-117
Electronic Edition (link) BibTeX
Volume 63,
Number 3,
14 August 1997
Volume 63,
Number 4,
28 August 1997
- János Csirik, Gerhard J. Woeginger:
Shelf Algorithms for On-Line Strip Packing.
171-175
Electronic Edition (link) BibTeX
- Kumar N. Lalgudi, Marios C. Papaefthymiou:
Computing Strictly-Second Shortest Paths.
177-181
Electronic Edition (link) BibTeX
- Kunsoo Park, Sang Lyul Min, Yookun Cho:
The Working Set Algorithm has Competitive Ratio Less Than Two.
183-188
Electronic Edition (link) BibTeX
- Prabhudev Konana, Juhnyoung Lee, Sudha Ram:
Updating Timestamp Interval for Dynamic Adjustment of Serialization Order in Optimistic Concurrency Control-Time Interval (OCCTI) Protocol.
189-193
Electronic Edition (link) BibTeX
- Maxime Crochemore, Thierry Lecroq:
Tight Bounds on the Complexity of the Apostolico-Giancarlo Algorithm.
195-203
Electronic Edition (link) BibTeX
- Sying-Jyan Wang:
Distributed Routing in a Fault-Tolerant Multistage Interconnection Network.
205-210
Electronic Edition (link) BibTeX
- Nader H. Bshouty, Yishay Mansour, Baruch Schieber, Prasoon Tiwari:
A Tight Bound for Approximating the Square Root.
211-213
Electronic Edition (link) BibTeX
- Mark de Berg, Olivier Devillers, Katrin Dobrindt, Otfried Schwarzkopf:
Computing a Single Cell in the Overlay of Two Simple Polygons.
215-219
Electronic Edition (link) BibTeX
- Jürgen Ebert, Gottfried Vossen:
I-Serializability: Generalized Correctness for Transaction-Based Environments.
221-227
Electronic Edition (link) BibTeX
Volume 63,
Number 5,
15 September 1997
Volume 63,
Number 6,
29 September 1997
Copyright © Sun May 17 00:04:04 2009
by Michael Ley (ley@uni-trier.de)