Golnaz Badkobeh

55 papers A 2B 4C 9Misc 4Journal 31Unranked 4

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