Badkobeh, Golnaz
110  results:
Search for persons X
?
1

Linear construction of a left Lyndon tree:

Badkobeh, Golnaz ; Crochemore, Maxime
Information and Computation.  285 (2022)  - p. 104884 , 2022
 
?
2

Maximal Closed Substrings:

, In: String Processing and Information Retrieval; Lecture Notes in Computer Science,
 
?
3

Avoiding square-free words on free groups:

Badkobeh, Golnaz ; Harju, Tero ; Ochem, Pascal.
Theoretical Computer Science.  922 (2022)  - p. 206-217 , 2022
 
?
6

Avoiding conjugacy classes on the 5-letter alphabet:

Badkobeh, Golnaz ; Ochem, Pascal
RAIRO - Theoretical Informatics and Applications.  54 (2020)  - p. 2 , 2020
 
?
8

Algorithms for anti-powers in strings:

Badkobeh, Golnaz ; Fici, Gabriele ; Puglisi, Simon J.
Information Processing Letters.  137 (2018)  - p. 57-60 , 2018
 
?
 
?
11

Computing maximal-exponent factors in an overlap-free word:

Badkobeh, Golnaz ; Crochemore, Maxime
Journal of Computer and System Sciences.  82 (2016)  3 - p. 477-487 , 2016
 
?
12

Closed factorization:

Badkobeh, Golnaz ; Bannai, Hideo ; Goto, Keisuke...
Discrete Applied Mathematics.  212 (2016)  - p. 23-29 , 2016
 
?
13

Toward a unifying framework for evolutionary processes:

Paixão, Tiago ; Badkobeh, Golnaz ; Barton, Nick...
Journal of Theoretical Biology.  383 (2015)  - p. 28-43 , 2015
 
?
14

Black-box Complexity of Parallel Search with Distributed Po..:

, In: Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII,
 
?
15

Characterization of some binary words with few squares:

Badkobeh, Golnaz ; Ochem, Pascal
Theoretical Computer Science.  588 (2015)  - p. 73-80 , 2015
 
1-15