Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Golnaz Badkobeh
@article{DBLP:journals/iandc/BadkobehC22,
author = {Golnaz Badkobeh and
Maxime Crochemore},
title = {Linear construction of a left Lyndon tree},
journal = {Inf. Comput.},
volume = {285},
number = {Part},
pages = {104884},
year = {2022},
url = {https://doi.org/10.1016/j.ic.2022.104884},
doi = {10.1016/J.IC.2022.104884},
timestamp = {Tue, 28 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/BadkobehC22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BadkobehHOR22,
author = {Golnaz Badkobeh and
Tero Harju and
Pascal Ochem and
Matthieu Rosenfeld},
title = {Avoiding square-free words on free groups},
journal = {Theor. Comput. Sci.},
volume = {922},
pages = {206--217},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.04.025},
doi = {10.1016/J.TCS.2022.04.025},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BadkobehHOR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BadkobehCKP22,
author = {Golnaz Badkobeh and
Panagiotis Charalampopoulos and
Dmitry Kosolobov and
Solon P. Pissis},
title = {Internal shortest absent word queries in constant time and linear
space},
journal = {Theor. Comput. Sci.},
volume = {922},
pages = {271--282},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.04.029},
doi = {10.1016/J.TCS.2022.04.029},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BadkobehCKP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BadkobehCEN22,
author = {Golnaz Badkobeh and
Maxime Crochemore and
Jonas Ellert and
Cyril Nicaud},
editor = {Hideo Bannai and
Jan Holub},
title = {Back-To-Front Online Lyndon Forest Construction},
booktitle = {33rd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2022,
June 27-29, 2022, Prague, Czech Republic},
series = {LIPIcs},
volume = {223},
pages = {13:1--13:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CPM.2022.13},
doi = {10.4230/LIPICS.CPM.2022.13},
timestamp = {Wed, 22 Jun 2022 16:20:49 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BadkobehCEN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictcs/BadkobehGLP22,
author = {Golnaz Badkobeh and
Sara Giuliani and
Zsuzsanna Lipt{\'{a}}k and
Simon J. Puglisi},
editor = {Ugo Dal Lago and
Daniele Gorla},
title = {On Compressing Collections of Substring Samples},
booktitle = {Proceedings of the 23rd Italian Conference on Theoretical Computer
Science, {ICTCS} 2022, Rome, Italy, September 7-9, 2022},
series = {{CEUR} Workshop Proceedings},
volume = {3284},
pages = {136--147},
publisher = {CEUR-WS.org},
year = {2022},
url = {https://ceur-ws.org/Vol-3284/1532.pdf},
timestamp = {Fri, 10 Mar 2023 16:23:17 +0100},
biburl = {https://dblp.org/rec/conf/ictcs/BadkobehGLP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/Badkobeh0FP22,
author = {Golnaz Badkobeh and
Alessandro De Luca and
Gabriele Fici and
Simon J. Puglisi},
editor = {Diego Arroyuelo and
Barbara Poblete},
title = {Maximal Closed Substrings},
booktitle = {String Processing and Information Retrieval - 29th International Symposium,
{SPIRE} 2022, Concepci{\'{o}}n, Chile, November 8-10, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13617},
pages = {16--23},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-20643-6\_2},
doi = {10.1007/978-3-031-20643-6\_2},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/spire/Badkobeh0FP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-00271,
author = {Golnaz Badkobeh and
Alessandro De Luca and
Gabriele Fici and
Simon J. Puglisi},
title = {Maximal Closed Substrings},
journal = {CoRR},
volume = {abs/2209.00271},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.00271},
doi = {10.48550/ARXIV.2209.00271},
eprinttype = {arXiv},
eprint = {2209.00271},
timestamp = {Mon, 19 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-00271.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AyadBFHP21,
author = {Lorraine A. K. Ayad and
Golnaz Badkobeh and
Gabriele Fici and
Alice H{\'{e}}liou and
Solon P. Pissis},
title = {Constructing Antidictionaries of Long Texts in Output-Sensitive Space},
journal = {Theory Comput. Syst.},
volume = {65},
number = {5},
pages = {777--797},
year = {2021},
url = {https://doi.org/10.1007/s00224-020-10018-5},
doi = {10.1007/S00224-020-10018-5},
timestamp = {Thu, 05 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/AyadBFHP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BadkobehGKPZ21,
author = {Golnaz Badkobeh and
Pawel Gawrychowski and
Juha K{\"{a}}rkk{\"{a}}inen and
Simon J. Puglisi and
Bella Zhukova},
title = {Tight upper and lower bounds on suffix tree breadth},
journal = {Theor. Comput. Sci.},
volume = {854},
pages = {63--67},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2020.11.037},
doi = {10.1016/J.TCS.2020.11.037},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BadkobehGKPZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BadkobehCP21,
author = {Golnaz Badkobeh and
Panagiotis Charalampopoulos and
Solon P. Pissis},
editor = {Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {Internal Shortest Absent Word Queries},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021,
July 5-7, 2021, Wroc{\l}aw, Poland},
series = {LIPIcs},
volume = {191},
pages = {6:1--6:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CPM.2021.6},
doi = {10.4230/LIPICS.CPM.2021.6},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BadkobehCP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-01763,
author = {Golnaz Badkobeh and
Panagiotis Charalampopoulos and
Dmitry Kosolobov and
Solon P. Pissis},
title = {Internal Shortest Absent Word Queries in Constant Time and Linear
Space},
journal = {CoRR},
volume = {abs/2106.01763},
year = {2021},
url = {https://arxiv.org/abs/2106.01763},
eprinttype = {arXiv},
eprint = {2106.01763},
timestamp = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-01763.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/BadkobehO20,
author = {Golnaz Badkobeh and
Pascal Ochem},
title = {Avoiding conjugacy classes on the 5-letter alphabet},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {54},
pages = {2},
year = {2020},
url = {https://doi.org/10.1051/ita/2020003},
doi = {10.1051/ITA/2020003},
timestamp = {Thu, 21 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/BadkobehO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stringology/BadkobehC20,
author = {Golnaz Badkobeh and
Maxime Crochemore},
editor = {Jan Holub and
Jan Zd{\'{a}}rek},
title = {Left Lyndon Tree Construction},
booktitle = {Prague Stringology Conference 2020, Prague, Czech Republic, August
31 - September 2, 2020},
pages = {84--95},
publisher = {Czech Technical University in Prague, Faculty of Information Technology,
Department of Theoretical Computer Science},
year = {2020},
url = {http://www.stringology.org/event/2020/p08.html},
timestamp = {Wed, 10 Feb 2021 08:42:18 +0100},
biburl = {https://dblp.org/rec/conf/stringology/BadkobehC20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-12742,
author = {Golnaz Badkobeh and
Maxime Crochemore},
title = {Left Lyndon tree construction},
journal = {CoRR},
volume = {abs/2011.12742},
year = {2020},
url = {https://arxiv.org/abs/2011.12742},
eprinttype = {arXiv},
eprint = {2011.12742},
timestamp = {Tue, 01 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-12742.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/AlamroBBIP19,
author = {Hayam Alamro and
Golnaz Badkobeh and
Djamal Belazzougui and
Costas S. Iliopoulos and
Simon J. Puglisi},
editor = {Nadia Pisanti and
Solon P. Pissis},
title = {Computing the Antiperiod(s) of a String},
booktitle = {30th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2019,
June 18-20, 2019, Pisa, Italy},
series = {LIPIcs},
volume = {128},
pages = {32:1--32:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.CPM.2019.32},
doi = {10.4230/LIPICS.CPM.2019.32},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/AlamroBBIP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcc/AyadBFHP19,
author = {Lorraine A. K. Ayad and
Golnaz Badkobeh and
Gabriele Fici and
Alice H{\'{e}}liou and
Solon P. Pissis},
editor = {Ali Bilgin and
Michael W. Marcellin and
Joan Serra{-}Sagrist{\`{a}} and
James A. Storer},
title = {Constructing Antidictionaries in Output-Sensitive Space},
booktitle = {Data Compression Conference, {DCC} 2019, Snowbird, UT, USA, March
26-29, 2019},
pages = {538--547},
publisher = {{IEEE}},
year = {2019},
url = {https://doi.org/10.1109/DCC.2019.00062},
doi = {10.1109/DCC.2019.00062},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dcc/AyadBFHP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stringology/BadkobehBCIIS19,
author = {Golnaz Badkobeh and
Hideo Bannai and
Maxime Crochemore and
Tomohiro I and
Shunsuke Inenaga and
Shiho Sugimoto},
editor = {Jan Holub and
Jan Zd{\'{a}}rek},
title = {\emph{k}-Abelian Pattern Matching: Revisited, Corrected, and Extended},
booktitle = {Prague Stringology Conference 2019, Prague, Czech Republic, August
26-28, 2019},
pages = {29--40},
publisher = {Czech Technical University in Prague, Faculty of Information Technology,
Department of Theoretical Computer Science},
year = {2019},
url = {http://www.stringology.org/event/2019/p04.html},
timestamp = {Wed, 10 Feb 2021 08:42:24 +0100},
biburl = {https://dblp.org/rec/conf/stringology/BadkobehBCIIS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-04785,
author = {Lorraine A. K. Ayad and
Golnaz Badkobeh and
Gabriele Fici and
Alice H{\'{e}}liou and
Solon P. Pissis},
title = {Constructing Antidictionaries in Output-Sensitive Space},
journal = {CoRR},
volume = {abs/1902.04785},
year = {2019},
url = {http://arxiv.org/abs/1902.04785},
eprinttype = {arXiv},
eprint = {1902.04785},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-04785.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BadkobehFP18,
author = {Golnaz Badkobeh and
Gabriele Fici and
Simon J. Puglisi},
title = {Algorithms for anti-powers in strings},
journal = {Inf. Process. Lett.},
volume = {137},
pages = {57--60},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.05.003},
doi = {10.1016/J.IPL.2018.05.003},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BadkobehFP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ismir/CrawfordB018,
author = {Tim Crawford and
Golnaz Badkobeh and
David Lewis},
editor = {Emilia G{\'{o}}mez and
Xiao Hu and
Eric Humphrey and
Emmanouil Benetos},
title = {Searching Page-Images of Early Music Scanned with {OMR:} {A} Scalable
Solution Using Minimal Absent Words},
booktitle = {Proceedings of the 19th International Society for Music Information
Retrieval Conference, {ISMIR} 2018, Paris, France, September 23-27,
2018},
pages = {233--239},
year = {2018},
url = {http://ismir2018.ircam.fr/doc/pdfs/210\_Paper.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ismir/CrawfordB018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-10042,
author = {Golnaz Badkobeh and
Gabriele Fici and
Simon J. Puglisi},
title = {Algorithms for Anti-Powers in Strings},
journal = {CoRR},
volume = {abs/1805.10042},
year = {2018},
url = {http://arxiv.org/abs/1805.10042},
eprinttype = {arXiv},
eprint = {1805.10042},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-10042.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-08231,
author = {Golnaz Badkobeh and
Pascal Ochem},
title = {Avoiding conjugacy classes on the 5-letter alphabet},
journal = {CoRR},
volume = {abs/1811.08231},
year = {2018},
url = {http://arxiv.org/abs/1811.08231},
eprinttype = {arXiv},
eprint = {1811.08231},
timestamp = {Mon, 26 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-08231.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BadkobehCM17,
author = {Golnaz Badkobeh and
Maxime Crochemore and
Robert Mercas},
title = {Counting maximal-exponent factors in words},
journal = {Theor. Comput. Sci.},
volume = {658},
pages = {27--35},
year = {2017},
url = {https://doi.org/10.1016/j.tcs.2016.02.035},
doi = {10.1016/J.TCS.2016.02.035},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BadkobehCM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/BadkobehGIKKP17,
author = {Golnaz Badkobeh and
Travis Gagie and
Shunsuke Inenaga and
Tomasz Kociumaka and
Dmitry Kosolobov and
Simon J. Puglisi},
editor = {Gabriele Fici and
Marinella Sciortino and
Rossano Venturini},
title = {On Two LZ78-style Grammars: Compression Bounds and Compressed-Space
Computation},
booktitle = {String Processing and Information Retrieval - 24th International Symposium,
{SPIRE} 2017, Palermo, Italy, September 26-29, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10508},
pages = {51--67},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-67428-5\_5},
doi = {10.1007/978-3-319-67428-5\_5},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spire/BadkobehGIKKP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/BadkobehKPZ17,
author = {Golnaz Badkobeh and
Juha K{\"{a}}rkk{\"{a}}inen and
Simon J. Puglisi and
Bella Zhukova},
editor = {Gabriele Fici and
Marinella Sciortino and
Rossano Venturini},
title = {On Suffix Tree Breadth},
booktitle = {String Processing and Information Retrieval - 24th International Symposium,
{SPIRE} 2017, Palermo, Italy, September 26-29, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10508},
pages = {68--73},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-67428-5\_6},
doi = {10.1007/978-3-319-67428-5\_6},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/spire/BadkobehKPZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BadkobehGIKP17,
author = {Golnaz Badkobeh and
Travis Gagie and
Shunsuke Inenaga and
Dmitry Kosolobov and
Simon J. Puglisi},
title = {On Two LZ78-style Grammars: Compression Bounds and Compressed-Space
Computation},
journal = {CoRR},
volume = {abs/1705.09538},
year = {2017},
url = {http://arxiv.org/abs/1705.09538},
eprinttype = {arXiv},
eprint = {1705.09538},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BadkobehGIKP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BadkobehBGIIIPS16,
author = {Golnaz Badkobeh and
Hideo Bannai and
Keisuke Goto and
Tomohiro I and
Costas S. Iliopoulos and
Shunsuke Inenaga and
Simon J. Puglisi and
Shiho Sugimoto},
title = {Closed factorization},
journal = {Discret. Appl. Math.},
volume = {212},
pages = {23--29},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2016.04.009},
doi = {10.1016/J.DAM.2016.04.009},
timestamp = {Mon, 22 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BadkobehBGIIIPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BadkobehC16,
author = {Golnaz Badkobeh and
Maxime Crochemore},
title = {Computing maximal-exponent factors in an overlap-free word},
journal = {J. Comput. Syst. Sci.},
volume = {82},
number = {3},
pages = {477--487},
year = {2016},
url = {https://doi.org/10.1016/j.jcss.2015.11.007},
doi = {10.1016/J.JCSS.2015.11.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BadkobehC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BadkobehCMT16,
author = {Golnaz Badkobeh and
Maxime Crochemore and
Manal Mohamed and
Chalita Toopsuwan},
title = {Efficient computation of maximal anti-exponent in palindrome-free
strings},
journal = {Theor. Comput. Sci.},
volume = {656},
pages = {241--248},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2016.02.014},
doi = {10.1016/J.TCS.2016.02.014},
timestamp = {Tue, 29 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BadkobehCMT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/BadkobehGGNPS16,
author = {Golnaz Badkobeh and
Travis Gagie and
Szymon Grabowski and
Yuto Nakashima and
Simon J. Puglisi and
Shiho Sugimoto},
editor = {Shunsuke Inenaga and
Kunihiko Sadakane and
Tetsuya Sakai},
title = {Longest Common Abelian Factors and Large Alphabets},
booktitle = {String Processing and Information Retrieval - 23rd International Symposium,
{SPIRE} 2016, Beppu, Japan, October 18-20, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9954},
pages = {254--259},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-46049-9\_24},
doi = {10.1007/978-3-319-46049-9\_24},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spire/BadkobehGGNPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BadkobehC15,
author = {Golnaz Badkobeh and
Maxime Crochemore},
title = {Infinite binary words containing repetitions of odd period},
journal = {Inf. Process. Lett.},
volume = {115},
number = {5},
pages = {543--547},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.01.004},
doi = {10.1016/J.IPL.2015.01.004},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BadkobehC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BadkobehO15,
author = {Golnaz Badkobeh and
Pascal Ochem},
title = {Characterization of some binary words with few squares},
journal = {Theor. Comput. Sci.},
volume = {588},
pages = {73--80},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.03.044},
doi = {10.1016/J.TCS.2015.03.044},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BadkobehO15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/foga/BadkobehLS15,
author = {Golnaz Badkobeh and
Per Kristian Lehre and
Dirk Sudholt},
editor = {Jun He and
Thomas Jansen and
Gabriela Ochoa and
Christine Zarges},
title = {Black-box Complexity of Parallel Search with Distributed Populations},
booktitle = {Proceedings of the 2015 {ACM} Conference on Foundations of Genetic
Algorithms XIII, Aberystwyth, United Kingdom, January 17 - 20, 2015},
pages = {3--15},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2725494.2725504},
doi = {10.1145/2725494.2725504},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/foga/BadkobehLS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lata/BadkobehFL15,
author = {Golnaz Badkobeh and
Gabriele Fici and
Zsuzsanna Lipt{\'{a}}k},
editor = {Adrian{-}Horia Dediu and
Enrico Formenti and
Carlos Mart{\'{\i}}n{-}Vide and
Bianca Truthe},
title = {On the Number of Closed Factors in a Word},
booktitle = {Language and Automata Theory and Applications - 9th International
Conference, {LATA} 2015, Nice, France, March 2-6, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8977},
pages = {381--390},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-15579-1\_29},
doi = {10.1007/978-3-319-15579-1\_29},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lata/BadkobehFL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/BadkobehCR14,
author = {Golnaz Badkobeh and
Maxime Crochemore and
Micha{\"{e}}l Rao},
title = {Finite repetition threshold for large alphabets},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {48},
number = {4},
pages = {419--430},
year = {2014},
url = {https://doi.org/10.1051/ita/2014017},
doi = {10.1051/ITA/2014017},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/BadkobehCR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dictap/BadkobehCT14,
author = {Golnaz Badkobeh and
Maxime Crochemore and
Chalita Toopsuwan},
title = {Maximal anti-exponent of gapped palindromes},
booktitle = {Fourth International Conference on Digital Information and Communication
Technology and its Applicationsm {DICTAP} 2014, Bangkok, Thailand,
May 6-8, 2014},
pages = {205--210},
publisher = {{IEEE}},
year = {2014},
url = {https://doi.org/10.1109/DICTAP.2014.6821683},
doi = {10.1109/DICTAP.2014.6821683},
timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
biburl = {https://dblp.org/rec/conf/dictap/BadkobehCT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ppsn/BadkobehLS14,
author = {Golnaz Badkobeh and
Per Kristian Lehre and
Dirk Sudholt},
editor = {Thomas Bartz{-}Beielstein and
J{\"{u}}rgen Branke and
Bogdan Filipic and
Jim Smith},
title = {Unbiased Black-Box Complexity of Parallel Search},
booktitle = {Parallel Problem Solving from Nature - {PPSN} {XIII} - 13th International
Conference, Ljubljana, Slovenia, September 13-17, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8672},
pages = {892--901},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-10762-2\_88},
doi = {10.1007/978-3-319-10762-2\_88},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ppsn/BadkobehLS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stringology/BadkobehBGIIIPS14,
author = {Golnaz Badkobeh and
Hideo Bannai and
Keisuke Goto and
Tomohiro I and
Costas S. Iliopoulos and
Shunsuke Inenaga and
Simon J. Puglisi and
Shiho Sugimoto},
editor = {Jan Holub and
Jan Zd{\'{a}}rek},
title = {Closed Factorization},
booktitle = {Proceedings of the Prague Stringology Conference 2014, Prague, Czech
Republic, September 1-3, 2014},
pages = {162--168},
publisher = {Department of Theoretical Computer Science, Faculty of Information
Technology, Czech Technical University in Prague},
year = {2014},
url = {http://www.stringology.org/event/2014/p15.html},
timestamp = {Mon, 22 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stringology/BadkobehBGIIIPS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/ethos/Badkobeh13,
author = {Golnaz Badkobeh},
title = {Avoiding redundancies in words},
school = {King's College London, {UK}},
year = {2013},
url = {https://kclpure.kcl.ac.uk/portal/en/theses/avoiding-redundancies-in-words(9f52f82b-2b45-480c-b54c-54983234454f).html},
timestamp = {Tue, 05 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/ethos/Badkobeh13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BadkobehFKL13,
author = {Golnaz Badkobeh and
Gabriele Fici and
Steve Kroon and
Zsuzsanna Lipt{\'{a}}k},
title = {Binary jumbled string matching for highly run-length compressible
texts},
journal = {Inf. Process. Lett.},
volume = {113},
number = {17},
pages = {604--608},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.05.007},
doi = {10.1016/J.IPL.2013.05.007},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BadkobehFKL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Badkobeh13,
author = {Golnaz Badkobeh},
title = {Infinite words containing the minimal number of repetitions},
journal = {J. Discrete Algorithms},
volume = {20},
pages = {38--42},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.03.001},
doi = {10.1016/J.JDA.2013.03.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Badkobeh13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-6395,
author = {Golnaz Badkobeh and
Gabriele Fici and
Zsuzsanna Lipt{\'{a}}k},
title = {A Note on Words With the Smallest Number of Closed Factors},
journal = {CoRR},
volume = {abs/1305.6395},
year = {2013},
url = {http://arxiv.org/abs/1305.6395},
eprinttype = {arXiv},
eprint = {1305.6395},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1305-6395.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/BadkobehC12,
author = {Golnaz Badkobeh and
Maxime Crochemore},
title = {Fewest repetitions in infinite binary words},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {46},
number = {1},
pages = {17--31},
year = {2012},
url = {https://doi.org/10.1051/ita/2011109},
doi = {10.1051/ITA/2011109},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/BadkobehC12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/BadkobehCT12,
author = {Golnaz Badkobeh and
Maxime Crochemore and
Chalita Toopsuwan},
editor = {Liliana Calder{\'{o}}n{-}Benavides and
Cristina N. Gonz{\'{a}}lez{-}Caro and
Edgar Ch{\'{a}}vez and
Nivio Ziviani},
title = {Computing the Maximal-Exponent Repeats of an Overlap-Free String in
Linear Time},
booktitle = {String Processing and Information Retrieval - 19th International Symposium,
{SPIRE} 2012, Cartagena de Indias, Colombia, October 21-25, 2012.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7608},
pages = {61--72},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-34109-0\_8},
doi = {10.1007/978-3-642-34109-0\_8},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/spire/BadkobehCT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1206-2523,
author = {Golnaz Badkobeh and
Gabriele Fici and
Steve Kroon and
Zsuzsanna Lipt{\'{a}}k},
title = {Binary Jumbled String Matching: Faster Indexing in Less Space},
journal = {CoRR},
volume = {abs/1206.2523},
year = {2012},
url = {http://arxiv.org/abs/1206.2523},
eprinttype = {arXiv},
eprint = {1206.2523},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1206-2523.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-5723,
author = {Golnaz Badkobeh and
Maxime Crochemore},
title = {Fewest repetitions in infinite binary words},
journal = {CoRR},
volume = {abs/1207.5723},
year = {2012},
url = {http://arxiv.org/abs/1207.5723},
eprinttype = {arXiv},
eprint = {1207.5723},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-5723.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Badkobeh11,
author = {Golnaz Badkobeh},
title = {Fewest repetitions versus maximal-exponent powers in infinite binary
words},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {48},
pages = {6625--6633},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.08.011},
doi = {10.1016/J.TCS.2011.08.011},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Badkobeh11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dlt/BadkobehCC11,
author = {Golnaz Badkobeh and
Supaporn Chairungsee and
Maxime Crochemore},
editor = {Giancarlo Mauri and
Alberto Leporati},
title = {Hunting Redundancies in Strings},
booktitle = {Developments in Language Theory - 15th International Conference, {DLT}
2011, Milan, Italy, July 19-22, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6795},
pages = {1--14},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22321-1\_1},
doi = {10.1007/978-3-642-22321-1\_1},
timestamp = {Sat, 09 Apr 2022 12:37:59 +0200},
biburl = {https://dblp.org/rec/conf/dlt/BadkobehCC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/corr/abs-1108-3619,
author = {Golnaz Badkobeh and
Maxime Crochemore},
editor = {Petr Ambroz and
Stepan Holub and
Zuzana Mas{\'{a}}kov{\'{a}}},
title = {Finite-Repetition threshold for infinite ternary words},
booktitle = {Proceedings 8th International Conference Words 2011, Prague, Czech
Republic, 12-16th September 2011},
series = {{EPTCS}},
volume = {63},
pages = {37--43},
year = {2011},
url = {https://doi.org/10.4204/EPTCS.63.7},
doi = {10.4204/EPTCS.63.7},
timestamp = {Wed, 12 Sep 2018 01:05:13 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1108-3619.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stringology/BadkobehC10,
author = {Golnaz Badkobeh and
Maxime Crochemore},
editor = {Jan Holub and
Jan Zd{\'{a}}rek},
title = {Bounded Number of Squares in Infinite Repetition-Constrained Binary
Words},
booktitle = {Proceedings of the Prague Stringology Conference 2010, Prague, Czech
Republic, August 30 - September 1, 2010},
pages = {161--166},
publisher = {Prague Stringology Club, Department of Theoretical Computer Science,
Faculty of Information Technology, Czech Technical University in Prague},
year = {2010},
url = {http://www.stringology.org/event/2010/p14.html},
timestamp = {Wed, 10 Feb 2021 08:42:22 +0100},
biburl = {https://dblp.org/rec/conf/stringology/BadkobehC10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2023-09-27 22:50 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:
