Volume 2,
Number 1,
Spring 1995
- Esko Ukkonen:
Editor's Foreword.
1-2
- Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid:
Simple Randomized Algorithms for Closest Pair Problems.
3-27
- V. Kamakoti, Kamala Krithivasan, C. Pandu Rangan:
An Efficient Randomized Algorithm for the Closest Pair Problem on Colored Point Sets.
28-40
- Jan Kratochvíl, Paul D. Manuel, Mirka Miller:
Generalized Domination in Chordal Graphs.
41-50
- Ville Leppänen, Martti Penttonen:
Work-Optimal Simulation of PRAM Models on Meshes.
51-69
- Michael Vassilakopoulos, Yannis Manolopoulos, Brigitte Kröll:
Efficiency Analysis of Overlapped Quadtrees.
70-84
Volume 2,
Number 2,
Summer 1995
Selected papers of the 5th International Conference on Concurrency Theory,
CONCUR '94,
August 22-25,
1994
- Bengt Jonsson, Joachim Parrow:
Guest Editors Foreword.
87
- Olaf Burkart, Bernhard Steffen:
Composition, Decomposition and Model Checking of Pushdown Processes.
89-125
- Pietro Di Gianantonio, Furio Honsell, Gordon D. Plotkin:
Uncountable Limits and the lambda Calculus.
126-145
- Paris C. Kanellakis, Dimitrios Michailidis, Alexander A. Shvartsman:
Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms.
146-180
- N. P. Mendler, Prakash Panangaden, Philip J. Scott, R. A. G. Seely:
A Logical View of Concurrent Constraint Programming.
181-220
- Mogens Nielsen, Christian Clausen:
Games and Logics for a Noninterleaving Bisimulation.
221-249
- Roberto Segala, Nancy A. Lynch:
Probabilistic Simulations for Probabilistic Processes.
250-273
- Chris Verhoef:
A Congruence Theorem for Structured Operational Semantics with Predicates and Negative Premises.
274-302
Volume 2,
Number 3,
Fall 1995
Volume 2,
Number 4,
Winter 1995
Note
Copyright © Mon Nov 2 21:49:20 2009
by Michael Ley (ley@uni-trier.de)
