Itai Boneh

According to our database1, Itai Boneh authored at least 13 papers between 2018 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Hairpin Completion Distance Lower Bound.
CoRR, 2024

2023
Searching 2D-Strings for Matching Frames.
CoRR, 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...