引用次数
引用: 441
H-指数: 12
I10-指数 : 13
出版物: 49
King’s Research Portal
G Badkobeh , M Crochemore , M Mohamed , C Toopsuwan
2016
A note on words with the smallest number of closed factors
GOLNAZ Badkobeh , Gabriele Fici , Zsuzsanna Lipták
CoRR abs/1305.6395
7
2013
Bounded number of squares in infinite repetition-constrained binary words
Golnaz Badkobeh , Maxime Crochemore
prague stringology conference 161 -166
1
2010
Searching Page-Images of Early Music Scanned with OMR: A Scalable Solution Using Minimal Absent Words
Golnaz Badkobeh , Tim Crawford , David Lewis
international symposium/conference on music information retrieval 233 -239
6
2018
On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation
Golnaz Badkobeh , Shunsuke Inenaga , Simon J. Puglisi , Dmitry Kosolobov
arXiv: Data Structures and Algorithms
2017
Computing the Antiperiod(s) of a String
Djamal Belazzougui , Golnaz Badkobeh , Simon J. Puglisi , Costas Iliopoulos
combinatorial pattern matching 32
4
2019
k-Abelian pattern matching: Revisited, corrected, and extended
Maxime Crochemore , Hideo Bannai , I. Tomohiro , Shiho Sugimoto
prague stringology conference 29 -40
2019
Unbiased Black-Box Complexity of Parallel Search
Golnaz Badkobeh , Per Kristian Lehre , Dirk Sudholt
parallel problem solving from nature 892 -901
61
2014
Binary jumbled string matching for highly run-length compressible texts
Golnaz Badkobeh , Gabriele Fici , Steve Kroon , Zsuzsanna Lipták
Information Processing Letters 113 ( 17) 604 -608
22
2013
Infinite binary words containing repetitions of odd period
Golnaz Badkobeh , Maxime Crochemore
Information Processing Letters 115 ( 5) 543 -547
2015
Black-box Complexity of Parallel Search with Distributed Populations
Golnaz Badkobeh , Per Kristian Lehre , Dirk Sudholt
foundations of genetic algorithms 3 -15
23
2015
Computing maximal-exponent factors in an overlap-free word
Golnaz Badkobeh , Maxime Crochemore
Journal of Computer and System Sciences 82 ( 3) 477 -487
3
2016
Computing the maximal-exponent repeats of an overlap-free string in linear time
Golnaz Badkobeh , Maxime Crochemore , Chalita Toopsuwan
string processing and information retrieval 61 -72
14
2012
Algorithms for Anti-Powers in Strings
Golnaz Badkobeh , Gabriele Fici , Simon J. Puglisi
Information Processing Letters 137 57 -60
11
2018
Hunting redundancies in strings
Golnaz Badkobeh , Supaporn Chairungsee , Maxime Crochemore
developments in language theory 1 -14
4
2011
Closed factorization
Golnaz Badkobeh , Hideo Bannai , Keisuke Goto , Tomohiro I
Discrete Applied Mathematics 212 23 -29
5
2016
Tight upper and lower bounds on suffix tree breadth
Golnaz Badkobeh , Paweł Gawrychowski , Juha Kärkkäinen , Simon J. Puglisi
Theoretical Computer Science 854 63 -67
1
2021
Longest Common Abelian Factors and Large Alphabets
Golnaz Badkobeh , Travis Gagie , Szymon Grabowski , Yuto Nakashima
String Processing and Information Retrieval 254 -259
5
2016
Toward a unifying framework for evolutionary processes
Tiago Paixão , Golnaz Badkobeh , Nick Barton , Doğan Çörüş
Journal of Theoretical Biology 383 28 -43
28
2015
Fewest repetitions versus maximal-exponent powers in infinite binary words
Golnaz Badkobeh
Theoretical Computer Science 412 ( 48) 6625 -6633
5
2011