scientific article; zbMATH DE number 1962821

MaRDI QIDQ4418657zbMATH OpenFDO

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

Publication date 11 August 2003

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

zbMATH Keywords

Asymptotic analysisRandomizationDictionary data structuresSearching and sorting

Mathematics Subject Classification ID

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

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

This page was built for publication:

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