default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDItai Boneh
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus, Adrian Miclaus, Arseny M. Shur:
Searching 2D-Strings for Matching Frames. CPM 2024: 10:1-10:19- [c11]Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus:
Hairpin Completion Distance Lower Bound. CPM 2024: 11:1-11:16 - [c10]Itai Boneh, Shay Golan, Arseny M. Shur:
String 2-Covers with No Length Restrictions. ESA 2024: 31:1-31:18 - [c9]Itai Boneh, Shay Golan, Shay Mozes, Oren Weimann
:
Õptimal Dynamic Time Warping on Run-Length Encoded Strings. ICALP 2024: 30:1-30:17 - [c8]Itai Boneh, Shay Golan, Avivit Levy, Ely Porat, B. Riva Shalom:
Burst Edit Distance. SPIRE 2024: 41-56 - [i10]Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus:
Hairpin Completion Distance Lower Bound. CoRR abs/2404.11673 (2024) - [i9]Itai Boneh, Shay Golan, Arseny M. Shur:
String 2-Covers with No Length Restrictions. CoRR abs/2405.11475 (2024) - [i8]Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus:
Hamming Distance Oracle. CoRR abs/2407.05430 (2024) - 2023
- [c7]Itai Boneh, Dvir Fried, Adrian Miclaus, Alexandru Popa:
Faster Algorithms for Computing the Hairpin Completion Distance and Minimum Ancestor. CPM 2023: 5:1-5:18 - [i7]Itai Boneh, Shay Golan, Shay Mozes, Oren Weimann:
Near-Optimal Dynamic Time Warping on Run-Length Encoded Strings. CoRR abs/2302.06252 (2023) - [i6]Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus, Adrian Miclaus, Arseny M. Shur:
Searching 2D-Strings for Matching Frames. CoRR abs/2310.02670 (2023) - 2022
- [i5]Itai Boneh, Robert Krauthgamer:
Optimal Vertex-Cut Sparsification of Quasi-Bipartite Graphs. CoRR abs/2207.01459 (2022) - 2021
- [c6]Amihood Amir, Itai Boneh, Eitan Kondratovsky:
The k-Mappability Problem Revisited. CPM 2021: 5:1-5:20 - [i4]Amihood Amir, Itai Boneh, Eitan Kondratovsky:
The k-mappability problem revisited. CoRR abs/2106.07017 (2021) - [i3]Amihood Amir, Itai Boneh:
Dynamic Suffix Array with Sub-linear update time and Poly-logarithmic Lookup Time. CoRR abs/2112.12678 (2021) - 2020
- [c5]Amihood Amir, Itai Boneh, Michael Itzhaki, Eitan Kondratovsky:
Analysis of the Period Recovery Error Bound. ESA 2020: 5:1-5:21 - [c4]Amihood Amir, Itai Boneh:
Update Query Time Trade-Off for Dynamic Suffix Arrays. ISAAC 2020: 63:1-63:16 - [c3]Amihood Amir, Itai Boneh, Eitan Kondratovsky:
Approximating the Anticover of a String. SPIRE 2020: 99-114 - [i2]Amihood Amir, Itai Boneh:
Update Query Time Trade-off for dynamic Suffix Arrays. CoRR abs/2007.06604 (2020)
2010 – 2019
- 2019
- [c2]Amihood Amir, Itai Boneh, Panagiotis Charalampopoulos, Eitan Kondratovsky:
Repetition Detection in a Dynamic String. ESA 2019: 5:1-5:18 - [i1]Amihood Amir, Itai Boneh:
Dynamic Palindrome Detection. CoRR abs/1906.09732 (2019) - 2018
- [c1]Amihood Amir, Itai Boneh:
Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms. CPM 2018: 11:1-11:13
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
