Competitive Online Search Trees on Trees

DOI10.1137/1.9781611975994.115OpenAlexW3003005173MaRDI QIDQ5146899

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

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)

Related Items (2)

The rotation distance of brooms ⋮ Diameter estimates for graph associahedra

This page was built for publication: Competitive Online Search Trees on Trees