Volume 40,
Number 1,
11 October 1991
Volume 40,
Number 2,
25 October 1991
Volume 40,
Number 3,
8 November 1991
- Alok Aggarwal, Prabhakar Raghavan:
Deferred Data Structure for the Nearest Neighbor Problem.
119-122 BibTeX
- Wen-Lian Hsu, Kuo-Hui Tsai:
Linear Time Algorithms on Circular-Arc Graphs.
123-129 BibTeX
- Sylvia C. Boyd, Hasan Ural:
The Synchronization Problem in Protocol Testing and its Complexity.
131-136 BibTeX
- Shashank K. Mehta, Maharaj Mukherjee, George Nagy:
Constrained Integer Approximation to Planar Line Intersection.
137-139 BibTeX
- Martín Abadi, Bowen Alpern, Krzysztof R. Apt, Nissim Francez, Shmuel Katz, Leslie Lamport, Fred B. Schneider:
Preserving Liveness: Comments on ``Safety and Liveness from a Methodological Point of View''.
141-142 BibTeX
- Frank Dederichs, Rainer Weber:
Reply to the Comments by Martín Abadi et al.
143 BibTeX
- Wen-Huei Chen, Chuan Yi Tang:
Computing the Optimal IO Sequences of a Protocol in Polynomial Time.
145-148 BibTeX
- Richard C. Brewster, Gary MacGillivray:
A Note on Restricted H-Colouring.
149-151 BibTeX
- Sukumar Ghosh:
Binary Self-Stabilization in Distributed Systems.
153-159 BibTeX
- Joel Wein:
Las Vegas RNC Algorithms for Unary Weighted Perfect Matching and T-Join Problems.
161-167 BibTeX
- Andrzej Pelc:
Broadcasting in Complete Networks with Faulty Nodes Using Unreliable Calls.
169-174 BibTeX
Volume 40,
Number 4,
25 November 1991
Volume 40,
Number 5,
13 December 1991
Volume 40,
Number 6,
30 December 1991
Copyright © Sun May 17 00:04:01 2009
by Michael Ley (ley@uni-trier.de)
