Binary search trees of almost optimal height

Authors:
Arne Anderson;Christian Icking;Rolf Klein;Thomas Ottmann
Affiliations:
Lund Univ., Lund, Sweden;Univ.-Gesamthochschule Essen, Essen, Germany;Univ.-Gesamthochschule Essen, Essen, Germany;Univ. Freiburg, Freiburg, Germany
Venue:
Acta Informatica
Year:
1990

Citing 0
Cited 3

Confluently persistent deques via data structuaral bootstrapping

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
The Complexity of Rebalancing a Binary Serach Tree

Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Combinatorial auctions, an example of algorithm theory in real life

Computer Science in Perspective

Quantified Score

Hi-index	0.00

Visualization

Abstract