scientific article; zbMATH DE number 753967
From MaRDI portal
Publication:4698688
zbMATH Open0817.68066MaRDI QIDQ4698688FDOQ4698688
Author name not available (Why is that?)
Publication date: 11 May 1995
Title of this publication is not available (Why is that?)
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
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Data structures (68P05) Abstract computational complexity for mathematical programming problems (90C60)
Cited In (13)
- On batch-constructing B\(^{+}\)-trees: Algorithm and its performance evaluation
- Title not available (Why is that?)
- On the construction of weighted time-optimal B-trees
- A new algorithm for the construction of optimal B-trees
- Cost-optimal parallel algorithms for constructing B-trees
- Optimal pagination of B-trees with variable-length items
- Title not available (Why is that?)
- New dynamic construction techniques for M-tree
- On generating B-trees with constant average delay and in lexicographic order
- An Improved Algorithm for the Traveler′s Problem
- The Traveler's Problem
- Efficient Construction of Near-Optimal Binary and Multiway Search Trees
- Space saving generalization of \(B\)-trees with \(2/3\) utilization
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)
