Itai Boneh

According to our database, Itai Boneh authored at least 23 papers between 2018 and 2025.

Collaborative distances:

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

2025

Deterministic Longest Common Subsequence Approximation in Near-Linear Time.

Itai Boneh, Shay Golan, Matan Kraus

CoRR, July, 2025

Bounded Weighted Edit Distance: Dynamic Algorithms and Matching Lower Bounds.

Itai Boneh, Egor Gorbachev, Tomasz Kociumaka

CoRR, July, 2025

Fully Dynamic LZ77 in Sublinear Time.

Itai Boneh, Matan Kraus

CoRR, February, 2025

Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs.

Itai Boneh, Shiri Chechik, Shay Golan, Shay Mozes, Oren Weimann

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Faster Construction of a Planar Distance Oracle with Õ(1) Query Time.

Itai Boneh, Shay Golan, Shay Mozes, Daniel Prigan, Oren Weimann

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

Covers in Optimal Space.

Itai Boneh, Shay Golan

Proceedings of the 36th Annual Symposium on Combinatorial Pattern Matching, 2025

2024

Hamming Distance Oracle.

Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus

CoRR, 2024

Burst Edit Distance.

Itai Boneh, Shay Golan, Avivit Levy, Ely Porat, B. Riva Shalom

Proceedings of the String Processing and Information Retrieval, 2024

Õptimal Dynamic Time Warping on Run-Length Encoded Strings.

Itai Boneh, Shay Golan, Shay Mozes, Oren Weimann

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

String 2-Covers with No Length Restrictions.

Itai Boneh, Shay Golan, Arseny M. Shur

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

Near-Optimal Dynamic Time Warping on Run-Length Encoded Strings.

Itai Boneh, Shay Golan, Shay Mozes, Oren Weimann

CoRR, 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

Optimal Vertex-Cut Sparsification of Quasi-Bipartite Graphs.

Itai Boneh, Robert Krauthgamer

CoRR, 2022

2021

Dynamic Suffix Array with Sub-linear update time and Poly-logarithmic Lookup Time.

Amihood Amir, Itai Boneh

CoRR, 2021

The k-Mappability Problem Revisited.

Amihood Amir, Itai Boneh, Eitan Kondratovsky

Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, 2021

2020

Approximating the Anticover of a String.

Amihood Amir, Itai Boneh, Eitan Kondratovsky

Proceedings of the String Processing and Information Retrieval, 2020

Update Query Time Trade-Off for Dynamic Suffix Arrays.

Amihood Amir, Itai Boneh

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Analysis of the Period Recovery Error Bound.

Amihood Amir, Itai Boneh, Michael Itzhaki, Eitan Kondratovsky

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

Dynamic Palindrome Detection.

Amihood Amir, Itai Boneh

CoRR, 2019

Repetition Detection in a Dynamic String.

Amihood Amir, Itai Boneh, Panagiotis Charalampopoulos, Eitan Kondratovsky

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms.

Amihood Amir, Itai Boneh

Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018