An Improved Algorithm for The k-Dyck Edit Distance Problem - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Dvir Fried, Shay Golan 0001, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Tatiana Starikovskaya. An Improved Algorithm for The k-Dyck Edit Distance Problem. In Joseph (Seffi) Naor, Niv Buchbinder, editors, Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022. pages 3650-3669, SIAM, 2022. [doi]

This author has not been identified. Look up 'Dvir Fried' in GoogleThis author has not been identified. Look up 'Shay Golan 0001' in GoogleThis author has not been identified. Look up 'Tomasz Kociumaka' in GoogleThis author has not been identified. Look up 'Tsvi Kopelowitz' in GoogleThis author has not been identified. Look up 'Ely Porat' in GoogleThis author has not been identified. Look up 'Tatiana Starikovskaya' in Google

runs on WebDSL