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
- Wen-Lian Hsu, Kuo-Hui Tsai:
Linear Time Algorithms on Circular-Arc Graphs.
123-129
- Sylvia C. Boyd, Hasan Ural:
The Synchronization Problem in Protocol Testing and its Complexity.
131-136
- Shashank K. Mehta, Maharaj Mukherjee, George Nagy:
Constrained Integer Approximation to Planar Line Intersection.
137-139
- 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
- Frank Dederichs, Rainer Weber:
Reply to the Comments by Martín Abadi et al.
143
- Wen-Huei Chen, Chuan Yi Tang:
Computing the Optimal IO Sequences of a Protocol in Polynomial Time.
145-148
- Richard C. Brewster, Gary MacGillivray:
A Note on Restricted H-Colouring.
149-151
- Sukumar Ghosh:
Binary Self-Stabilization in Distributed Systems.
153-159
- Joel Wein:
Las Vegas RNC Algorithms for Unary Weighted Perfect Matching and T-Join Problems.
161-167
- Andrzej Pelc:
Broadcasting in Complete Networks with Faulty Nodes Using Unreliable Calls.
169-174
Volume 40,
Number 4,
25 November 1991
- Jeffrey K. Uhlmann:
Satisfying General Proximity/Similarity Queries with Metric Trees.
175-179
- Teofilo F. Gonzalez:
Covering a Set of Points in Multidimensional Space.
181-188
- Dan Halperin, Micha Sharir:
On Disjoint Concave Chains in Arrangements of (Pseudo) Lines.
189-192
- Bin Jiang:
DFS-Traversing Graphs in a Paging Environment, LRU or MRU?
193-196
- Stefan Rönn:
On the Logarithmic Evaluation of Recurrence Relations.
197-199
- Do-Hyung Kim, Kwang-Moo Choe:
Yet Another Efficient Backward Execution Algorithm in the AND/OR Process Model.
201-211
- Thierry Massart:
An Agent Calculus with Simple Actions Where the Enabling and Disabling are Derived Operators.
213-218
- Ferroudja Cherief, Ph. Schnoebelen:
\tau-Bisimulations and Full Abstraction for Refinement of Actions.
219-222
- Rong Lin:
Fast Algorithms for Lowest Common Ancestors on a Processor Array with Reconfigurable Buses.
223-230
Volume 40,
Number 5,
13 December 1991
Volume 40,
Number 6,
30 December 1991
Copyright © Sun Nov 8 03:33:31 2009
by Michael Ley (ley@uni-trier.de)
