Skip lift: a probabilistic alternative to red-black trees
From MaRDI portal
Publication:450539
DOI10.1016/j.jda.2011.12.017zbMath1252.68083MaRDI QIDQ450539
Pat Morin, Karim Douïeb, Prosenjit Bose
Publication date: 13 September 2012
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2011.12.017
68P05: Data structures
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A balanced search tree O(1) worst-case update time
- Biased skip lists
- Updating a balanced search tree in 0(1) rotations
- Randomized search trees
- Organization and maintenance of large ordered indexes
- Rank-Balanced Trees
- Biased Search Trees
- Two New Kinds of Biased Search Trees
- Randomized binary search trees
- A SIMPLE BALANCED SEARCH TREE WITH O(1) WORST-CASE UPDATE TIME
- Power balance and apportionment algorithms for the United States Congress
- Optimal finger search trees in the pointer machine