"Quasi-Linear-Time Algorithm for Longest Common Circular Factor."

Mai Alzamel et al. (2019)

> Home

Details and statistics

DOI: 10.4230/LIPICS.CPM.2019.25

access: open

type: Conference or Workshop Paper

metadata version: 2019-07-05

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/cpm/AlzamelCIKRRSWZ19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cpm/AlzamelCIKRRSWZ19
Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Quasi-Linear-Time Algorithm for Longest Common Circular Factor. CPM 2019: 25:1-25:14

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.