I agree that this site is using cookies. You can find further informations
here
.
X
Login
My folder (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
Show Desktop-Version
Toggle navigation
Boneh, Itai
13
results:
Search for persons
X
Format
Online (13)
Mediatypes
Bookchapter (Online) (1)
OpenAccess-fulltext (12)
Sorted by: Relevance
Sorted by: Year
?
1
Approximating the Anticover of a String:
, In:
String Processing and Information Retrieval; Lecture Notes in Computer Science
,
Amir, Amihood
;
Boneh, Itai
;
Kondratovsky, Eitan
- p. 99-114 , 2020
Link:
https://doi.org/10.1007/..
?
2
Near-Optimal Dynamic Time Warping on Run-Length Encoded Str..:
Boneh, Itai
;
Golan, Shay
;
Mozes, Shay
.
http://arxiv.org/abs/2302.06252. , 2023
Link:
http://arxiv.org/abs/230..
?
3
Searching 2D-Strings for Matching Frames:
Boneh, Itai
;
Fried, Dvir
;
Golan, Shay
...
http://arxiv.org/abs/2310.02670. , 2023
Link:
http://arxiv.org/abs/231..
?
4
Optimal Vertex-Cut Sparsification of Quasi-Bipartite Graphs:
Boneh, Itai
;
Krauthgamer, Robert
http://arxiv.org/abs/2207.01459. , 2022
Link:
http://arxiv.org/abs/220..
?
5
The k-Mappability Problem Revisited:
Amir, Amihood
;
Boneh, Itai
;
Kondratovsky, Eitan
doi:10.4230/LIPIcs.CPM.2021.5. , 2021
Link:
https://doi.org/10.4230/..
?
6
Dynamic Suffix Array with Sub-linear update time and Poly-l..:
Amir, Amihood
;
Boneh, Itai
http://arxiv.org/abs/2112.12678. , 2021
Link:
http://arxiv.org/abs/211..
?
7
The k-mappability problem revisited:
Amir, Amihood
;
Boneh, Itai
;
Kondratovsky, Eitan
http://arxiv.org/abs/2106.07017. , 2021
Link:
http://arxiv.org/abs/210..
?
8
Update Query Time Trade-off for dynamic Suffix Arrays:
Amir, Amihood
;
Boneh, Itai
http://arxiv.org/abs/2007.06604. , 2020
Link:
http://arxiv.org/abs/200..
?
9
Update Query Time Trade-Off for Dynamic Suffix Arrays:
Amir, Amihood
;
Boneh, Itai
doi:10.4230/LIPIcs.ISAAC.2020.63. , 2020
Link:
https://doi.org/10.4230/..
?
10
Analysis of the Period Recovery Error Bound:
Amir, Amihood
;
Boneh, Itai
;
Itzhaki, Michael
.
doi:10.4230/LIPIcs.ESA.2020.5. , 2020
Link:
https://doi.org/10.4230/..
?
11
Repetition Detection in a Dynamic String:
Amir, Amihood
;
Boneh, Itai
;
Charalampopoulos, Panagiotis
.
doi:10.4230/LIPIcs.ESA.2019.5. , 2019
Link:
https://doi.org/10.4230/..
?
12
Dynamic Palindrome Detection:
Amir, Amihood
;
Boneh, Itai
http://arxiv.org/abs/1906.09732. , 2019
Link:
http://arxiv.org/abs/190..
?
13
Locally Maximal Common Factors as a Tool for Efficient Dyna..:
Amir, Amihood
;
Boneh, Itai
doi:10.4230/LIPIcs.CPM.2018.11. , 2018
Link:
https://doi.org/10.4230/..
1-13