A simple balanced search tree with $O(1)$ worst-case update time

Fleischer, Rudolf

Local TagsRelease HistoryDetailsSummary

A simple balanced search tree with $O(1)$ worst-case update time

Fleischer, R. (1996). A simple balanced search tree with $O(1)$ worst-case update time. International Journal of Foundations of Computer Science, 7(2), 137-149.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AB55-D Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AB56-B

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Fleischer, Rudolf¹, Author

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

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2010-03-02Date issued: 1996

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 517677
Other: Local-ID: C1256428004B93B8-04B34A7B23BB058AC12564290042A6A4-Fleischer96

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: International Journal of Foundations of Computer Science

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 7 (2) Sequence Number: - Start / End Page: 137 - 149 Identifier: ISSN: 0129-0541