Volume 25,
Number 1,
April 1987
- Jik H. Chang, Oscar H. Ibarra, Bala Ravikumar, Leonard Berman:
Some Observations Concerning Alternating Turing Machines Using Small Space.
1-9 BibTeX
- Avraham A. Melkman:
On-Line Construction of the Convex Hull of a Simple Polyline.
11-12 BibTeX
- Bernd Kirsig, Klaus-Jörn Lange:
Separation with the Ruzzo, Simon, and Tompa Relativization Implies DSPACE(log n) != NSPACE(log n).
13-15 BibTeX
- Richard G. Hamlet:
Probable Correctness Theory.
17-25 BibTeX
- Rodney R. Howell, Louis E. Rosier, Hsu-Chun Yen:
An O(n^(1.5)) Algorithm to Decide Boundedness for Conflict-Free Vector Replacement Systems.
27-33 BibTeX
- George Cybenko, David W. Krumme, K. N. Venkataraman:
Fixed Hypercube Embedding.
35-39 BibTeX
- Jean-Paul Laumond:
Obstacle Growing in a Nonpolygonal World.
41-50 BibTeX
- Joseph Naor:
A Fast Parallel Coloring of Planar Graphs with Five Colors.
51-53 BibTeX
- Cao An Wang, Yung H. Tsin:
An O(log n) Time Parallel Algorithm for Triangulating a Set of Points in the Plane.
55-60 BibTeX
- Gary A. Hyslop, Edmund A. Lamagna:
Performance of Distributive Partitioned Sort in a Demand Paging Environment.
61-64 BibTeX
- John H. Reif:
A Topological Approach to Dynamic Graph Connectivity.
65-70 BibTeX
Volume 25,
Number 2,
May 1987
- C. A. R. Hoare, Jifeng He, Jeff W. Sanders:
Prespecification in Data Refinement.
71-76 BibTeX
- Jyrki Katajainen, Olli Nevalainen, Jukka Teuhola:
A Linear Expected-Time Algorithm for Computing Planar Relative Neighbourhood Graphs.
77-86 BibTeX
- Mikhail J. Atallah, Chandrajit L. Bajaj:
Efficient Algorithms for Common Transversals.
87-91 BibTeX
- Manfred Broy:
Predicative Specifications for Functional Programs Describing Communication Networks.
93-101 BibTeX
- K. B. Lakshmanan, N. Meenakshi, Krishnaiyan Thulasiraman:
A Time-Optimal Message-Efficient Distributed Algorithm for Depth-First-Search.
103-109 BibTeX
- Alan M. Frieze:
Parallel Algorithms for Finding Hamilton Cycles in Random Graphs.
111-117 BibTeX
- F. Miller Maley:
An Observation Concerning Constraint-Based Compaction.
119-122 BibTeX
- Victor J. Rayward-Smith:
The Complexity of Preemptive Scheduling Given Interprocessor Communication Delays.
123-125 BibTeX
- Ravi B. Boppana, Johan Håstad, Stathis Zachos:
Does co-NP Have Short Interactive Proofs?
127-132 BibTeX
- Robert D. Tennent:
Quantification in Algol-Like Languages.
133-137 BibTeX
- Grigori Mints, Enn Tyugu:
Corrigendum: Semantics of a Declarative Language.
139 BibTeX
Volume 25,
Number 3,
May 1987
Volume 25,
Number 4,
June 1987
- Jean-Michel Autebert, Philippe Flajolet, Joaquim Gabarró:
Prefixes of Infinite Words and Ambiguous Context-Free Languages.
211-216 BibTeX
- Bettina Brustmann, Ingo Wegener:
The Complexity of Symmetric Functions in Bounded-Depth Circuits.
217-219 BibTeX
- Edward Ochmanski:
Inevitability in Concurrent Systems.
221-225 BibTeX
- Rainer Kemp:
A Note on the Number of Leftist Trees.
227-232 BibTeX
- J. G. Wiltink:
A Deficiency of Natural Deduction.
233-234 BibTeX
- Alberto Apostolico:
Remark on the Hsu-Du New Algorithm for the Longest Common Subsequence Problem.
235-236 BibTeX
- David Gries, Adriano Pascoletti, Luigi Sbriz:
Horner's Rule and the Computation of Linear Recurrences.
237-240 BibTeX
- Andrew V. Goldberg, Serge A. Plotkin:
Parallel ((Greek D)D+1)-Coloring of Constant-Degree Graphs.
241-245 BibTeX
- Christos Levcopoulos:
An \Omega(\sqrt(n)) Lower Bound for the Nonoptimality of the Greedy Triangulation.
247-251 BibTeX
- Matthias Reichling:
A Simplified Solution of the n Queens Problem.
253-255 BibTeX
- Anatoli Buda:
Multiprocessor Automata.
257-261 BibTeX
- Sandeep N. Bhatt, Stavros S. Cosmadakis:
The Complexity of Minimizing Wire Lengths in VLSI Layouts.
263-267 BibTeX
- Otfried Fries, Kurt Mehlhorn, Stefan Näher, Athanasios K. Tsakalidis:
A log log n Data Structure for Three-Sided Range Queries.
269-273 BibTeX
- Andrew W. Appel:
Garbage Collection can be Faster than Stack Allocation.
275-279 BibTeX
Volume 25,
Number 5,
July 1987
- Vijay V. Raghavan, Shankar M. Venkatesan:
On Bounds for a Board Covering Problem.
281-284 BibTeX
- Jeffrey S. Salowe, William L. Steiger:
Stable Unmerging in Linear Time and Constant Space.
285-294 BibTeX
- K. Venkatesh, Thiruvengadam Radhakrishnan, H. F. Li:
Optimal Checkpointing and Local Recording for Domino-Free Rollback Recovery.
295-304 BibTeX
- Jerzy R. Nawrocki, J. Martinek:
A Storage Allocation Method with Invalidating Dangling References.
305-310 BibTeX
- Cristian Calude:
Super-Exponentials Nonprimitive Recursive, but Rudimentary.
311-316 BibTeX
- S. S. Ravi, Harry B. Hunt III:
An Application of the Planar Separator Theorem to Counting Problems.
317-322 BibTeX
- David Gries:
A Note on Graham's Convex Hull Algorithm.
323-328 BibTeX
- Yun-zhou Zhu, To-Yat Cheung:
A New Distributed Breadth-First-Search Algorithm.
329-334 BibTeX
- Rina Suros, E. Montagne:
Fitted Diagonals for Reducing I/O Bandwidth in Systolic Systems.
335-342 BibTeX
- Stuart A. Friedberg, Gary L. Peterson:
An Efficient Solution to the Mutual Exclusion Problem Using Weak Semaphores.
343-348 BibTeX
Volume 25,
Number 6,
July 1987
Copyright © Sun May 17 00:03:59 2009
by Michael Ley (ley@uni-trier.de)
