skip to main content


Title: Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance
Award ID(s):
2223282 2218678 2114269 2217058
NSF-PAR ID:
10394729
Author(s) / Creator(s):
; ; ; ; ;
Date Published:
Journal Name:
FOCS
Page Range / eLocation ID:
686 to 697
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
No document suggestions found