Competitive Online Search Trees on Trees
From MaRDI portal
Publication:6051990
DOI10.1145/3595180OpenAlexW2966205006MaRDI QIDQ6051990FDOQ6051990
Authors: Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman 
Publication date: 23 October 2023
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3595180
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
- A Mathematical Theory of Communication
- Introduction to algorithms.
- A data structure for dynamic trees
- Title not available (Why is that?)
- Rankings of Graphs
- Title not available (Why is that?)
- Coxeter complexes and graph-associahedra
- Permutohedra, Associahedra, and Beyond
- Self-adjusting binary search trees
- Homotopy Associativity of H-Spaces. I
- Faces of generalized permutohedra
- Sparsity. Graphs, structures, and algorithms
- Finding minimum height elimination trees for interval graphs in polynomial time
- Optimal node ranking of tree in linear time
- The associahedron and triangulations of the \(n\)-gon
- On the tree search problem with non-uniform costs
- Title not available (Why is that?)
- Optimal Search in Trees
- Many non-equivalent realizations of the associahedron
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Optimum binary search trees
- Title not available (Why is that?)
- Improved approximation algorithms for the average-case tree searching problem
- On the complexity of searching in trees and partially ordered structures
- On the vertex ranking problem for trapezoid, circular-arc and other graphs
- The diameter of associahedra
- Graph properties of graph associahedra
- Nearly optimal binary search trees
- Monoïdes préordonnés et chaînes de Malcev
- A Best Possible Bound for The Weighted Path Length of 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
- The geometry of binary search trees
- In pursuit of the dynamic optimality conjecture
- Lower Bounds for Accessing Binary Search Trees with Rotations
- Title not available (Why is that?)
- Dynamic Optimality—Almost
- Self-adjusting binary search trees: what makes them tick?
- Weighted dynamic finger in binary search trees
- O(log log n)-competitive dynamic binary search trees
- Generalized Template Splay: A Basic Theory and Calculus
- An Explanation of Splaying
- Chain-splay trees, or, how to achieve and prove \(\log \log N\)-competitiveness by splaying
- Deterministic and probabilistic binary search in graphs
- On the diameter of tree associahedra
- Searching in dynamic tree-like partial orders
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)
