Quasi-Linear-Time Algorithm for Longest Common Circular Factor

Alzamel, Mai; Crochemore, Maxime; Iliopoulos, Costas S.; Kociumaka, Tomasz; Radoszewski, Jakub; Rytter, Wojciech; Straszynski, Juliusz; Walen, Tomasz; Zuba, Wiktor

doi:10.4230/LIPIcs.CPM.2019.25

by Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba

View PDF

Reference:

Quasi-Linear-Time Algorithm for Longest Common Circular Factor (Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba), In 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy, 2019.

Bibtex Entry:

@inproceedings{DBLP:conf/cpm/AlzamelCIKRRSWZ19,
  author    = {Mai Alzamel and
               Maxime Crochemore and
               Costas S. Iliopoulos and
               Tomasz Kociumaka and
               Jakub Radoszewski and
               Wojciech Rytter and
               Juliusz Straszynski and
               Tomasz Walen and
               Wiktor Zuba},
  title     = {Quasi-Linear-Time Algorithm for Longest Common Circular Factor},
  booktitle = {30th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2019,
               June 18-20, 2019, Pisa, Italy},
  pages     = {25:1--25:14},
  year      = {2019},
  crossref  = {DBLP:conf/cpm/2019},
  url       = {https://doi.org/10.4230/LIPIcs.CPM.2019.25},
  doi       = {10.4230/LIPIcs.CPM.2019.25},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/cpm/AlzamelCIKRRSWZ19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}