Golnaz Badkobeh
Golnaz Badkobeh
City, University of London
Verified email at - Homepage
Cited by
Cited by
Unbiased black-box complexity of parallel search
G Badkobeh, PK Lehre, D Sudholt
Parallel Problem Solving from Nature–PPSN XIII: 13th International …, 2014
Black-box complexity of parallel search with distributed populations
G Badkobeh, PK Lehre, D Sudholt
Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms …, 2015
Toward a unifying framework for evolutionary processes
T Paixăo, G Badkobeh, N Barton, D Çörüş, DC Dang, T Friedrich, ...
Journal of Theoretical Biology 383, 28-43, 2015
Binary jumbled string matching for highly run-length compressible texts
G Badkobeh, G Fici, S Kroon, Z Lipták
Information Processing Letters 113 (17), 604-608, 2013
Computing the maximal-exponent repeats of an overlap-free string in linear time
G Badkobeh, M Crochemore, C Toopsuwan
String Processing and Information Retrieval: 19th International Symposium …, 2012
Algorithms for anti-powers in strings
G Badkobeh, G Fici, SJ Puglisi
Information Processing Letters 137, 57-60, 2018
Closed factorization
G Badkobeh, H Bannai, K Goto, I Tomohiro, CS Iliopoulos, S Inenaga, ...
Discrete Applied Mathematics 212, 23-29, 2016
On the number of closed factors in a word
G Badkobeh, G Fici, Z Lipták
Language and Automata Theory and Applications: 9th International Conference …, 2015
Searching page-images of early music scanned with OMR: a scalable solution using minimal absent words
T Crawford, G Badkobeh, D Lewis
Goldsmiths, University of London, 2018
Finite-Repetition threshold for infinite ternary words
G Badkobeh, M Crochemore
arXiv preprint arXiv:1108.3619, 2011
Computing the antiperiod (s) of a string
H Alamro, G Badkobeh, D Belazzougui, CS Iliopoulos, SJ Puglisi
30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019), 2019
Hunting redundancies in strings
G Badkobeh, S Chairungsee, M Crochemore
Developments in Language Theory: 15th International Conference, DLT 2011 …, 2011
Fewest repetitions in infinite binary words
G Badkobeh, M Crochemore
RAIRO-Theoretical Informatics and Applications 46 (1), 17-31, 2012
Constructing antidictionaries in output-sensitive space
LAK Ayad, G Badkobeh, G Fici, A Héliou, SP Pissis
2019 Data Compression Conference (DCC), 538-547, 2019
Characterization of some binary words with few squares
G Badkobeh, P Ochem
Theoretical Computer Science 588, 73-80, 2015
Finite repetition threshold for large alphabets
G Badkobeh, M Crochemore, M Rao
RAIRO-Theoretical Informatics and Applications-Informatique Théorique et …, 2014
On two LZ78-style grammars: Compression bounds and compressed-space computation
G Badkobeh, T Gagie, S Inenaga, T Kociumaka, D Kosolobov, SJ Puglisi
International Symposium on String Processing and Information Retrieval, 51-67, 2017
Longest common Abelian factors and large alphabets
G Badkobeh, T Gagie, S Grabowski, Y Nakashima, SJ Puglisi, S Sugimoto
International Symposium on String Processing and Information Retrieval, 254-259, 2016
A note on words with the smallest number of closed factors
G Badkobeh, G Fici, Z Lipták
CoRR abs/1305.6395, 2013
Fewest repetitions versus maximal-exponent powers in infinite binary words
G Badkobeh
Theoretical computer science 412 (48), 6625-6633, 2011
The system can't perform the operation now. Try again later.
Articles 1–20