Golnaz Badkobeh

ORCID

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 31

Top Venues

King's College London, UK (PHD)

Education History

King's College London, UK

PHD

Publications

Golnaz Badkobeh, Hideo Bannai, Dominik Köppl
Bijective BWT based compression schemes. CoRR (2024)
Golnaz Badkobeh, Maxime Crochemore
Linear construction of a left Lyndon tree. Inf. Comput. 285 (Part) (2022)
Golnaz Badkobeh, Sara Giuliani, Zsuzsanna Lipták, Simon J. Puglisi
On Compressing Collections of Substring Samples. ICTCS (2022)
Golnaz Badkobeh, Alessandro De Luca, Gabriele Fici, Simon J. Puglisi
Maximal Closed Substrings. CoRR (2022)
Golnaz Badkobeh, Maxime Crochemore, Jonas Ellert, Cyril Nicaud
Back-To-Front Online Lyndon Forest Construction. CPM (2022)
Golnaz Badkobeh, Alessandro De Luca, Gabriele Fici, Simon J. Puglisi
Maximal Closed Substrings. SPIRE (2022)
Golnaz Badkobeh, Panagiotis Charalampopoulos, Dmitry Kosolobov, Solon P. Pissis
Internal shortest absent word queries in constant time and linear space. Theor. Comput. Sci. 922 (2022)
Golnaz Badkobeh, Tero Harju, Pascal Ochem, Matthieu Rosenfeld
Avoiding square-free words on free groups. Theor. Comput. Sci. 922 (2022)
Golnaz Badkobeh, Panagiotis Charalampopoulos, Dmitry Kosolobov, Solon P. Pissis
Internal Shortest Absent Word Queries in Constant Time and Linear Space. CoRR (2021)
Golnaz Badkobeh, Pawel Gawrychowski, Juha Kärkkäinen, Simon J. Puglisi, Bella Zhukova
Tight upper and lower bounds on suffix tree breadth. Theor. Comput. Sci. 854 (2021)
Golnaz Badkobeh, Panagiotis Charalampopoulos, Solon P. Pissis
Internal Shortest Absent Word Queries. CPM (2021)
Lorraine A. K. Ayad, Golnaz Badkobeh, Gabriele Fici, Alice Héliou, Solon P. Pissis
Constructing Antidictionaries of Long Texts in Output-Sensitive Space. Theory Comput. Syst. 65 (5) (2021)
Golnaz Badkobeh, Maxime Crochemore
Left Lyndon Tree Construction. Stringology (2020)
Golnaz Badkobeh, Maxime Crochemore
Left Lyndon tree construction. CoRR (2020)
Golnaz Badkobeh, Pascal Ochem
Avoiding conjugacy classes on the 5-letter alphabet. RAIRO Theor. Informatics Appl. 54 (2020)
Hayam Alamro, Golnaz Badkobeh, Djamal Belazzougui, Costas S. Iliopoulos, Simon J. Puglisi
Computing the Antiperiod(s) of a String. CPM (2019)
Lorraine A. K. Ayad, Golnaz Badkobeh, Gabriele Fici, Alice Héliou, Solon P. Pissis
Constructing Antidictionaries in Output-Sensitive Space. DCC (2019)
Golnaz Badkobeh, Hideo Bannai, Maxime Crochemore, Tomohiro I, Shunsuke Inenaga, Shiho Sugimoto
-Abelian Pattern Matching: Revisited, Corrected, and Extended. Stringology (2019)
Lorraine A. K. Ayad, Golnaz Badkobeh, Gabriele Fici, Alice Héliou, Solon P. Pissis
Constructing Antidictionaries in Output-Sensitive Space. CoRR (2019)
Tim Crawford, Golnaz Badkobeh, David Lewis
Searching Page-Images of Early Music Scanned with OMR: A Scalable Solution Using Minimal Absent Words. ISMIR (2018)
Golnaz Badkobeh, Gabriele Fici, Simon J. Puglisi
Algorithms for Anti-Powers in Strings. CoRR (2018)
Golnaz Badkobeh, Gabriele Fici, Simon J. Puglisi
Algorithms for anti-powers in strings. Inf. Process. Lett. 137 (2018)
Golnaz Badkobeh, Pascal Ochem
Avoiding conjugacy classes on the 5-letter alphabet. CoRR (2018)
Golnaz Badkobeh, Travis Gagie, Shunsuke Inenaga, Dmitry Kosolobov, Simon J. Puglisi
On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation. CoRR (2017)
Golnaz Badkobeh, Juha Kärkkäinen, Simon J. Puglisi, Bella Zhukova
On Suffix Tree Breadth. SPIRE (2017)
Golnaz Badkobeh, Travis Gagie, Shunsuke Inenaga, Tomasz Kociumaka, Dmitry Kosolobov, Simon J. Puglisi
On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation. SPIRE (2017)
Golnaz Badkobeh, Maxime Crochemore, Robert Mercas
Counting maximal-exponent factors in words. Theor. Comput. Sci. 658 (2017)
Golnaz Badkobeh, Maxime Crochemore, Manal Mohamed, Chalita Toopsuwan
Efficient computation of maximal anti-exponent in palindrome-free strings. Theor. Comput. Sci. 656 (2016)
Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto
Closed factorization. Discret. Appl. Math. 212 (2016)
Golnaz Badkobeh, Maxime Crochemore
Computing maximal-exponent factors in an overlap-free word. J. Comput. Syst. Sci. 82 (3) (2016)
Golnaz Badkobeh, Travis Gagie, Szymon Grabowski, Yuto Nakashima, Simon J. Puglisi, Shiho Sugimoto
Longest Common Abelian Factors and Large Alphabets. SPIRE (2016)
Golnaz Badkobeh, Per Kristian Lehre, Dirk Sudholt
Black-box Complexity of Parallel Search with Distributed Populations. FOGA (2015)
Golnaz Badkobeh, Pascal Ochem
Characterization of some binary words with few squares. Theor. Comput. Sci. 588 (2015)
Golnaz Badkobeh, Maxime Crochemore
Infinite binary words containing repetitions of odd period. Inf. Process. Lett. 115 (5) (2015)
Golnaz Badkobeh, Gabriele Fici, Zsuzsanna Lipták
On the Number of Closed Factors in a Word. LATA (2015)
Golnaz Badkobeh, Maxime Crochemore, Michaël Rao
Finite repetition threshold for large alphabets. RAIRO Theor. Informatics Appl. 48 (4) (2014)
Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto
Closed Factorization. Stringology (2014)
Golnaz Badkobeh, Per Kristian Lehre, Dirk Sudholt
Unbiased Black-Box Complexity of Parallel Search. PPSN (2014)
Golnaz Badkobeh, Maxime Crochemore, Chalita Toopsuwan
Maximal anti-exponent of gapped palindromes. DICTAP (2014)
Golnaz Badkobeh
Infinite words containing the minimal number of repetitions. J. Discrete Algorithms 20 (2013)
Golnaz Badkobeh, Gabriele Fici, Zsuzsanna Lipták
A Note on Words With the Smallest Number of Closed Factors CoRR (2013)
Golnaz Badkobeh, Gabriele Fici, Steve Kroon, Zsuzsanna Lipták
Binary jumbled string matching for highly run-length compressible texts. Inf. Process. Lett. 113 (17) (2013)
Golnaz Badkobeh, Maxime Crochemore
Fewest repetitions in infinite binary words CoRR (2012)
Golnaz Badkobeh, Maxime Crochemore, Chalita Toopsuwan
Computing the Maximal-Exponent Repeats of an Overlap-Free String in Linear Time. SPIRE (2012)
Golnaz Badkobeh, Maxime Crochemore
Fewest repetitions in infinite binary words. RAIRO Theor. Informatics Appl. 46 (1) (2012)
Golnaz Badkobeh, Gabriele Fici, Steve Kroon, Zsuzsanna Lipták
Binary Jumbled String Matching: Faster Indexing in Less Space CoRR (2012)
Golnaz Badkobeh, Supaporn Chairungsee, Maxime Crochemore
Hunting Redundancies in Strings. Developments in Language Theory (2011)
Golnaz Badkobeh, Maxime Crochemore
Finite-Repetition threshold for infinite ternary words WORDS (2011)
Golnaz Badkobeh
Fewest repetitions versus maximal-exponent powers in infinite binary words. Theor. Comput. Sci. 412 (48) (2011)
Golnaz Badkobeh, Maxime Crochemore
Bounded Number of Squares in Infinite Repetition-Constrained Binary Words. Stringology (2010)

Golnaz Badkobeh.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Golnaz Badkobeh