Dvir Fried

According to our database, Dvir Fried authored at least 7 papers between 2022 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

An Improved Algorithm for The <i>k</i>-Dyck Edit Distance Problem.

Dvir Fried, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Tatiana Starikovskaya

ACM Trans. Algorithms, July, 2024

Hamming Distance Oracle.

Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus

CoRR, 2024

Removing the log Factor from (min, +)-Products on Bounded Range Integer Matrices.

Dvir Fried, Tsvi Kopelowitz, Ely Porat

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Searching 2D-Strings for Matching Frames.

Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus, Adrian Miclaus, Arseny M. Shur

Proceedings of the 35th Annual Symposium on Combinatorial Pattern Matching, 2024

Hairpin Completion Distance Lower Bound.

Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus

Proceedings of the 35th Annual Symposium on Combinatorial Pattern Matching, 2024

2023

Faster Algorithms for Computing the Hairpin Completion Distance and Minimum Ancestor.

Itai Boneh, Dvir Fried, Adrian Miclaus, Alexandru Popa

Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

2022

An Improved Algorithm for The k-Dyck Edit Distance Problem.

Dvir Fried, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Tatiana Starikovskaya

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022