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
Book ChapterDOI
Extracting powers and periods in a string from its runs structure
Maxime Crochemore,Costas S. Iliopoulos,Marcin Kubica,Jakub Radoszewski,Wojciech Rytter,Tomasz Waleń +5 more
TL;DR: This paper uses Lyndon words and introduces the Lyndon structure of runs as a useful tool when computing powers and presents an efficient algorithm for testing primitivity of factors of a string and computing their primitive roots.
Book ChapterDOI
Finding common motifs with gaps using finite automata
TL;DR: An algorithm that uses finite automata to find the common motifs with gaps occurring in all strings belonging to a finite set S = {S1,S2,...,Sr}.
Journal Article
On the Maximal Number of Cubic Runs in a String
Maxime Crochemore,Costas S. Iliopoulos,Marcin Kubica,Jakub Radoszewski,Wojciech Rytter,Tomasz Waleń +5 more
TL;DR: The upper bound of 0.5 n on the maximal number of runs in a string of length n has been shown in this article, and the lower bound is 0.406 n.
Journal ArticleDOI
Parallel construction of a suffix tree with applications
TL;DR: This paper presents a CRCW parallel RAM algorithm that constructs the suffix tree associated with a string ofn symbols inO(logn) time withn processors that requires Θ(n2) space.
Journal ArticleDOI
Worst-case complexity bounds on algorithms for computing the canonical structure of finite Abelian groups and the Hermite and Smith normal forms of an integer matrix
TL;DR: The upper bounds derived on the computational complexity of the algorithms above improve the upper bounds given by Kannan and Bachem in [SIAM J. Comput., 8 (1979), pp. 499–507].