A systematic analysis of splaying

DOI10.1016/0020-0190(93)90249-9zbMath0764.68082OpenAlexW2131450750MaRDI QIDQ1209317

Berry Schoenmakers

Publication date: 16 May 1993

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

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90249-9

zbMATH Keywords

functional programmingamortized complexitybinary search treespotential functiondictionariessplay trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) General topics in the theory of software (68N01)

Related Items

ATLAS: automated amortised complexity analysis of self-adjusting data structures ⋮ Amortized Complexity Verified ⋮ Amortized complexity verified ⋮ Type-based analysis of logarithmic amortised complexity

Cites Work

• Unnamed Item
• The derivation of a tighter bound for top-down skew heaps
• The pairing heap: A new form of self-adjusting heap
• A tight amortized bound for path reversal
• Amortized Computational Complexity
• Self-adjusting binary search trees

This page was built for publication: A systematic analysis of splaying