Volume 38,
Number 1,
12 April 1991
Volume 38,
Number 2,
26 April 1991
Volume 38,
Number 3,
17 May 1991
- Ming-Yang Kao, Stephen R. Tate:
Online Matching with Blocked Input.
113-116 BibTeX
- David Fernández-Baca, Mark A. Williams:
On Matroids and Hierarchical Graphs.
117-121 BibTeX
- Günter Rote:
Computing the Minimum Hausdorff Distance Between Two Point Sets on a Line Under Translation.
123-127 BibTeX
- Lars Langemyr:
Circuits for Computing the GCD of Two Polynomials Over an Algebraic Number Field.
129-134 BibTeX
- Charles U. Martel:
Self-Adjusting Multi-Way Search Trees.
135-141 BibTeX
- Subbiah Rajanarayanan, S. Sitharama Iyengar:
A New Optimal Distributed Algorithm for the Set Intersection Problem.
143-148 BibTeX
- Günter Rote, Gerhard J. Woeginger, Binhai Zhu, Zhengyan Wang:
Counting k-Subsets and Convex k-gons in the Plane.
149-151 BibTeX
- Michal Mnuk:
A div(n) Depth Bollean Circuit for Smooth Modular Inverse.
153-156 BibTeX
- P. Pramanik, P. K. Das, A. K. Bandyopadhyay, D. Q. M. Fay:
A Deadlock-Free Communication Kernel for Loop Architecture.
157-161 BibTeX
- Dragan M. Acketa, Jovisa D. Zunic:
On the Number of Linear Partitions of the (m, n)-Grid.
163-168 BibTeX
Volume 38,
Number 4,
31 May 1991
Volume 38,
Number 5,
14 June 1991
Volume 38,
Number 6,
28 June 1991
Copyright © Sun May 17 00:04:01 2009
by Michael Ley (ley@uni-trier.de)
