Self-Adjusting k-ary Search Trees

DOI10.1006/jagm.1995.1026zbMath0836.68019OpenAlexW1975556001MaRDI QIDQ4840218

Murray Sherk

Publication date: 24 July 1995

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1995.1026

zbMATH Keywords

binary splay tree

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees ⋮ Self‐adjusting trees in practice for large text collections ⋮ Chain-splay trees, or, how to achieve and prove \(\log \log N\)-competitiveness by splaying ⋮ Belga B-trees

This page was built for publication: Self-Adjusting k-ary Search Trees