A new data structure for representing sorted lists

Acta Informatica

Volumn 17, Issue 2, 1982, Pages 157-184

  Huddleston, Scott ^a   Mehlhorn, Kurt ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA PROCESSING;

EID: 0020141751     PISSN: 00015903     EISSN: 14320525     Source Type: Journal    
DOI: 10.1007/BF00288968     Document Type: Article

References (14)

1. Symmetric Binary B-trees: Data structures and maintenance algorithms
2. Organization and maintenance of large ordered indizes
3. Concurrency of operations on B-trees
4. On the average number of rebalancing steps in weight-balanced trees
5. Design and analysis of a data structure for representing sorted lists
6. A dichromatic framework for balanced trees
7. Robust balancing in B-trees
8. Robust balancing in B-trees
9. Sorting presorted files
10. Searching, sorting and information theory. MFCS 79