An Improved Algorithm for The k-Dyck Edit Distance Problem. - Dvir Fried; Shay Golan 001; Tomasz Kociumaka; Tsvi Kopelowitz; Ely Porat; Tatiana Starikovskaya (SODA, 2022)

Faster Algorithms for Computing the Hairpin Completion Distance and Minimum Ancestor. - Itai Boneh; Dvir Fried; Adrian Miclaus; Alexandru Popa 001 (CPM, 2023)

Hairpin Completion Distance Lower Bound. - Itai Boneh; Dvir Fried; Shay Golan 001; Matan Kraus (CPM, 2024)

Searching 2D-Strings for Matching Frames. - Itai Boneh; Dvir Fried; Shay Golan 001; Matan Kraus; Adrian Miclaus; Arseny M. Shur (CPM, 2024)

Removing the log Factor from (min, +)-Products on Bounded Range Integer Matrices. - Dvir Fried; Tsvi Kopelowitz; Ely Porat (ESA, 2024)

Hamming Distance Oracle. - Itai Boneh; Dvir Fried; Shay Golan 001; Matan Kraus (CoRR, 2024)

An Improved Algorithm for The k-Dyck Edit Distance Problem. - Dvir Fried; Shay Golan 001; Tomasz Kociumaka; Tsvi Kopelowitz; Ely Porat; Tatiana Starikovskaya (ACM Trans. Algorithms, 2024)