BIT

Keyphrases

Publications

volume 33, number 1, 1993

volume 33, number 2, 1993

volume 33, number 3, 1993

volume 33, number 4, 1993

volume 32, number 1, 1992

volume 32, number 2, 1992

Ricardo A. Baeza-Yates, Gaston H. Gonnet, Nivio Ziviani
Improved Bounds for the Expected Behaviour of AVL Trees. BIT 32 (2) (1992)
John Hershberger, Subhash Suri
Applications of a Semi-Dynamic Convex Hull Algorithm. BIT 32 (2) (1992)
David Eppstein
Smallest Spanning Trees. BIT 32 (2) (1992)
Thomas Papadakis, J. Ian Munro, Patricio V. Poblete
Average Search and Update Costs in Skip Lists. BIT 32 (2) (1992)
Marc J. van Kreveld, Mark H. Overmars, Pankaj K. Agarwal
Intersection Queries in Sets of Disks. BIT 32 (2) (1992)
Stefan Arnborg, Andrzej Proskurowski
Canonical Representations of Partial 2- and 3-Trees. BIT 32 (2) (1992)
Christos Levcopoulos, Andrzej Lingas
Fast Algorithms for Greedy Triangulation. BIT 32 (2) (1992)
Ravi B. Boppana, Magnús M. Halldórsson
Approximating Maximum Independent Sets by Excluding Subgraphs. BIT 32 (2) (1992)
Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis
Efficient Parallel Algorithms for Shortest Paths in Planar Digraphs. BIT 32 (2) (1992)

volume 32, number 3, 1992

volume 32, number 4, 1992