scientific article; zbMATH DE number 1143799

zbMATH Open0893.68114MaRDI QIDQ4385986

José Luis Palacios

Publication date: 3 August 1998

Title of this publication is not available (Why is that?)

zbMATH Keywords

Could not fetch data.

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Improving time and space efficiency in generalized binary search trees 👍 👎
• An analysis of fixed-point queries on binary trees 👍 👎
• A uniform model for the storage utilization of B-tree-like structures 👍 👎
• A uniform model for the storage utilization of \(B\)-tree-like structure 👍 👎
• Variance of storage requirements for B+-trees 👍 👎
• The \(m\)-version of binary search trees: an average case analysis 👍 👎
• Dynamic Indexability and the Optimality of B-Trees 👍 👎
• STORAGE OVERHEAD OF O-TREES, B-TREES AND PREFIX B-TREES: A COMPARATIVE ANALYSIS 👍 👎

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 Q4385986)