Randomized binary and tree search under pressure

DOI10.4230/LIPICS.ICALP.2025.41MaRDI QIDQ7346475zbMATH OpenFDO

Authors Agustín Caracci, Christoph Dürr, José Verschae

Publication date 10 September 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2025.41

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• Deterministic and probabilistic binary search in graphs
• Edge ranking and searching in partial orders
• Fast approximation of search trees on trees with centroid trees
• Generalization of binary search: searching in trees and forest-like partial orders
• scientific article; zbMATH DE number 5764837 (Why is no real title available?)
• Improved approximation algorithms for the average-case tree searching problem
• Introduction to algorithms.
• Nearly optimal binary search trees
• On the complexity of searching in trees and partially ordered structures
• Optimal edge ranking of trees in linear time
• Optimal node ranking of tree in linear time
• Optimal Search in Trees
• Optimum binary search trees
• Searching in random partially ordered sets
• Splay trees on trees
• The binary identification problem for weighted trees
• The ellipsoid method and its consequences in combinatorial optimization
• Zur Theorie der Gesellschaftsspiele.

This page was built for publication: Randomized binary and tree search under pressure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346475)