Itai Boneh

• 2025

  • Faster Construction of a Planar Distance Oracle with Õ(1) Query Time
    Itai Boneh, Shay Golan, Shay Mozes, Daniel Prigan, and Oren Weimann
    International Colloquium on Automata, Languages, and Programming, ICALP 2025 [arXiv]

  • Õptimal  Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs
    Itai Boneh, Shiri Chechik, Shay Golan, Shay Mozes, and Oren Weimann
    To appear in Symposium on Theory of Computing, STOC 2025

  • Covers in Optimal Space
    Itai Boneh, and Shay Golan

To appear in Combinatorial Pattern Matching, CPM 2025 

• 2024:

  • String 2-Covers with No Length Restrictions
    Itai Boneh, Shay Golan and Arseny Shur
    European Symposium on Algorithms, ESA 2024 [DOI] [arXiv]

  • Õptimal Dynamic Time Warping on Run-Length Encoded Strings
    Itai Boneh, Shay Golan, Shay Mozes, and Oren Weimann
    International Colloquium on Automata, Languages, and Programming, ICALP 2024 [DOI] [arXiv]

  • Searching 2D-Strings for Matching Frames
    Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus, Adrian Miclaus and Arseny Shur
    Combinatorial Pattern Matching, CPM 2024 [DOI] [arXiv]

  • Hairpin Completion Distance Lower Bound
    Itai Boneh, Dvir Fried, Shay Golan and Matan Kraus
    Combinatorial Pattern Matching, CPM 2024 [DOI] [arXiv]

  • Burst Edit Distance
    Itai Boneh, Shay Golan, Avivit Levy, Ely Porat and B. Riva Shalom
    String Processing and Information Retrieval, SPIRE 2024 [DOI] 

• 2023:

  • Faster Algorithms for Computing the Hairpin Completion Distance and Minimum Ancestor
    Itai Boneh, Dvir Fried, Adrian Miclaus, Alexandru Popa
    Combinatorial Pattern Matching, CPM 2023 [DOI]

• 2021:

  • The k-Mappability Problem Revisited
    Amihood Amir, Itai Boneh, Eitan Kondratovsky
    Combinatorial Pattern Matching, CPM 2021 [DOI] [arXiv]

• 2020

  • Analysis of the Period Recovery Error Bound
    Amihood Amir, Itai Boneh, Michael Itzhaki, Eitan Kondratovsky
    European Symposium on Algorithms, ESA 2020 [DOI] 

  • Update Query Time Trade-Off for Dynamic Suffix Arrays
    Amihood Amir, Itai Boneh
    International Symposium on Algorithms and Computation, ISAAC [DOI]

  • Approximating the Anticover of a String
    Amihood Amir, Itai Boneh, Eitan Kondratovsky
    String Processing and Information Retrieval, SPIRE 2020 [DOI]

• 2019

  • Repetition Detection in a Dynamic String
    Amihood Amir, Itai Boneh, Panagiotis Charalampopoulos, Eitan Kondratovsky
    European Symposium on Algorithms, ESA 2019 [DOI]

• 2018

  • Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms
    Amihood Amir, Itai Boneh
    Annual Symposium on Combinatorial Pattern Matching, CPM 2018 [DOI]

Preprints 

• • Hamming Distance Oracle
    Itai Boneh, Dvir Fried, Shay Golan and Matan Kraus
    2024 [arXiv]

  • Õptimal Algorithm for Fully Dynamic LZ77
    Itai Boneh, Shay Golan, and Matan Kraus
    2025 [arXiv]

  • Deterministic Longest Common Subsequence Approximation in Near-Linear Time
    Itai Boneh, Shay Golan, and Matan Kraus
    2025 [arXiv]