Golnaz Badkobeh

According to our database1, Golnaz Badkobeh authored at least 42 papers between 2010 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Avoiding square-free words on free groups.
Theor. Comput. Sci., 2022

Internal shortest absent word queries in constant time and linear space.
Theor. Comput. Sci., 2022

Linear construction of a left Lyndon tree.
Inf. Comput., 2022

Maximal Closed Substrings.
Proceedings of the String Processing and Information Retrieval, 2022

On Compressing Collections of Substring Samples.
Proceedings of the 23rd Italian Conference on Theoretical Computer Science, 2022

Back-To-Front Online Lyndon Forest Construction.
Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021
Tight upper and lower bounds on suffix tree breadth.
Theor. Comput. Sci., 2021

Constructing Antidictionaries of Long Texts in Output-Sensitive Space.
Theory Comput. Syst., 2021

Internal Shortest Absent Word Queries.
Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, 2021

2020
Avoiding conjugacy classes on the 5-letter alphabet.
RAIRO Theor. Informatics Appl., 2020

Left Lyndon Tree Construction.
Proceedings of the Prague Stringology Conference 2020, Prague, Czech Republic, August 31, 2020

2019
<i>k</i>-Abelian Pattern Matching: Revisited, Corrected, and Extended.
Proceedings of the Prague Stringology Conference 2019, 2019

Constructing Antidictionaries in Output-Sensitive Space.
Proceedings of the Data Compression Conference, 2019

Computing the Antiperiod(s) of a String.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018
Algorithms for anti-powers in strings.
Inf. Process. Lett., 2018

Searching Page-Images of Early Music Scanned with OMR: A Scalable Solution Using Minimal Absent Words.
Proceedings of the 19th International Society for Music Information Retrieval Conference, 2018

2017
Counting maximal-exponent factors in words.
Theor. Comput. Sci., 2017

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

On Suffix Tree Breadth.
Proceedings of the String Processing and Information Retrieval, 2017

On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation.
Proceedings of the String Processing and Information Retrieval, 2017

2016
Efficient computation of maximal anti-exponent in palindrome-free strings.
Theor. Comput. Sci., 2016

Computing maximal-exponent factors in an overlap-free word.
J. Comput. Syst. Sci., 2016

Closed factorization.
Discret. Appl. Math., 2016

Longest Common Abelian Factors and Large Alphabets.
Proceedings of the String Processing and Information Retrieval, 2016

2015
Characterization of some binary words with few squares.
Theor. Comput. Sci., 2015

Infinite binary words containing repetitions of odd period.
Inf. Process. Lett., 2015

On the Number of Closed Factors in a Word.
Proceedings of the Language and Automata Theory and Applications, 2015

Black-box Complexity of Parallel Search with Distributed Populations.
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.
RAIRO Theor. Informatics Appl., 2014

Unbiased Black-Box Complexity of Parallel Search.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIII, 2014

Maximal anti-exponent of gapped palindromes.
Proceedings of the Fourth International Conference on Digital Information and Communication Technology and its Applicationsm DICTAP 2014, 2014

2013
Avoiding redundancies in words.
PhD thesis, 2013

Infinite words containing the minimal number of repetitions.
J. Discrete Algorithms, 2013

Binary jumbled string matching for highly run-length compressible texts.
Inf. Process. Lett., 2013

A Note on Words With the Smallest Number of Closed Factors
CoRR, 2013

2012
Fewest repetitions in infinite binary words.
RAIRO Theor. Informatics Appl., 2012

Binary Jumbled String Matching: Faster Indexing in Less Space
CoRR, 2012

Computing the Maximal-Exponent Repeats of an Overlap-Free String in Linear Time.
Proceedings of the String Processing and Information Retrieval, 2012

2011
Fewest repetitions versus maximal-exponent powers in infinite binary words.
Theor. Comput. Sci., 2011

Finite-Repetition threshold for infinite ternary words
Proceedings of the Proceedings 8th International Conference Words 2011, 2011

Hunting Redundancies in Strings.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

2010
Bounded Number of Squares in Infinite Repetition-Constrained Binary Words.
Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30, 2010


  Loading...