Analysis of an optimized search algorithm for skip lists

DOI10.1016/0304-3975(94)00296-UzbMATH Open0874.68082DBLPjournals/tcs/KirschenhoferMP95WikidataQ61734822 ScholiaQ61734822MaRDI QIDQ672990FDOQ672990

Authors: Peter Kirschenhofer, Conrado Martínez, Helmut Prodinger 

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Recommendations

• Analysis of the expected search cost in skip lists
• Average search and update costs in skip lists
• Skip lists - some results on a recent data structure
• Analysis of a new skip list variant

zbMATH Keywords

skip list search algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites Work

• Title not available (Why is that?)
• Mellin transforms and asymptotics: Finite differences and Rice's integrals
• A design of a parallel dictionary using skip lists
• Combinatorics of geometrically distributed random variables: Left-to-right maxima
• Average search and update costs in skip lists
• A limit theory for random skip lists
• On a tree collision resolution algorithm in presence of capture

Cited In (3)

• Analysis of the expected search cost in skip lists
• A design of a parallel dictionary using skip lists
• Analysis of a new skip list variant

This page was built for publication: Analysis of an optimized search algorithm for skip lists

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