Randomized jumplists: A jump-and-walk dictionary data structure

DOI10.1007/3-540-36494-3_26MaRDI QIDQ4418657zbMATH OpenFDO

Authors Hervé Brönnimann, Frédéric Cazals, Marianne Durand

Publication date 11 August 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2607/26070283.htm

zbMATH Keywords

Asymptotic analysisDictionary data structuresRandomizationSearching and sorting

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Randomized algorithms (68W20)

Recommendations

• scientific article; zbMATH DE number 2226804
• Median-of-k jumplists and dangling-min BSTs
• Some observations on skip-lists
• Data structures with dynamical random transitions
• Skip lift: a probabilistic alternative to red-black trees

Cited in

(7)

• Dynamic hotlinks
• Skip lift: a probabilistic alternative to red-black trees
• Skip lift: a probabilistic alternative to red-black trees
• Median-of-k jumplists and dangling-min BSTs
• scientific article; zbMATH DE number 2226804 (Why is no real title available?)
• Near-entropy hotlink assignments
• The longest almost-increasing subsequence

This page was built for publication: Randomized jumplists: A jump-and-walk dictionary data structure

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