Volume 68, Number 1-3, 1986
- Axel Poigné:
On Specifications, Theories, and Models with Higher Types.
1-46
- Nancy A. Lynch, Nancy D. Griffeth, Michael J. Fischer, Leonidas J. Guibas:
Probabilistic Analysis of a Network Resource Allocation Algorithm.
47-85
- Neil Immerman:
Relational Queries Computable in Polynomial Time.
86-104
- Bernard Chazelle, R. Cole, Franco P. Preparata, Chee-Keng Yap:
New Upper Bounds for Neighbor Searching.
105-124
- Mike Townsend:
A Polynomial Jump Operator.
146-169
- Kurt Hoffman, Kurt Mehlhorn, Pierre Rosenstiehl, Robert Endre Tarjan:
Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees.
170-184
- Ulrike Brandt:
The Position of Index Sets of Identifiable Sets in the Arithmetical Hierarchy.
185-195
- Dung T. Huynh:
A Superexponential Lower Bound for Gröbner Bases and Church-Rosser Commutative Thue Systems.
196-206
- Peter A. Flanagan:
An Optimally Data Efficient Isomorphism Inference Algorithm.
207-222
- Krzysztof R. Apt, Carole Delporte-Gallet:
Syntax Directed Analysis of Liveness Properties.
223-253
Copyright © Thu Nov 12 01:48:25 2009
by Michael Ley (ley@uni-trier.de)
