Pages that link to "Item:Q911247"
From MaRDI portal
The following pages link to Binary search trees of almost optimal height (Q911247):
Displaying 20 items.
- Optimal alphabetic trees for binary search (Q293336) (← links)
- On \(k\)-dimensional balanced binary trees. (Q960472) (← links)
- Almost optimal dynamic 2-3 trees (Q1084868) (← links)
- Improving time and space efficiency in generalized binary search trees (Q1087332) (← links)
- Jump interpolation search trees and symmetric binary numbers (Q1097702) (← links)
- Self-adjusting multi-way search trees (Q1178210) (← links)
- Optimal binary trees with order constraints (Q1283811) (← links)
- The optimal binary search tree for Andersson's search algorithm (Q1323348) (← links)
- Binary search tree recursions with harmonic toll functions (Q1612306) (← links)
- Fully dynamic distributed search trees can be balanced in \(O(\lg^{2} N)\) time. (Q1872689) (← links)
- The Analysis of an Improved Symmetric Binary B-tree Algorithm (Q3685213) (← links)
- A subquadratic algorithm for constructing approximately optimal binary search trees (Q3795240) (← links)
- A note on the height of binary search trees (Q3990603) (← links)
- Updating approximately complete trees (Q4365019) (← links)
- (Q4524567) (← links)
- Binary search trees: How low can you go? (Q5054833) (← links)
- Balanced search trees made simple (Q5060098) (← links)
- Optimal binary search trees (Q5903763) (← links)
- Optimal binary search trees (Q5906917) (← links)
- Revisiting 2-3 red-black trees with a pedagogically sound yet efficient deletion algorithm: parity-seeking (Q6592108) (← links)
