Analysis of an optimized search algorithm for skip lists

DOI10.1016/0304-3975(94)00296-UzbMath0874.68082DBLPjournals/tcs/KirschenhoferMP95WikidataQ61734822 ScholiaQ61734822MaRDI QIDQ672990

Conrado Martínez, Peter Kirschenhofer, Prodinger, Helmut

Publication date: 28 February 1997

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

zbMATH Keywords

skip list search algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (1)

A design of a parallel dictionary using skip lists

Cites Work

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

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