( en | de | ru )

 

Disambiguation of "Iliopoulos, Costas S."

Author of the publication

copydeleteadd this publication to your clipboard
Efficient Computation of Palindromes in Sequences with Uncertainties.

, , , , and . EANN, volume 744 of Communications in Computer and Information Science, page 620-629. Springer, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Christos Iliopoulos

Nikolaos Iliopoulos

Peter Costas

Costas Averkiou

Costas Higoumenakis

 

Other publications of authors with the same name

A Pram Algorithm for a Special Case of the Set Partition Problem., and . Parallel Algorithms Appl., 10 (1-2): 105-109 (1996)The Subtree Max Gap Problem with Application to Parallel String Covering., , , and . SODA, page 501-510. ACM/SIAM, (1994)Longest Common Prefixes with k-Errors and Applications., , , and . CoRR, (2018)Two strings at Hamming distance 1 cannot be both quasiperiodic., , and . CoRR, (2017)Three Heuristics for delta-Matching: delta-BM Algorithms., , , , and . CPM, volume 2373 of Lecture Notes in Computer Science, page 178-189. Springer, (2002)On-Line Validation and Analysis of Partially Occluded Images., and . Journal of Automata, Languages and Combinatorics, 6 (3): 291-303 (2001)Markov Random Fields and Maximum Entropy Modeling for Music Information Retrieval., and . ISMIR, page 207-214. (2005)Overlapping repetitions in weighted sequence., , , and . CUBE, page 435-440. ACM, (2012)Preface., and . Int. J. Found. Comput. Sci., 29 (8): 1247-1248 (2018)On O(n log n) Cost Parallel Algorithm for the Single Function Coarsest Partition Problem., , and . Parallel Algorithms and Architectures, volume 269 of Lecture Notes in Computer Science, page 70-76. Springer, (1987)