Scholar
Itai Boneh
Google Scholar ID: URFC8e0AAAAJ
Postdoc, Reichman University and University of Haifa
String Algorithms
Dynamic Algorithms
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
87
H-index
5
i10-index
2
Publications
20
Co-authors
10
list available
Contact
CV
Open ↗
GitHub
Open ↗
Publications
6 items
Balancing Two-Dimensional Straight-Line Programs
2025
Cited
0
Deterministic Longest Common Subsequence Approximation in Near-Linear Time
2025
Cited
0
Bounded Weighted Edit Distance: Dynamic Algorithms and Matching Lower Bounds
2025
Cited
0
~Optimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs
2025
Cited
0
Faster Construction of a Planar Distance Oracle with ~{O}(1) Query Time
2025
Cited
0
Fully Dynamic LZ77 in Sublinear Time
2025
Cited
0
Resume (English only)
Academic Achievements
Publications:
- 2026: 'The Complexity of Dynamic LZ77 is Θ˜(n^{2/3})', SODA 2026
- 2025: 'Bounded Weighted Edit Distance: Dynamic Algorithms and Matching Lower Bounds', ESA 2025
- 2025: 'Faster Construction of a Planar Distance Oracle with Õ(1) Query Time', ICALP 2025
- 2025: 'Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs', STOC 2025
- 2025: 'Covers in Optimal Space', CPM 2025
- 2024: 'String 2-Covers with No Length Restrictions', ESA 2024
- 2024: 'Õptimal Dynamic Time Warping on Run-Length Encoded Strings', ICALP 2024
- 2024: 'Searching 2D-Strings for Matching Frames', CPM 2024
- 2024: 'Hairpin Completion Distance Lower Bound', CPM 2024
- 2024: 'Burst Edit Distance', SPIRE 2024
- 2023: 'Faster Algorithms for Computing the Hairpin Completion Distance and Minimum Ancestor', CPM 2023
- 2021: 'The k-Mappability Problem Revisited', CPM 2021
- 2020: 'Analysis of the Period Recovery Error Bound', ESA 2020
- 2020: 'Update Query Time Trade-Off for Dynamic Suffix Arrays', ISAAC 2020
- 2020: 'Approximating the Anticover of a String', SPIRE 2020
- 2019: 'Repetition Detection in a Dynamic String', ESA 2019
- 2018: 'Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms', CPM 2018
Research Experience
1. Postdoctoral Researcher at University of Wrocław, Hosted by: Paweł Gawrychowski.
2. Postdoctoral Researcher at Reichman University and University of Haifa, Hosted by: Shay Mozes and Oren Weimann.
Education
Ph.D.: Bar-Ilan University, Department of Computer Science, Advisor: Amihood Amir.
Background
Research Interests: String algorithms, particularly dynamic string algorithms. Field: Computer Science.
Miscellany
Contact: itai.bone@biu.ac.il
Co-authors
10 total
Co-author 1
Shay Golan
Postdoc, EECS, University of California, Berkeley
Co-author 3
Panagiotis Charalampopoulos
King's College London
Oren Weimann
University of Haifa
Co-author 6
Matan Kraus
Bar Ilan University
Co-author 8
×
Welcome back
Sign in to Agora
Welcome back! Please sign in to continue.
Email address
Password
Forgot password?
Continue
Do not have an account?
Sign up