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

DOI10.1016/0020-0190(90)90130-PzbMATH Open0696.68069OpenAlexW2086377116MaRDI QIDQ911291FDOQ911291

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

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

zbMATH Keywords

analysis of algorithmsdata structures

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Self-adjusting binary search trees
• Title not available (Why is that?)

Cited In (1)

• Title not available (Why is that?)

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)