default search action
Golnaz Badkobeh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c22]Golnaz Badkobeh
, Hideo Bannai
Bijective BWT Based Compression Schemes. SPIRE 2024: 16-25 - [i11]Golnaz Badkobeh, Hideo Bannai, Dominik Köppl:
Bijective BWT based compression schemes. CoRR abs/2406.16475 (2024) - 2022
- [j18]Golnaz Badkobeh
Linear construction of a left Lyndon tree. Inf. Comput. 285(Part): 104884 (2022) - [j17]Golnaz Badkobeh, Tero Harju
Avoiding square-free words on free groups. Theor. Comput. Sci. 922: 206-217 (2022) - [j16]Golnaz Badkobeh, Panagiotis Charalampopoulos
Internal shortest absent word queries in constant time and linear space. Theor. Comput. Sci. 922: 271-282 (2022) - [c21]Golnaz Badkobeh, Maxime Crochemore, Jonas Ellert, Cyril Nicaud:
Back-To-Front Online Lyndon Forest Construction. CPM 2022: 13:1-13:23 - [c20]Golnaz Badkobeh, Sara Giuliani, Zsuzsanna Lipták, Simon J. Puglisi:
On Compressing Collections of Substring Samples. ICTCS 2022: 136-147 - [c19]Golnaz Badkobeh
Maximal Closed Substrings. SPIRE 2022: 16-23 - [i10]Golnaz Badkobeh, Alessandro De Luca, Gabriele Fici
Maximal Closed Substrings. CoRR abs/2209.00271 (2022) - 2021
- [j15]Lorraine A. K. Ayad, Golnaz Badkobeh, Gabriele Fici
Constructing Antidictionaries of Long Texts in Output-Sensitive Space. Theory Comput. Syst. 65(5): 777-797 (2021) - [j14]Golnaz Badkobeh, Pawel Gawrychowski
Tight upper and lower bounds on suffix tree breadth. Theor. Comput. Sci. 854: 63-67 (2021) - [c18]Golnaz Badkobeh, Panagiotis Charalampopoulos
Internal Shortest Absent Word Queries. CPM 2021: 6:1-6:18 - [i9]Golnaz Badkobeh, Panagiotis Charalampopoulos, Dmitry Kosolobov, Solon P. Pissis:
Internal Shortest Absent Word Queries in Constant Time and Linear Space. CoRR abs/2106.01763 (2021) - 2020
- [j13]Golnaz Badkobeh, Pascal Ochem:
Avoiding conjugacy classes on the 5-letter alphabet. RAIRO Theor. Informatics Appl. 54: 2 (2020) - [c17]Golnaz Badkobeh, Maxime Crochemore:
Left Lyndon Tree Construction. Stringology 2020: 84-95 - [i8]Golnaz Badkobeh, Maxime Crochemore:
Left Lyndon tree construction. CoRR abs/2011.12742 (2020)
2010 – 2019
- 2019
- [c16]Hayam Alamro
Computing the Antiperiod(s) of a String. CPM 2019: 32:1-32:11 - [c15]Lorraine A. K. Ayad
Constructing Antidictionaries in Output-Sensitive Space. DCC 2019: 538-547 - [c14]Golnaz Badkobeh, Hideo Bannai, Maxime Crochemore, Tomohiro I, Shunsuke Inenaga, Shiho Sugimoto:
k-Abelian Pattern Matching: Revisited, Corrected, and Extended. Stringology 2019: 29-40 - [i7]Lorraine A. K. Ayad, Golnaz Badkobeh, Gabriele Fici, Alice Héliou, Solon P. Pissis:
Constructing Antidictionaries in Output-Sensitive Space. CoRR abs/1902.04785 (2019) - 2018
- [j12]Golnaz Badkobeh, Gabriele Fici
Algorithms for anti-powers in strings. Inf. Process. Lett. 137: 57-60 (2018) - [c13]Tim Crawford, Golnaz Badkobeh, David Lewis:
Searching Page-Images of Early Music Scanned with OMR: A Scalable Solution Using Minimal Absent Words. ISMIR 2018: 233-239 - [i6]Golnaz Badkobeh, Gabriele Fici, Simon J. Puglisi:
Algorithms for Anti-Powers in Strings. CoRR abs/1805.10042 (2018) - [i5]Golnaz Badkobeh, Pascal Ochem:
Avoiding conjugacy classes on the 5-letter alphabet. CoRR abs/1811.08231 (2018) - 2017
- [j11]Golnaz Badkobeh, Maxime Crochemore
Counting maximal-exponent factors in words. Theor. Comput. Sci. 658: 27-35 (2017) - [c12]Golnaz Badkobeh, Travis Gagie
On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation. SPIRE 2017: 51-67 - [c11]Golnaz Badkobeh, Juha Kärkkäinen, Simon J. Puglisi
On Suffix Tree Breadth. SPIRE 2017: 68-73 - [i4]Golnaz Badkobeh, Travis Gagie, Shunsuke Inenaga, Dmitry Kosolobov, Simon J. Puglisi:
On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation. CoRR abs/1705.09538 (2017) - 2016
- [j10]Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi
Closed factorization. Discret. Appl. Math. 212: 23-29 (2016) - [j9]Golnaz Badkobeh, Maxime Crochemore
Computing maximal-exponent factors in an overlap-free word. J. Comput. Syst. Sci. 82(3): 477-487 (2016) - [j8]Golnaz Badkobeh, Maxime Crochemore
Efficient computation of maximal anti-exponent in palindrome-free strings. Theor. Comput. Sci. 656: 241-248 (2016) - [c10]Golnaz Badkobeh, Travis Gagie
Longest Common Abelian Factors and Large Alphabets. SPIRE 2016: 254-259 - 2015
- [j7]Golnaz Badkobeh, Maxime Crochemore
Infinite binary words containing repetitions of odd period. Inf. Process. Lett. 115(5): 543-547 (2015) - [j6]Golnaz Badkobeh, Pascal Ochem:
Characterization of some binary words with few squares. Theor. Comput. Sci. 588: 73-80 (2015) - [c9]Golnaz Badkobeh, Per Kristian Lehre, Dirk Sudholt:
Black-box Complexity of Parallel Search with Distributed Populations. FOGA 2015: 3-15 - [c8]Golnaz Badkobeh, Gabriele Fici
On the Number of Closed Factors in a Word. LATA 2015: 381-390 - 2014
- [j5]Golnaz Badkobeh, Maxime Crochemore
Finite repetition threshold for large alphabets. RAIRO Theor. Informatics Appl. 48(4): 419-430 (2014) - [c7]Golnaz Badkobeh, Maxime Crochemore, Chalita Toopsuwan:
Maximal anti-exponent of gapped palindromes. DICTAP 2014: 205-210 - [c6]Golnaz Badkobeh, Per Kristian Lehre, Dirk Sudholt:
Unbiased Black-Box Complexity of Parallel Search. PPSN 2014: 892-901 - [c5]Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto:
Closed Factorization. Stringology 2014: 162-168 - 2013
- [b1]Golnaz Badkobeh:
Avoiding redundancies in words. King's College London, UK, 2013 - [j4]Golnaz Badkobeh, Gabriele Fici
Binary jumbled string matching for highly run-length compressible texts. Inf. Process. Lett. 113(17): 604-608 (2013) - [j3]Golnaz Badkobeh:
Infinite words containing the minimal number of repetitions. J. Discrete Algorithms 20: 38-42 (2013) - [i3]Golnaz Badkobeh, Gabriele Fici, Zsuzsanna Lipták:
A Note on Words With the Smallest Number of Closed Factors. CoRR abs/1305.6395 (2013) - 2012
- [j2]Golnaz Badkobeh, Maxime Crochemore
Fewest repetitions in infinite binary words. RAIRO Theor. Informatics Appl. 46(1): 17-31 (2012) - [c4]Golnaz Badkobeh, Maxime Crochemore, Chalita Toopsuwan:
Computing the Maximal-Exponent Repeats of an Overlap-Free String in Linear Time. SPIRE 2012: 61-72 - [i2]Golnaz Badkobeh, Gabriele Fici, Steve Kroon, Zsuzsanna Lipták:
Binary Jumbled String Matching: Faster Indexing in Less Space. CoRR abs/1206.2523 (2012) - [i1]Golnaz Badkobeh, Maxime Crochemore:
Fewest repetitions in infinite binary words. CoRR abs/1207.5723 (2012) - 2011
- [j1]Golnaz Badkobeh:
Fewest repetitions versus maximal-exponent powers in infinite binary words. Theor. Comput. Sci. 412(48): 6625-6633 (2011) - [c3]Golnaz Badkobeh, Supaporn Chairungsee, Maxime Crochemore:
Hunting Redundancies in Strings. Developments in Language Theory 2011: 1-14 - [c2]Golnaz Badkobeh, Maxime Crochemore:
Finite-Repetition threshold for infinite ternary words. WORDS 2011: 37-43 - 2010
- [c1]Golnaz Badkobeh, Maxime Crochemore:
Bounded Number of Squares in Infinite Repetition-Constrained Binary Words. Stringology 2010: 161-166
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: