%0 Conference Paper %1 conf/cpm/AlzamelCIKRRSWZ19 %A Alzamel, Mai %A Crochemore, Maxime %A Iliopoulos, Costas S. %A Kociumaka, Tomasz %A Radoszewski, Jakub %A Rytter, Wojciech %A Straszynski, Juliusz %A Walen, Tomasz %A Zuba, Wiktor %B CPM %D 2019 %E Pisanti, Nadia %E Pissis, Solon P. %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 25:1-25:14 %T Quasi-Linear-Time Algorithm for Longest Common Circular Factor. %U http://dblp.uni-trier.de/db/conf/cpm/cpm2019.html#AlzamelCIKRRSWZ19 %V 128 %@ 978-3-95977-103-0

@inproceedings{conf/cpm/AlzamelCIKRRSWZ19, added-at = {2019-07-05T00:00:00.000+0200}, author = {Alzamel, Mai and Crochemore, Maxime and Iliopoulos, Costas S. and Kociumaka, Tomasz and Radoszewski, Jakub and Rytter, Wojciech and Straszynski, Juliusz and Walen, Tomasz and Zuba, Wiktor}, biburl = {https://www.bibsonomy.org/bibtex/20e71b0b3f4ef94240cebdde3a5d81d56/dblp}, booktitle = {CPM}, crossref = {conf/cpm/2019}, editor = {Pisanti, Nadia and Pissis, Solon P.}, ee = {https://doi.org/10.4230/LIPIcs.CPM.2019.25}, interhash = {fc10c2345dab726932927ed42b7c3b35}, intrahash = {0e71b0b3f4ef94240cebdde3a5d81d56}, isbn = {978-3-95977-103-0}, keywords = {dblp}, pages = {25:1-25:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2024-08-26T07:20:51.000+0200}, title = {Quasi-Linear-Time Algorithm for Longest Common Circular Factor.}, url = {http://dblp.uni-trier.de/db/conf/cpm/cpm2019.html#AlzamelCIKRRSWZ19}, volume = 128, year = 2019 }