Competitive Online Search Trees on Trees
From MaRDI portal
Publication:6051990
Recommendations
- Competitive Online Search Trees on Trees
- On tree search algorithms
- On-line vertex ranking of trees
- Optimal Search in Trees
- Competitive search in symmetric trees
- scientific article; zbMATH DE number 1173838
- On tree-growing search strategies
- Online evaluation of regular tree queries
- Average competitive ratios of on-line spanning trees
Cites work
- scientific article; zbMATH DE number 1670671 (Why is no real title available?)
- scientific article; zbMATH DE number 5764837 (Why is no real title available?)
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- scientific article; zbMATH DE number 3607502 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- O(log log n)-competitive dynamic binary search trees
- A Best Possible Bound for The Weighted Path Length of Binary Search Trees
- A Mathematical Theory of Communication
- A data structure for dynamic trees
- An Explanation of Splaying
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Chain-splay trees, or, how to achieve and prove \(\log \log N\)-competitiveness by splaying
- Coxeter complexes and graph-associahedra
- Deterministic and probabilistic binary search in graphs
- Dynamic Optimality—Almost
- Faces of generalized permutohedra
- Finding minimum height elimination trees for interval graphs in polynomial time
- Generalized Template Splay: A Basic Theory and Calculus
- Graph properties of graph associahedra
- Homotopy Associativity of H-Spaces. I
- Improved approximation algorithms for the average-case tree searching problem
- In pursuit of the dynamic optimality conjecture
- Introduction to algorithms.
- Lower Bounds for Accessing Binary Search Trees with Rotations
- Many non-equivalent realizations of the associahedron
- Monoïdes préordonnés et chaînes de Malcev
- Nearly optimal binary search trees
- On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences
- On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof
- On the complexity of searching in trees and partially ordered structures
- On the diameter of tree associahedra
- On the tree search problem with non-uniform costs
- On the vertex ranking problem for trapezoid, circular-arc and other graphs
- Optimal Search in Trees
- Optimal node ranking of tree in linear time
- Optimum binary search trees
- Permutohedra, Associahedra, and Beyond
- Rankings of Graphs
- Searching in dynamic tree-like partial orders
- Self-adjusting binary search trees
- Self-adjusting binary search trees: what makes them tick?
- Sparsity. Graphs, structures, and algorithms
- The associahedron and triangulations of the \(n\)-gon
- The diameter of associahedra
- The geometry of binary search trees
- Weighted dynamic finger in binary search trees
This page was built for publication: Competitive Online Search Trees on Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6051990)
