Dr Golnaz Badkobeh

Staff details

PositionLecturer and Leverhulme Early Career Fellow
Department Computing
Email G.Badkobeh (@gold.ac.uk)
Dr Golnaz Badkobeh

Golnaz is a lecturer and Leverhulme Early Career Fellow in Goldsmiths' Department of Computing.

She was a Leverhulme Early Career Fellow at University of Warwick and a research associate at University of Sheffield.  She is also a visiting research fellow at King’s College London where she completed her PhD in 2013.

Her research interests are String Algorithms and Combinatorics on Words. 

Publications

Article

Counting Maximal-Exponent Factors in Words
Badkobeh, Golnaz; Crochemore, Maxime and Mercas, Robert. 2018. Counting Maximal-Exponent Factors in Words. Theoretical Computer Science, 658, pp. 27-35. ISSN 0304-3975

Algorithms for Anti-Powers in Strings
Badkobeh, Golnaz; Fici, Gabriele and Puglisi, Simon. 2018. Algorithms for Anti-Powers in Strings. Information Processing Letters, ISSN 0020-0190

On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation
Badkobeh, Golnaz; Gagie, Travis; Inenaga, shunsuke; Kociumaka, Tomasz; Kosolobov, Dmitry and Puglisi, Simon. 2017. On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation. Lecture Notes in Computer Science, 1058, pp. 51-67. ISSN 0302-9743

On Suffix Tree Breadth
Badkobeh, Golnaz; Karkkainen, Juha; Puglisi, Simon and Zhukova, Bella. 2017. On Suffix Tree Breadth. Lecture Notes in Computer Science, 1058, pp. 68-73. ISSN 0302-9743

Efficient Computation of Maximal Anti-Exponent in Palindrome-Free Strings
Badkobeh, Golnaz; Crochemore, Maxime; Mohamed, Manal and Toopsuwan, Chalita. 2016. Efficient Computation of Maximal Anti-Exponent in Palindrome-Free Strings. Theoretical Computer Science, 656, pp. 241-248. ISSN 0304-3975

Closed Factorization
Badkobeh, Golnaz; Bannai, Hideo; Goto, Keisuke; Inenaga, shunsuke; Sugimoto, Shiho; I, Tomohiro; Iliopoulos, Costas and Puglisi, Simon. 2016. Closed Factorization. Discrete Applied Mathematics, 212, pp. 23-29. ISSN 0166-218X

Longest Common Abelian Factors and Large Alphabets
Badkobeh, Golnaz; Gagie, Travis; Grabowski, Szymon; Nakashima, Yuto; Puglisi, Simon and Sugimoto, Shiho. 2016. Longest Common Abelian Factors and Large Alphabets. International Symposium on String Processing and Information Retrieval (SPIRE), pp. 254-259.

Computing maximal-exponent factors in an overlap-free word
Badkobeh, Golnaz and Crochemore, Maxime. 2014. Computing maximal-exponent factors in an overlap-free word. Journal of Computer and System Sciences, 82(3), pp. 477-487. ISSN 0022-0000