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
Blanchet-Sadri, F.
157
results:
Search for persons
X
Format
Online (157)
Mediatypes
Articles (Online) (136)
Bookchapter (Online) (9)
OpenAccess-fulltext (12)
Languages
english (145)
french (2)
Sorted by: Relevance
Sorted by: Year
?
1
Border correlations, lattices, and the subgraph component p..:
Blanchet-Sadri, F.
;
Cordier, M.
;
Kirsch, R.
European Journal of Combinatorics. 68 (2018) - p. 204-222 , 2018
Link:
https://doi.org/10.1016/..
?
2
Computing primitively-rooted squares and runs in partial wo..:
Blanchet-Sadri, F.
;
Lazarow, J.
;
Nikkel, J.
..
European Journal of Combinatorics. 68 (2018) - p. 223-241 , 2018
Link:
https://doi.org/10.1016/..
?
3
Computing longest common extensions in partial words:
Blanchet-Sadri, F.
;
Osborne, S.
Discrete Applied Mathematics. 246 (2018) - p. 119-139 , 2018
Link:
https://doi.org/10.1016/..
?
4
Computing generalized de Bruijn sequences:
Blanchet-Sadri, F.
;
Munteanu, Sinziana
Theoretical Computer Science. 704 (2017) - p. 42-61 , 2017
Link:
https://doi.org/10.1016/..
?
5
Computing abelian complexity of binary uniform morphic word:
Blanchet-Sadri, F.
;
Seita, Daniel
;
Wise, David
Theoretical Computer Science. 640 (2016) - p. 41-51 , 2016
Link:
https://doi.org/10.1016/..
?
6
New Bounds and Extended Relations Between Prefix Arrays, Bo..:
Blanchet-Sadri, F.
;
Bodnar, Michelle
;
De Winkle, Benjamin
Theory of Computing Systems. 60 (2016) 3 - p. 473-497 , 2016
Link:
https://doi.org/10.1007/..
?
7
Combinatorics on partial word borders:
Allen, Emily
;
Blanchet-Sadri, F.
;
Bodnar, Michelle
...
Theoretical Computer Science. 609 (2016) - p. 469-493 , 2016
Link:
https://doi.org/10.1016/..
?
8
Squares and primitivity in partial words:
Blanchet-Sadri, F.
;
Bodnar, Michelle
;
Nikkel, Jordan
..
Discrete Applied Mathematics. 185 (2015) - p. 26-37 , 2015
Link:
https://doi.org/10.1016/..
?
9
On the state complexity of partial word DFAs:
Balkanski, Eric
;
Blanchet-Sadri, F.
;
Kilgore, Matthew
.
Theoretical Computer Science. 578 (2015) - p. 2-12 , 2015
Link:
https://doi.org/10.1016/..
?
10
Computing minimum length representations of sets of words o..:
Blanchet-Sadri, F.
;
Lohr, Andrew
Theoretical Computer Science. 596 (2015) - p. 41-54 , 2015
Link:
https://doi.org/10.1016/..
?
11
Recurrence in infinite partial words:
Blanchet-Sadri, F.
;
Chen, Bob
;
Munteanu, Sinziana
Theoretical Computer Science. 524 (2014) - p. 41-47 , 2014
Link:
https://doi.org/10.1016/..
?
12
Abelian pattern avoidance in partial words:
Blanchet-Sadri, F.
;
De Winkle, Benjamin
;
Simmons, Sean
RAIRO - Theoretical Informatics and Applications. 48 (2014) 3 - p. 315-339 , 2014
Link:
https://doi.org/10.1051/..
?
13
On the asymptotic abelian complexity of morphic words:
Blanchet-Sadri, F.
;
Fox, Nathan
;
Rampersad, Narad
Advances in Applied Mathematics. 61 (2014) - p. 46-84 , 2014
Link:
https://doi.org/10.1016/..
?
14
Squares in partial words:
Blanchet-Sadri, F.
;
Jiao, Yang
;
Machacek, John M.
..
Theoretical Computer Science. 530 (2014) - p. 42-57 , 2014
Link:
https://doi.org/10.1016/..
?
15
Deciding representability of sets of words of equal length:
Blanchet-Sadri, F.
;
Simmons, Sean
Theoretical Computer Science. 475 (2013) - p. 34-46 , 2013
Link:
https://doi.org/10.1016/..
1-15