External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Fast Approximation of Search Trees on Trees with Centroid Trees

Benjamin Aram Berendsohn, Ishay Golinsky, Haim Kaplan, László Kozma 0002. Fast Approximation of Search Trees on Trees with Centroid Trees. In Kousha Etessami, Uriel Feige, Gabriele Puppis, editors, 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, July 10-14, 2023, Paderborn, Germany. Volume 261 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. [doi]

Authors

Benjamin Aram Berendsohn

This author has not been identified. Look up 'Benjamin Aram Berendsohn' in Google

Ishay Golinsky

This author has not been identified. Look up 'Ishay Golinsky' in Google

Haim Kaplan

This author has not been identified. Look up 'Haim Kaplan' in Google

László Kozma 0002

This author has not been identified. Look up 'László Kozma 0002' in Google
runs on