Analysis of the expected search cost in skip lists

DOI10.1007/3-540-52846-6_86MaRDI QIDQ5056100zbMATH OpenOpenAlexFDO

Authors Thomas Papadakis, J. Ian Munro, Patricio V. Poblete

Publication date 9 December 2022

Published in SWAT 90 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-52846-6_86

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10)

Recommendations

• Average search and update costs in skip lists
• A limit theory for random skip lists
• Analysis of an optimized search algorithm for skip lists
• Skip lists - some results on a recent data structure
• Some observations on skip-lists

Cites work

• Analysis of the standard deletion algorithms in exact fit domain binary search trees
• scientific article; zbMATH DE number 140487 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)

Cited in

(6)

• Average search and update costs in skip lists
• A design of a parallel dictionary using skip lists
• Skip lists - some results on a recent data structure
• Analysis of a new skip list variant
• scientific article; zbMATH DE number 140487 (Why is no real title available?)
• Analysis of an optimized search algorithm for skip lists

This page was built for publication: Analysis of the expected search cost in skip lists

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