Golnaz Badkobeh

According to our database, Golnaz Badkobeh authored at least 43 papers between 2010 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Bijective BWT Based Compression Schemes.

Golnaz Badkobeh, Hideo Bannai, Dominik Köppl

Proceedings of the String Processing and Information Retrieval, 2024

2022

Avoiding square-free words on free groups.

Golnaz Badkobeh, Tero Harju, Pascal Ochem, Matthieu Rosenfeld

Theor. Comput. Sci., 2022

Internal shortest absent word queries in constant time and linear space.

Golnaz Badkobeh, Panagiotis Charalampopoulos, Dmitry Kosolobov, Solon P. Pissis

Theor. Comput. Sci., 2022

Linear construction of a left Lyndon tree.

Golnaz Badkobeh, Maxime Crochemore

Inf. Comput., 2022

Maximal Closed Substrings.

Golnaz Badkobeh, Alessandro De Luca, Gabriele Fici, Simon J. Puglisi

Proceedings of the String Processing and Information Retrieval, 2022

On Compressing Collections of Substring Samples.

Golnaz Badkobeh, Sara Giuliani, Zsuzsanna Lipták, Simon J. Puglisi

Proceedings of the 23rd Italian Conference on Theoretical Computer Science, 2022

Back-To-Front Online Lyndon Forest Construction.

Golnaz Badkobeh, Maxime Crochemore, Jonas Ellert, Cyril Nicaud

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021

Tight upper and lower bounds on suffix tree breadth.

Golnaz Badkobeh, Pawel Gawrychowski, Juha Kärkkäinen, Simon J. Puglisi, Bella Zhukova

Theor. Comput. Sci., 2021

Constructing Antidictionaries of Long Texts in Output-Sensitive Space.

Lorraine A. K. Ayad, Golnaz Badkobeh, Gabriele Fici, Alice Héliou, Solon P. Pissis

Theory Comput. Syst., 2021

Internal Shortest Absent Word Queries.

Golnaz Badkobeh, Panagiotis Charalampopoulos, Solon P. Pissis

Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, 2021

2020

Avoiding conjugacy classes on the 5-letter alphabet.

Golnaz Badkobeh, Pascal Ochem

RAIRO Theor. Informatics Appl., 2020

Left Lyndon Tree Construction.

Golnaz Badkobeh, Maxime Crochemore

Proceedings of the Prague Stringology Conference 2020, Prague, Czech Republic, August 31, 2020

2019

<i>k</i>-Abelian Pattern Matching: Revisited, Corrected, and Extended.

Golnaz Badkobeh, Hideo Bannai, Maxime Crochemore, Tomohiro I, Shunsuke Inenaga, Shiho Sugimoto

Proceedings of the Prague Stringology Conference 2019, 2019

Constructing Antidictionaries in Output-Sensitive Space.

Lorraine A. K. Ayad, Golnaz Badkobeh, Gabriele Fici, Alice Héliou, Solon P. Pissis

Proceedings of the Data Compression Conference, 2019

Computing the Antiperiod(s) of a String.

Hayam Alamro, Golnaz Badkobeh, Djamal Belazzougui, Costas S. Iliopoulos, Simon J. Puglisi

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018

Algorithms for anti-powers in strings.

Golnaz Badkobeh, Gabriele Fici, Simon J. Puglisi

Inf. Process. Lett., 2018

Searching Page-Images of Early Music Scanned with OMR: A Scalable Solution Using Minimal Absent Words.

Tim Crawford, Golnaz Badkobeh, David Lewis

Proceedings of the 19th International Society for Music Information Retrieval Conference, 2018

2017

Counting maximal-exponent factors in words.

Golnaz Badkobeh, Maxime Crochemore, Robert Mercas

Theor. Comput. Sci., 2017

On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation.

Golnaz Badkobeh, Travis Gagie, Shunsuke Inenaga, Dmitry Kosolobov, Simon J. Puglisi

CoRR, 2017

On Suffix Tree Breadth.

Golnaz Badkobeh, Juha Kärkkäinen, Simon J. Puglisi, Bella Zhukova

Proceedings of the String Processing and Information Retrieval, 2017

