On the Matter of Dynamic Optimality in an Extended Model for Tree Access Operations

DOI10.1007/978-3-642-22300-6_36zbMATH Open1342.68110OpenAlexW48560606MaRDI QIDQ5199262FDOQ5199262

Authors: Michael L. Fredman 

Publication date: 12 August 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-22300-6_36

Recommendations

• Dynamic Trees with Almost-Optimal Access Cost
• scientific article; zbMATH DE number 5237331
• Dynamic indexability and the optimality of B-trees
• Static optimality and dynamic search-optimality in lists and trees
• scientific article; zbMATH DE number 2119638
• scientific article; zbMATH DE number 2011834
• Optimal worst-case operations for implicit cache-oblivious search trees.
• Optimal binary search trees with costs depending on the access paths.
• Optimization of distributed tree queries

Mathematics Subject Classification ID

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

This page was built for publication: On the Matter of Dynamic Optimality in an Extended Model for Tree Access Operations

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