Balanced Trees as a Datastructure for Representing Sorted Lists

Mehlhorn, Kurt

Local TagsRelease HistoryDetailsSummary

Balanced Trees as a Datastructure for Representing Sorted Lists

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.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/21.11116/0000-000E-73A7-4 Version Permalink: https://hdl.handle.net/21.11116/0000-000E-73A8-3

Genre: Conference Paper

Files

show Files

Locators

show

Creators

show

hide

Creators:
Mehlhorn, Kurt¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Date issued: 1982

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: BibTex Citekey: Mehlhorn1982MC

Degree: -

Event

show

hide

Title: Colloquium Complexiteit en Algoritmen

Place of Event: Amsterdam, The Netherlands

Start-/End Date: 1982 - 1982

Legal Case

show

Project information

show

Source 1

show

hide

Title: Colloquium Complexiteit en Algoritmen

Source Genre: Proceedings

Creator(s):
Vitányi, P. M. B.¹, Editor
van Leeuwen, J.¹, Editor
van Emde Boas, P.¹, Editor

Affiliations:
1 External Organizations, ou_persistent22

Publ. Info: Amsterdam : Mathematisch Centrum

Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 69 - 91 Identifier: -

Source 2

show

hide

Title: Mathematisch Centrum, Amsterdam: MC syllabus

Source Genre: Series

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 48 Sequence Number: - Start / End Page: - Identifier: -