Balanced Trees as a Datastructure for Representing Sorted Lists

Mehlhorn, Kurt

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Balanced Trees as a Datastructure for Representing Sorted Lists

MPS-Authors

/persons/resource/persons45021

Mehlhorn, Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Mehlhorn, K. (1982). Balanced Trees as a Datastructure for Representing Sorted Lists. In P. M. B. Vitányi, J. van Leeuwen, & P. van Emde Boas (Eds.), Colloquium Complexiteit en Algoritmen (pp. 69-91). Amsterdam: Mathematisch Centrum.

Cite as: https://hdl.handle.net/21.11116/0000-000E-73A7-4

Abstract

There is no abstract available