Volume 37,
Number 1,
10 January 1991
Volume 37,
Number 2,
31 January 1991
Volume 37,
Number 3,
18 February 1991
Volume 37,
Number 4,
28 February 1991
- Zhaofang Wen:
Parallel Multiple Search.
181-186 BibTeX
- David Pokrass Jacobs:
Probabilistic Checking of Associativity in Algebras.
187-191 BibTeX
- Xiaotie Deng, Sanjeev Mahajan:
Server Problems and Resistive Spaces.
193-196 BibTeX
- Robert W. Irving:
On Approximating the Minimum Independent Dominating Set.
197-200 BibTeX
- Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki:
The Intersection Searching Problem for c-Oriented Polygons.
201-204 BibTeX
- Cornelis Huizing, Willem P. de Roever:
Introduction to Design Choices in the Semantics of Statecharts.
205-213 BibTeX
- Uri Zwick:
An Extension of Khrapchenko's Theorem.
215-217 BibTeX
- Y. Daniel Liang, Chong Jye Rhee, Sudarshan K. Dhall, S. Lakshmivarahan:
A New Approach for the Domination Problem on Permutation Graphs.
219-224 BibTeX
- Peter F. Corbett, Isaac D. Scherson:
A Unified Algorithm for Sorting on Multidimensional Mesh-Connected Processors.
225-231 BibTeX
- Maria J. Serna:
Approximating Linear Programming is Log-Space Complete for P.
233-236 BibTeX
- Helmut Alt, Norbert Blum, Kurt Mehlhorn, Markus Paul:
Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n).
237-240 BibTeX
Volume 37,
Number 5,
14 March 1991
Volume 37,
Number 6,
28 March 1991
Copyright © Tue Nov 18 20:40:09 2008
by Michael Ley (ley@uni-trier.de)
