Zip-zip trees: making zip trees more balanced, biased, compact, or persistent

DOI10.1007/978-3-031-38906-1_31arXiv2307.07660OpenAlexW4385317348MaRDI QIDQ6179434

Robert Endre Tarjan, Ofek Gila, Michael T. Goodrich

Publication date: 16 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2307.07660

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sharp bounds for harmonic numbers
• A guided tour of Chernoff bounds
• Branching processes in the analysis of the heights of trees
• Making data structures persistent
• The average height of binary trees and other simple trees
• Average search and update costs in skip lists
• Biased skip lists
• Characterizing history independent data structures
• Randomized search trees
• The CB tree: a practical concurrent self-adjusting search tree
• Imperative self-adjusting computation
• The height of a random binary search tree
• Biased Search Trees
• Randomized binary search trees
• A note on the height of binary search trees
• Zip Trees
• Verified analysis of random binary tree structures

This page was built for publication: Zip-zip trees: making zip trees more balanced, biased, compact, or persistent