Slow optimally balanced search strategies vs. cached fast uniformly balanced search strategies

DOI10.1016/0020-0190(90)90130-PMaRDI QIDQ911291zbMATH OpenOpenAlexFDO

Authors William Pugh

Publication date 1990

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(90)90130-p

zbMATH Keywords

analysis of algorithmsdata structures

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 2119642
• Skewed Binary Search Trees
• Should static search trees ever be unbalanced?
• scientific article; zbMATH DE number 2079386
• Cache-Oblivious B-Trees

Cites work

• scientific article; zbMATH DE number 140487 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• Self-adjusting binary search trees

Cited in

(1)

• scientific article; zbMATH DE number 7271257 (Why is no real title available?)

This page was built for publication: Slow optimally balanced search strategies vs. cached fast uniformly balanced search strategies

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