Biased skip lists

DOI10.1007/s00453-004-1138-6zbMath1065.68039OpenAlexW2121029207MaRDI QIDQ1777273

Michael T. Goodrich, Adam L. Buchsbaum, Amitabha Bagchi

Publication date: 13 May 2005

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-004-1138-6

zbMATH Keywords

biased access sequences

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (9)

Dynamic Tree Shortcut with Constant Degree ⋮ The splay-list: a distribution-adaptive concurrent skip-list ⋮ Zip-zip trees: making zip trees more balanced, biased, compact, or persistent ⋮ Skip lift: a probabilistic alternative to red-black trees ⋮ Skip Lift: A Probabilistic Alternative to Red-Black Trees ⋮ The CB tree: a practical concurrent self-adjusting search tree ⋮ Fully dynamic geometric spanners ⋮ A History of Distribution-Sensitive Data Structures ⋮ Random Access to Grammar-Compressed Strings and Trees

This page was built for publication: Biased skip lists