Volume 34,
Number 1,
22 February 1990
- Masahito Kurihara, Ikuo Kaji:
Modular Term Rewriting Systems and the Termination.
1-4
- Mohan Ahuja:
Flush Primitives for Asynchronous Distributed Systems.
5-12
- Shai Simonson:
Routing with Critical Paths.
13-19
- Arne Andersson, Svante Carlsson:
Construction of a Tree From its Traversals in Optimal Time and Space.
21-25
- Jeremy Jacob:
Separability and the Detection of Hidden Channels.
27-29
- Alejandro D. Martínez, Rosita Wachenchauzer, Rafael Dueire Lins:
Cycle Reference Counting with Local Mark-Scan.
31-35
- O. J. Murphy, Stanley M. Selkow:
Finding Nearest Neighbors with Voronoi Tessellations.
37-41
- Carla Neaderhouser Purdy, George B. Purdy:
The Area-Time Complexity of the Greatest Common Divisor Problem: A Lower Bound.
43-46
- Joseph Y.-T. Leung, Gilbert H. Young:
Preemptive Scheduling to Minimize Mean Weighted Flow Time.
47-50
- Ronald Morrison, Malcolm P. Atkinson, Alfred L. Brown, Alan Dearle:
On the Classification of Binding Mechanisms.
51-55
- Nissim Francez:
Corrigenda: Cooperating Proofs for Distributed Programs with Multiparty Interactions.
57 ->IPL 32(5): 235-242 (22 September 1989)
Volume 34,
Number 2,
16 March 1990
Volume 34,
Number 3,
9 April 1990
- C. A. R. Hoare:
Fixed Points of Increasing Functions.
111-112
- Jean Marcel Pallo:
A Distance Metric on Binary Trees Using Lattice-Theoretic Measures.
113-116
- Alberto Bertoni, Massimiliano Goldwurm, Paolo Massazza:
Counting Problems and Algebraic Formal Power Series in Noncommuting Variables.
117-121
- Lein Harn, Thomas Kiesler:
An Efficient Probabilistic Encryption Scheme.
123-129
- Moon Hwa Park, Myunghwan Kim:
A Distributed Synchronization Scheme for Fair Multi-Process Handshakes.
131-138
- Henk Goeman:
Towards a Theory of (Self) Applicative Communicating Processes: A Short Note.
139-142
- Christoph Meinel:
Logic VS. Complexity Theoretic Properties of the Graph Accessibility Problem for Directed Graphs of Bounded Degree.
143-146
- Shang-Hua Teng:
Space Efficient Processor Identity Protocol.
147-154
- John C. Tipper:
A Straightforward Iterative Algorithm for the Planar Voronoi Diagram.
155-160
- Jürgen Plehn:
Preemptive Scheduling of Independent Jobs with Releas Times and Deadlines on a Hypercube.
161-166
Volume 34,
Number 4,
24 April 1990
Volume 34,
Number 5,
7 May 1990
- Paul E. S. Dunne:
Comment on Kochol's Paper ``Efficient Monotone Circuits for Threshold Functions''.
221-222
- Stefan Rönn, Heikki Saikkonen:
Distributed Termination Detection with Counters.
223-227
- Zsolt Tuza:
Periodic String Division Generated by Deterministic L Systems.
229-234
- Sung Kwon Kim:
A Parallel Algorithm for Finding a Maximum Clique of a Set of Circular Arcs of a Circle.
235-241
- Owen Murphy:
A Unifying Framework for Trie Design Heuristics.
243-249
- William Pugh:
Slow Optimally Balanced Search Strategies VS. Cached Fast Uniformly Balanced Search Strategies.
251-254
- Andreas S. Pombortsis:
Sharing Special Purpose Resources in a Multiprocessor Environment.
255-260
- R. T. Kuo, S. S. Tseng:
The Necessary and Sufficient Condition for the Worst-Case Male Optimal Stable Matching.
261-263
- J. M. Robson:
Random Access Machines with Multi-Dimensional Memories.
265-266
- Mark Allen Weiss, Robert Sedgewick:
More on Shellsort Increment Sequences.
267-270
- Gaston H. Gonnet, Ricardo A. Baeza-Yates:
An Analysis of the Karp-Rabin String Matching Algorithm.
271-274
- Ingo Althöfer:
Tight Lower Bounds on the Length of Word Chains.
275-276
Volume 34,
Number 6,
28 May 1990
Copyright © Wed Nov 11 23:34:32 2009
by Michael Ley (ley@uni-trier.de)
