Competitive Online Search Trees on Trees

DOI10.1137/1.9781611975994.115MaRDI QIDQ5146899zbMATH OpenOpenAlexFDO

Authors Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman

Publication date 2 February 2021

Published in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1908.00848

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(4)

• Diameter estimates for graph associahedra
• Competitive Online Search Trees on Trees
• The rotation distance of brooms
• Combinatorial generation via permutation languages. IV: Elimination 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 Q5146899)