scientific article; zbMATH DE number 753967
From MaRDI portal
Publication:4698688
Recommendations
- A new algorithm for the construction of optimal B-trees
- scientific article; zbMATH DE number 975346
- Algorithms and Computation
- On the construction of weighted time-optimal B-trees
- Cost-optimal parallel algorithms for constructing B-trees
- Efficient Construction of Near-Optimal Binary and Multiway Search Trees
- On batch-constructing B\(^{+}\)-trees: Algorithm and its performance evaluation
- A subquadratic algorithm for constructing approximately optimal binary search trees
- Dynamic indexability and the optimality of B-trees
- Optimal binary search trees
Cited in
(13)- Space saving generalization of \(B\)-trees with \(2/3\) utilization
- On batch-constructing B\(^{+}\)-trees: Algorithm and its performance evaluation
- scientific article; zbMATH DE number 4185014 (Why is no real title available?)
- On the construction of weighted time-optimal B-trees
- Cost-optimal parallel algorithms for constructing B-trees
- A new algorithm for the construction of optimal B-trees
- Optimal pagination of B-trees with variable-length items
- scientific article; zbMATH DE number 3843183 (Why is no real title available?)
- New dynamic construction techniques for M-tree
- On generating B-trees with constant average delay and in lexicographic order
- The Traveler's Problem
- An Improved Algorithm for the Traveler′s Problem
- Efficient Construction of Near-Optimal Binary and Multiway Search Trees
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 Q4698688)
