BIT, Volume 33, 1993
This index includes only papers from the Computer Science section of BIT.
Volume 33, Number 1, 1993
Volume 33, Number 2, 1993
- Celina Imielinska, Bahman Kalantari:
A Generalized Hypergreedy Algorithm for Weighted Perfect Matching.
178-189

- Lars Lundberg:
Performance Bounds on Multiprocessor Scheduling Strategies for Statically Allocated Programs.
190-213

- Roland Olsson:
Execution of Logic Programs by Iterative Deepening A* SLD-Tree Search.
214-231

- Ondrej Sýkora, Imrich Vrto:
On Crossing Numbers of Hypercubes and Cube Connected Cycles.
232-237

- Cao An Wang:
Efficiently Updating Constrained Delaunay Triangulations.
238-252

Volume 33, Number 3, 1993
Volume 33, Number 4, 1993
Last update Sat May 25 15:32:34 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page