Work

Quasi-linear-time algorithm for a longest common circular factor

Year: 2026

Type: article

Source: Theoretical Computer Science

DOI: 10.1016/j.tcs.2026.115955

Authors: Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszyński, Tomasz Waleń, Wiktor Zuba

Institutions: King's College London, King Saud University, Centre National de la Recherche Scientifique, Laboratoire d'Informatique Gaspard-Monge, Université Gustave Eiffel, Max Planck Institute for Informatics, University of Warsaw

Language: English

Topic: Algorithms and Data Compression

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: European Commission, Fundacja na rzecz Nauki Polskiej, King Saud University, Israel Science Foundation, Narodowe Centrum Nauki, European Regional Development Fund

Awards: G1390695901, G5130536487, G5484317184, G6405918438, G6691274469

OpenAlex ID: W2954340885

FWCI:

Cites:

Cited by: 1

Related to: 10