Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms. - Amihood Amir; Itai Boneh (CPM, 2018)

Repetition Detection in a Dynamic String. - Amihood Amir; Itai Boneh; Panagiotis Charalampopoulos; Eitan Kondratovsky (ESA, 2019)

Dynamic Palindrome Detection. - Amihood Amir; Itai Boneh (CoRR, 2019)

Analysis of the Period Recovery Error Bound. - Amihood Amir; Itai Boneh; Michael Itzhaki; Eitan Kondratovsky (ESA, 2020)

Update Query Time Trade-Off for Dynamic Suffix Arrays. - Amihood Amir; Itai Boneh (ISAAC, 2020)

Approximating the Anticover of a String. - Amihood Amir; Itai Boneh; Eitan Kondratovsky (SPIRE, 2020)

The k-Mappability Problem Revisited. - Amihood Amir; Itai Boneh; Eitan Kondratovsky (CPM, 2021)

Dynamic Suffix Array with Sub-linear update time and Poly-logarithmic Lookup Time. - Amihood Amir; Itai Boneh (CoRR, 2021)

Optimal Vertex-Cut Sparsification of Quasi-Bipartite Graphs. - Itai Boneh; Robert Krauthgamer (CoRR, 2022)

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

Near-Optimal Dynamic Time Warping on Run-Length Encoded Strings. - Itai Boneh; Shay Golan 001; Shay Mozes; Oren Weimann (CoRR, 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)

String 2-Covers with No Length Restrictions. - Itai Boneh; Shay Golan 001; Arseny M. Shur (ESA, 2024)

Õptimal Dynamic Time Warping on Run-Length Encoded Strings. - Itai Boneh; Shay Golan 001; Shay Mozes; Oren Weimann (ICALP, 2024)

Burst Edit Distance. - Itai Boneh; Shay Golan 001; Avivit Levy; Ely Porat; B. Riva Shalom (SPIRE, 2024)

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

Covers in Optimal Space. - Itai Boneh; Shay Golan 001 (CPM, 2025)

Faster Construction of a Planar Distance Oracle with Õ(1) Query Time. - Itai Boneh; Shay Golan 001; Shay Mozes; Daniel Prigan; Oren Weimann (ICALP, 2025)

Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs. - Itai Boneh; Shiri Chechik; Shay Golan 001; Shay Mozes; Oren Weimann (STOC, 2025)

Fully Dynamic LZ77 in Sublinear Time. - Itai Boneh; Matan Kraus (CoRR, 2025)

Bounded Weighted Edit Distance: Dynamic Algorithms and Matching Lower Bounds. - Itai Boneh; Egor Gorbachev; Tomasz Kociumaka (CoRR, 2025)

Deterministic Longest Common Subsequence Approximation in Near-Linear Time. - Itai Boneh; Shay Golan 001; Matan Kraus (CoRR, 2025)