Itai Boneh

Orcid: 0009-0007-8895-4069

According to our database1, Itai Boneh authored at least 25 papers between 2018 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
The Complexity of Dynamic LZ77 is ?Θ(n<sup>2/3</sup>).
Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025
Balancing Two-Dimensional Straight-Line Programs.
CoRR, November, 2025

Deterministic Longest Common Subsequence Approximation in Near-Linear Time.
CoRR, July, 2025

Fully Dynamic LZ77 in Sublinear Time.
CoRR, February, 2025

Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Faster Construction of a Planar Distance Oracle with Õ(1) Query Time.
Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

Bounded Weighted Edit Distance: Dynamic Algorithms and Matching Lower Bounds.
Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

Covers in Optimal Space.
Proceedings of the 36th Annual Symposium on Combinatorial Pattern Matching, 2025

2024
Hamming Distance Oracle.
CoRR, 2024

Burst Edit Distance.
Proceedings of the String Processing and Information Retrieval, 2024

Õptimal Dynamic Time Warping on Run-Length Encoded Strings.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

String 2-Covers with No Length Restrictions.
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Searching 2D-Strings for Matching Frames.
Proceedings of the 35th Annual Symposium on Combinatorial Pattern Matching, 2024

Hairpin Completion Distance Lower Bound.
Proceedings of the 35th Annual Symposium on Combinatorial Pattern Matching, 2024

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

Faster Algorithms for Computing the Hairpin Completion Distance and Minimum Ancestor.
Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

2022
Optimal Vertex-Cut Sparsification of Quasi-Bipartite Graphs.
CoRR, 2022

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

The k-Mappability Problem Revisited.
Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, 2021

2020
Approximating the Anticover of a String.
Proceedings of the String Processing and Information Retrieval, 2020

Update Query Time Trade-Off for Dynamic Suffix Arrays.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Analysis of the Period Recovery Error Bound.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019
Dynamic Palindrome Detection.
CoRR, 2019

Repetition Detection in a Dynamic String.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms.
Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018


  Loading...