Weighted edit distance computation: Strings, trees, and Dyck D Das, J Gilbert, MT Hajiaghayi, T Kociumaka, B Saha
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 377-390, 2023
4 2023 O (n+ poly (k))-time algorithm for bounded tree edit distance D Das, J Gilbert, MT Hajiaghayi, T Kociumaka, B Saha, H Saleh
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
3 2022 Competitively pricing parking in a tree M Bender, J Gilbert, A Krishnan, K Pruhs
Web and Internet Economics: 16th International Conference, WINE 2020 …, 2020
3 2020 A poly-log competitive posted-price algorithm for online metrical matching on a spider M Bender, J Gilbert, K Pruhs
International Symposium on Fundamentals of Computation Theory, 67-84, 2021
2 2021 Generalized Stochastic Matching A Farhadi, J Gilbert, MT Hajiaghayi
Proceedings of the AAAI Conference on Artificial Intelligence 36 (9), 10008 …, 2022
1 2022 Location-Sensitive String Problems in MPC J Gilbert, MT Hajiaghayi, H Saleh, S Seddighin
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and …, 2023
2023 Brief Announcement: Regular and Dyck Languages in MPC J Gilbert, MT Hajiaghayi
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and …, 2023
2023 -time Algorithm for Bounded Tree Edit DistanceD Das, J Gilbert, MT Hajiaghayi, T Kociumaka, B Saha, H Saleh
arXiv preprint arXiv:2209.07524, 2022
2022