BIT,
Volume 31,
1991
This index includes only papers from the Computer Science section of BIT.
Volume 31,
Number 1,
1991
Volume 31,
Number 2,
1991
Volume 31,
Number 3,
1991
Volume 31,
Number 4,
1991
- Frank Bartling, Klaus Hinrichs:
Probabilistic Analysis of an Algorithm for Solving the k-Dimensional All-Nearest-Neighbors Problem by Projection.
558-565
- C. Y. Chen, H. F. Lin:
Optimality Criteria of the Disk Modulo Allocation Method for Cartesian Product Files.
566-575
- Jaana Eloranta:
Minimizing the Number of Transitions with Respect to Observation Equivalence.
576-590
- Andrzej Lingas:
An Unfeasible Matching Problem.
591-597
- Kim-Heng Teo, Tai-Ching Tuan:
A Tight Upper Bound for the Number of Intersections Between two Rectangular Paths.
598-606
Copyright © Mon Nov 2 21:26:07 2009
by Michael Ley (ley@uni-trier.de)