On the existence and construction of non-extreme \((a,b)\)-trees.

DOI10.1016/S0020-0190(02)00228-4zbMath1042.68037MaRDI QIDQ1853114

Kim S. Larsen, Lars Jacobsen, Morten Nyhave Nielsen

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Data structuresAnalysis of algorithmsSearch treesAmortized analysis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Data structures (68P05)

Related Items (2)

Relaxed multi-way trees with group updates. ⋮ Exponentially decreasing number of operations in balanced trees

Cites Work

• Unnamed Item
• Unnamed Item
• A new data structure for representing sorted lists
• Organization and maintenance of large ordered indexes
• The buffer tree: A new technique for optimal I/O-algorithms
• VARIANTS OF (A,B)-TREES WITH RELAXED BALANCE

This page was built for publication: On the existence and construction of non-extreme \((a,b)\)-trees.