Itai Boneh

33 papers A* 4A 4B 7C 2Journal 16
YearRankTypeTitle / Venue / Authors
2026 A* conf
The Complexity of Dynamic LZ77 is ?Θ(n
SODA
Itai Boneh, Shay Golan, Matan Kraus
2025 J jnl
Balancing Two-Dimensional Straight-Line Programs.
CoRR
Itai Boneh, Estéban Gabory, Pawel Gawrychowski, Adam Górkiewicz
2025 A conf
Bounded Weighted Edit Distance: Dynamic Algorithms and Matching Lower Bounds.
ESA
Itai Boneh, Egor Gorbachev, Tomasz Kociumaka
2025 J jnl
Bounded Weighted Edit Distance: Dynamic Algorithms and Matching Lower Bounds.
CoRR
Itai Boneh, Egor Gorbachev, Tomasz Kociumaka
2025 B conf
Covers in Optimal Space.
CPM
Itai Boneh, Shay Golan
2025 J jnl
Deterministic Longest Common Subsequence Approximation in Near-Linear Time.
CoRR
Itai Boneh, Shay Golan, Matan Kraus
2025 A* conf
Faster Construction of a Planar Distance Oracle with Õ(1) Query Time.
ICALP
Itai Boneh, Shay Golan, Shay Mozes, Daniel Prigan, Oren Weimann
2025 J jnl
Faster Construction of a Planar Distance Oracle with Õ(1) Query Time.
CoRR
Itai Boneh, Shay Golan, Shay Mozes, Daniel Prigan, Oren Weimann
2025 J jnl
Fully Dynamic LZ77 in Sublinear Time.
CoRR
Itai Boneh, Matan Kraus
2025 A* conf
Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs.
STOC
Itai Boneh, Shiri Chechik, Shay Golan, Shay Mozes, Oren Weimann
2025 J jnl
Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs.
CoRR
Itai Boneh, Shiri Chechik, Shay Golan, Shay Mozes, Oren Weimann
2024 C conf
Burst Edit Distance.
SPIRE
Itai Boneh, Shay Golan, Avivit Levy, Ely Porat, B. Riva Shalom
2024 B conf
Hairpin Completion Distance Lower Bound.
CPM
Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus
2024 J jnl
Hairpin Completion Distance Lower Bound.
CoRR
Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus
2024 J jnl
Hamming Distance Oracle.
CoRR
Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus
2024 B conf
Searching 2D-Strings for Matching Frames.
CPM
Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus, Adrian Miclaus, Arseny M. Shur
2024 A conf
String 2-Covers with No Length Restrictions.
ESA
Itai Boneh, Shay Golan, Arseny M. Shur
2024 J jnl
String 2-Covers with No Length Restrictions.
CoRR
Itai Boneh, Shay Golan, Arseny M. Shur
2024 A* conf
Õptimal Dynamic Time Warping on Run-Length Encoded Strings.
ICALP
Itai Boneh, Shay Golan, Shay Mozes, Oren Weimann
2023 B conf
Faster Algorithms for Computing the Hairpin Completion Distance and Minimum Ancestor.
CPM
Itai Boneh, Dvir Fried, Adrian Miclaus, Alexandru Popa
2023 J jnl
Near-Optimal Dynamic Time Warping on Run-Length Encoded Strings.
CoRR
Itai Boneh, Shay Golan, Shay Mozes, Oren Weimann
2023 J jnl
Searching 2D-Strings for Matching Frames.
CoRR
Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus, Adrian Miclaus, Arseny M. Shur
2022 J jnl
Optimal Vertex-Cut Sparsification of Quasi-Bipartite Graphs.
CoRR
Itai Boneh, Robert Krauthgamer
2021 J jnl
Dynamic Suffix Array with Sub-linear update time and Poly-logarithmic Lookup Time.
CoRR
Amihood Amir, Itai Boneh
2021 B conf
The k-Mappability Problem Revisited.
CPM
Amihood Amir, Itai Boneh, Eitan Kondratovsky
2021 J jnl
The k-mappability problem revisited.
CoRR
Amihood Amir, Itai Boneh, Eitan Kondratovsky
2020 A conf
Analysis of the Period Recovery Error Bound.
ESA
Amihood Amir, Itai Boneh, Michael Itzhaki, Eitan Kondratovsky
2020 C conf
Approximating the Anticover of a String.
SPIRE
Amihood Amir, Itai Boneh, Eitan Kondratovsky
2020 B conf
Update Query Time Trade-Off for Dynamic Suffix Arrays.
ISAAC
Amihood Amir, Itai Boneh
2020 J jnl
Update Query Time Trade-off for dynamic Suffix Arrays.
CoRR
Amihood Amir, Itai Boneh
2019 J jnl
Dynamic Palindrome Detection.
CoRR
Amihood Amir, Itai Boneh
2019 A conf
Repetition Detection in a Dynamic String.
ESA
Amihood Amir, Itai Boneh, Panagiotis Charalampopoulos, Eitan Kondratovsky
2018 B conf
Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms.
CPM
Amihood Amir, Itai Boneh