English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Õ(n + poly(k))-time Algorithm for Bounded Tree Edit Distance

Das, D., Gilbert, J., Hajiaghayi, M., Kociumaka, T., Saha, B., & Saleh, H. (2022). Õ(n + poly(k))-time Algorithm for Bounded Tree Edit Distance. In FOCS 2022 (pp. 686-697). Piscataway, NJ: IEEE. doi:10.1109/FOCS54457.2022.00071.

Item is

Basic

show hide
Genre: Conference Paper
Latex : $\tilde{O}(n + \mathrm{poly}(k))$-time Algorithm for Bounded Tree Edit Distance

Files

show Files
hide Files
:
2209.07524.pdf (Preprint), 587KB
 
File Permalink:
-
Name:
2209.07524.pdf
Description:
-
OA-Status:
Visibility:
Private (embargoed till 2024)
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Das, Debarati1, Author
Gilbert, Jacob1, Author
Hajiaghayi, MohammadTaghi1, Author
Kociumaka, Tomasz2, Author           
Saha, Barna1, Author
Saleh, Hamed1, Author
Affiliations:
1External Organizations, ou_persistent22              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 20222022
 Publication Status: Published online
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Das_FOCS22
DOI: 10.1109/FOCS54457.2022.00071
 Degree: -

Event

show
hide
Title: IEEE 63rd Annual Symposium on Foundations of Computer Science
Place of Event: Denver, CO, USA
Start-/End Date: 2022-10-31 - 2022-11-03

Legal Case

show

Project information

show

Source 1

show
hide
Title: FOCS 2022
  Abbreviation : FOCS 2022
  Subtitle : 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science ; Proceedings
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Piscataway, NJ : IEEE
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 686 - 697 Identifier: ISBN: 978-1-6654-5519-0