On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation.

Golnaz Badkobeh, Travis Gagie, Shunsuke Inenaga, Tomasz Kociumaka, Dmitry Kosolobov, Simon J. Puglisi

Proceedings of the String Processing and Information Retrieval, 2017

2016

Efficient computation of maximal anti-exponent in palindrome-free strings.

Golnaz Badkobeh, Maxime Crochemore, Manal Mohamed, Chalita Toopsuwan

Theor. Comput. Sci., 2016

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

Golnaz Badkobeh, Maxime Crochemore

J. Comput. Syst. Sci., 2016

Closed factorization.

Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto

Discret. Appl. Math., 2016

Longest Common Abelian Factors and Large Alphabets.

Golnaz Badkobeh, Travis Gagie, Szymon Grabowski, Yuto Nakashima, Simon J. Puglisi, Shiho Sugimoto

Proceedings of the String Processing and Information Retrieval, 2016

2015

Characterization of some binary words with few squares.

Golnaz Badkobeh, Pascal Ochem

Theor. Comput. Sci., 2015

Infinite binary words containing repetitions of odd period.

Golnaz Badkobeh, Maxime Crochemore

Inf. Process. Lett., 2015

On the Number of Closed Factors in a Word.

Golnaz Badkobeh, Gabriele Fici, Zsuzsanna Lipták

Proceedings of the Language and Automata Theory and Applications, 2015

Black-box Complexity of Parallel Search with Distributed Populations.

Golnaz Badkobeh, Per Kristian Lehre, Dirk Sudholt

Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII, Aberystwyth, United Kingdom, January 17, 2015

2014

Finite repetition threshold for large alphabets.

Golnaz Badkobeh, Maxime Crochemore, Michaël Rao

RAIRO Theor. Informatics Appl., 2014

Unbiased Black-Box Complexity of Parallel Search.

Golnaz Badkobeh, Per Kristian Lehre, Dirk Sudholt

Proceedings of the Parallel Problem Solving from Nature - PPSN XIII, 2014

Maximal anti-exponent of gapped palindromes.

Golnaz Badkobeh, Maxime Crochemore, Chalita Toopsuwan

Proceedings of the Fourth International Conference on Digital Information and Communication Technology and its Applicationsm DICTAP 2014, 2014

2013

Avoiding redundancies in words.

Golnaz Badkobeh

PhD thesis, 2013

Infinite words containing the minimal number of repetitions.

Golnaz Badkobeh

J. Discrete Algorithms, 2013

Binary jumbled string matching for highly run-length compressible texts.

Golnaz Badkobeh, Gabriele Fici, Steve Kroon, Zsuzsanna Lipták

Inf. Process. Lett., 2013

A Note on Words With the Smallest Number of Closed Factors

Golnaz Badkobeh, Gabriele Fici, Zsuzsanna Lipták

CoRR, 2013

2012

Fewest repetitions in infinite binary words.

Golnaz Badkobeh, Maxime Crochemore

RAIRO Theor. Informatics Appl., 2012

Binary Jumbled String Matching: Faster Indexing in Less Space

Golnaz Badkobeh, Gabriele Fici, Steve Kroon, Zsuzsanna Lipták

CoRR, 2012

Computing the Maximal-Exponent Repeats of an Overlap-Free String in Linear Time.

Golnaz Badkobeh, Maxime Crochemore, Chalita Toopsuwan

Proceedings of the String Processing and Information Retrieval, 2012

2011

Fewest repetitions versus maximal-exponent powers in infinite binary words.

Golnaz Badkobeh

Theor. Comput. Sci., 2011

Finite-Repetition threshold for infinite ternary words

Golnaz Badkobeh, Maxime Crochemore

Proceedings of the Proceedings 8th International Conference Words 2011, 2011

Hunting Redundancies in Strings.

Golnaz Badkobeh, Supaporn Chairungsee, Maxime Crochemore

Proceedings of the Developments in Language Theory - 15th International Conference, 2011

2010

Bounded Number of Squares in Infinite Repetition-Constrained Binary Words.

Golnaz Badkobeh, Maxime Crochemore

Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30, 2010