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

DOI10.1007/978-3-031-38906-1_31MaRDI QIDQ6179434zbMATH OpenOpenAlexFDO

Authors Ofek Gila, Michael T. Goodrich, Robert E. Tarjan

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

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

Recommendations

• Zip Trees
• Zip trees
• Two New Kinds of Biased Search Trees
• Biased Search Trees
• Randomized search trees

Cites work

• A guided tour of Chernoff bounds
• A note on the height of binary search trees
• Algorithm design and applications
• Average search and update costs in skip lists
• Biased Search Trees
• Biased skip lists
• Branching processes in the analysis of the heights of trees
• Characterizing history independent data structures
• scientific article; zbMATH DE number 4211552 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• Imperative self-adjusting computation
• Making data structures persistent
• Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
• Randomized binary search trees
• Randomized search trees
• Sharp bounds for harmonic numbers
• The average height of binary trees and other simple trees
• The CB tree: a practical concurrent self-adjusting search tree
• The height of a random binary search tree
• The probabilistic method
• Verified analysis of random binary tree structures
• Zip Trees

Cited in

(2)

• Zip trees
• Zip Trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6179434)