C
Costas S. Iliopoulos
Researcher at King's College London
Publications - 441
Citations - 7243
Costas S. Iliopoulos is an academic researcher from King's College London. The author has contributed to research in topics: String (computer science) & Pattern matching. The author has an hindex of 40, co-authored 432 publications receiving 6883 citations. Previous affiliations of Costas S. Iliopoulos include University of Cambridge & Royal Holloway, University of London.
Papers
More filters
Journal ArticleDOI
The swap matching problem revisited
TL;DR: In this paper, a graph-theoretic model was proposed to solve the swap matching problem, and the resulting algorithms are adaptations of the classic shift-and algorithm for patterns having length similar to the word-size of the target machine.
Posted Content
Quasi-Linear-Time Algorithm for Longest Common Circular Factor
Mai Alzamel,Maxime Crochemore,Costas S. Iliopoulos,Tomasz Kociumaka,Jakub Radoszewski,Wojciech Rytter,Juliusz Straszyński,Tomasz Waleń,Wiktor Zuba +8 more
TL;DR: The Longest Common Circular Factor (LCCF) as mentioned in this paper is an extension of the LCCF that computes the longest common factor of a string whose cyclic shift occurs as a factor of the length of the string.
Book ChapterDOI
Generic algorithms for factoring strings
TL;DR: Generic RAM and PRAM algorithms for factoring words over sets of strings known as circ-UMFFs are described, generalizations of the well-known Lyndon words based on lexorder, whose properties were first studied in 1958 by Chen, Fox and Lyndon.
Book ChapterDOI
On O(n log n) Cost Parallel Algorithm for the Single Function Coarsest Partition Problem
TL;DR: A CRCW PRAM algorithm is presented for computing the coarsest refinement of a partition of a finite set S of n elements with respect to a function f on S that requires O(n) processors, O(logn) time, and and O(nlogn) space.