Golnaz Badkobeh

From MaRDI portal
Person:313749

Available identifiers

zbMath Open badkobeh.golnazMaRDI QIDQ313749

List of research outcomes





PublicationDate of PublicationType
Back-to-front online Lyndon forest construction2024-05-06Paper
More characterizations of morphic words2023-12-17Paper
Maximal closed substrings2023-08-04Paper
https://portal.mardi4nfdi.de/entity/Q60987762023-06-14Paper
Computing the Antiperiod(s) of a String2022-07-18Paper
Avoiding square-free words on free groups2022-06-13Paper
Internal shortest absent word queries in constant time and linear space2022-06-13Paper
Linear construction of a left Lyndon tree2022-06-08Paper
Constructing antidictionaries of long texts in output-sensitive space2021-08-05Paper
Avoiding Square-Free Words on Free Groups2021-04-14Paper
On Suffix Tree Breadth2021-02-16Paper
On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation2021-02-16Paper
Tight upper and lower bounds on suffix tree breadth2021-01-25Paper
Avoiding conjugacy classes on the 5-letter alphabet2020-07-21Paper
Longest common abelian factors and large alphabets2018-10-17Paper
Algorithms for anti-powers in strings2018-06-15Paper
Text redundancies2017-10-06Paper
Black-box Complexity of Parallel Search with Distributed Populations2017-05-10Paper
Efficient computation of maximal anti-exponent in palindrome-free strings2017-02-06Paper
Counting maximal-exponent factors in words2016-12-19Paper
Closed factorization2016-09-12Paper
Toward a unifying framework for evolutionary processes2016-08-18Paper
On the Number of Closed Factors in a Word2016-04-08Paper
Finite-repetition threshold for infinite ternary words2016-03-01Paper
Computing maximal-exponent factors in an overlap-free word2015-12-30Paper
Characterization of some binary words with few squares2015-06-11Paper
Infinite binary words containing repetitions of odd period2015-04-02Paper
Finite repetition threshold for large alphabets2014-12-12Paper
Infinite words containing the minimal number of repetitions2014-08-13Paper
Binary jumbled string matching for highly run-length compressible texts2014-04-11Paper
Fewest repetitions in infinite binary words2012-08-31Paper
Fewest repetitions versus maximal-exponent powers in infinite binary words2011-12-07Paper
Hunting Redundancies in Strings2011-07-29Paper

Research outcomes over time

This page was built for person: Golnaz Badkobeh