Costas S. Iliopoulos

363 papers A* 1A 1B 42C 49Misc 21Journal 186Unranked 60
YearRankTypeTitle / Venue / Authors
2026 J jnl
Finding the cyclic covers of a string.
Inf. Process. Lett.
Roberto Grossi, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing-Kin Sung, Wiktor Zuba
2026 J jnl
Internal quasiperiod queries.
Theor. Comput. Sci.
Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2025 J jnl
Deep learning approaches and data augmentation for melanoma detection.
Neural Comput. Appl.
Mai Alzamel, Costas S. Iliopoulos, Zara Lim
2024 — conf
IRfold: An RNA Secondary Structure Prediction Approach.
AIAI (1)
David Hurst, Costas S. Iliopoulos, Zara Lim, Ionut Moraru
2024 — conf
Pattern Matching in Polyphonic Musical Sequences.
AIAI (4)
Mai Alzamel, Costas S. Iliopoulos, Zara Lim, Marie Moser-Schwaiger
2023 C conf
Advanced Skin Cancer Detection Using Deep Learning.
EANN
Mai Alzamel, Seba Alhejaili, Fatimah Alhumaidhi, Joud Alismail, Lama Almubarak, Halah Altammami, Costas S. Iliopoulos, Zara Lim
2023 B conf
Finding the Cyclic Covers of a String.
WALCOM
Roberto Grossi, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing-Kin Sung, Wiktor Zuba
2023 B conf
Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String.
CPM
Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2023 — conf
Local Maximal Equality-Free Periodicities.
AIAI (Workshops)
Mai Alzamel, Jacqueline W. Daykin, Christopher Hampson, Costas S. Iliopoulos, Zara Lim, W. F. Smyth
2023 B conf
MUL-Tree Pruning for Consistency and Compatibility.
CPM
Christopher Hampson, Daniel J. Harvey, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing-Kin Sung
2023 J jnl
Maximal degenerate palindromes with gaps and mismatches.
Theor. Comput. Sci.
Mai Alzamel, Christopher Hampson, Costas S. Iliopoulos, Zara Lim, Solon P. Pissis, Dimitrios Vlachakis, Steven Watts
2023 J jnl
Preface: MatBio 2021 Special Section.
J. Comput. Biol.
Mai Alzamel, Christopher Hampson, Costas S. Iliopoulos, Fatima Vayani
2022 J jnl
Efficient Computation of Sequence Mappability.
Algorithmica
Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski
2022 B conf
Linear-Time Computation of Shortest Covers of All Rotations of a String.
CPM
Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2022 J jnl
Special Issue of Algorithmica for the 28th London Stringology Days & London Algorithmic Workshop (LSD & LAW).
Algorithmica
Mai Alzamel, Costas S. Iliopoulos, Dimitrios Letsios, Nicola Prezza
2021 J jnl
Efficient pattern matching in elastic-degenerate strings.
Inf. Comput.
Costas S. Iliopoulos, Ritu Kundu, Solon P. Pissis
2021 J jnl
IUPACpal: efficient identification of inverted repeats in IUPAC-encoded DNA sequences.
BMC Bioinform.
Hayam Alamro, Mai Alzamel, Costas S. Iliopoulos, Solon P. Pissis, Steven Watts
2021 J jnl
Shortest covers of all cyclic shifts of a string.
Theor. Comput. Sci.
Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2020 — conf
Application and Algorithm: Maximal Motif Discovery for Biological Data in a Sliding Window.
AIAI (Workshops)
Miznah H. Alshammary, Costas S. Iliopoulos, Manal Mohamed, Fatima Vayani
2020 J jnl
Comparing Degenerate Strings.
Fundam. Informaticae
Mai Alzamel, Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone
2020 C conf
Detecting Pattern Efficiently with Don't Cares.
EANN
Hayam Alamro, Costas S. Iliopoulos
2020 J jnl
Efficient Identification of k-Closed Strings.
Int. J. Found. Comput. Sci.
Hayam Alamro, Mai Alzamel, Costas S. Iliopoulos, Solon P. Pissis, Wing-Kin Sung, Steven Watts
2020 B conf
Efficiently Detecting Web Spambots in a Temporally Annotated Sequence.
AINA
Hayam Alamro, Costas S. Iliopoulos, Grigorios Loukides
2020 J jnl
Faster algorithms for 1-mappability of a sequence.
Theor. Comput. Sci.
Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski, Wing-Kin Sung
2020 B conf
Finding the Anticover of a String.
CPM
Mai Alzamel, Alessio Conte, Shuhei Denzumi, Roberto Grossi, Costas S. Iliopoulos, Kazuhiro Kurita, Kunihiro Wasa
2020 — conf
Fingerprints Recognition System-Based on Mobile Device Identification Using Circular String Pattern Matching Techniques.
AIAI (Workshops)
Miznah H. Alshammary, Costas S. Iliopoulos, Mujibur R. Khan
2020 J jnl
GenMap: ultra-fast computation of genome mappability.
Bioinform.
Christopher Pockrandt, Mai Alzamel, Costas S. Iliopoulos, Knut Reinert
2020 C conf
Internal Quasiperiod Queries.
SPIRE
Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2020 J jnl
Internal Quasiperiod Queries.
CoRR
Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2020 J jnl
Longest property-preserved common factor: A new string-processing framework.
Theor. Comput. Sci.
Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone
2020 J jnl
Preface.
Inf. Comput.
Mai Alzamel, Costas S. Iliopoulos
2020 J jnl
Property Suffix Array with Applications in Indexing Weighted Sequences.
ACM J. Exp. Algorithmics
Panagiotis Charalampopoulos, Costas S. Iliopoulos, Chang Liu, Solon P. Pissis
2020 B conf
Shortest Covers of All Cyclic Shifts of a String.
WALCOM
Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2019 — conf
A Brief Overview of Dead-Zone Pattern Matching Algorithms.
AIAI (Workshops)
Miznah Alshammary, Mai Alzamel, Costas S. Iliopoulos, Richard E. Watson, Bruce W. Watson
2019 B conf
Computing the Antiperiod(s) of a String.
CPM
Hayam Alamro, Golnaz Badkobeh, Djamal Belazzougui, Costas S. Iliopoulos, Simon J. Puglisi
2019 J jnl
Efficient enumeration of non-equivalent squares in partial words with few holes.
J. Comb. Optim.
Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2019 J jnl
Off-line and on-line algorithms for closed string factorization.
Theor. Comput. Sci.
Mai Alzamel, Costas S. Iliopoulos, W. F. Smyth, Wing-Kin Sung
2019 J jnl
On overabundant words and their application to biological sequence analysis.
Theor. Comput. Sci.
Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos
2019 — conf
On the Cyclic Regularities of Strings.
AIAI (Workshops)
Oluwole I. Ajala, Miznah Alshammary, Mai Alzamel, Jia Gao, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Bruce W. Watson
2019 J jnl
On the cyclic regularities of strings.
CoRR
Oluwole I. Ajala, Miznah Alshammary, Mai Alzamel, Jia Gao, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Bruce W. Watson
2019 J jnl
On-line weighted pattern matching.
Inf. Comput.
Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski
2019 C conf
Online Algorithms on Antipowers and Antiperiods.
SPIRE
Mai Alzamel, Alessio Conte, Daniele Greco, Veronica Guerrini, Costas S. Iliopoulos, Nadia Pisanti, Nicola Prezza, Giulia Punzi, Giovanna Rosone
2019 B conf
Quasi-Linear-Time Algorithm for Longest Common Circular Factor.
CPM
Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2019 J jnl
Quasi-Linear-Time Algorithm for Longest Common Circular Factor.
CoRR
Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2018 C ed.
Combinatorial Algorithms - 29th International Workshop, IWOCA 2018, Singapore, July 16-19, 2018, Proceedings
IWOCA
Costas S. Iliopoulos, Hon Wai Leong, Wing-Kin Sung
2018 C conf
Degenerate String Comparison and Applications.
WABI
Mai Alzamel, Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone
2018 J jnl
Efficient Computation of Palindromes in Sequences with Uncertainties.
Fundam. Informaticae
Mai Alzamel, Jia Gao, Costas S. Iliopoulos, Chang Liu
2018 C conf
Efficient Computation of Sequence Mappability.
SPIRE
Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski
2018 J jnl
Efficient Computation of Sequence Mappability.
CoRR
Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski
2018 — conf
Efficient Recognition of Abelian Palindromic Factors and Associated Results.
AIAI (Workshops)
Costas S. Iliopoulos, Steven Watts
2018 — conf
How Much Different Are Two Words with Different Shortest Periods.
AIAI (Workshops)
Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2018 B conf
Linear-Time Algorithm for Long LCF with k Mismatches.
CPM
Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2018 J jnl
Linear-Time Algorithm for Long LCF with k Mismatches.
CoRR
Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2018 C conf
Longest Common Prefixes with k-Errors and Applications.
SPIRE
Lorraine A. K. Ayad, Carl Barton, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis
2018 J jnl
Longest Common Prefixes with k-Errors and Applications.
CoRR
Lorraine A. K. Ayad, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis
2018 B conf
Longest Common Prefixes with k-Mismatches and Applications.
SOFSEM
Hayam Alamro, Lorraine A. K. Ayad, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis
2018 C conf
Longest Property-Preserved Common Factor.
SPIRE
Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone
2018 J jnl
Longest Property-Preserved Common Factor.
CoRR
Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone
2018 C conf
Maximal Motif Discovery in a Sliding Window.
SPIRE
Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Fatima Vayani
2018 J jnl
Preface.
Int. J. Found. Comput. Sci.
Costas S. Iliopoulos, Fatima Vayani
2018 B conf
Property Suffix Array with Applications.
LATIN
Panagiotis Charalampopoulos, Costas S. Iliopoulos, Chang Liu, Solon P. Pissis
2018 — conf
Towards String Sanitization.
AIAI (Workshops)
Oluwole I. Ajala, Hayam Alamro, Costas S. Iliopoulos, Grigorios Loukides
2017 B ed.
16th International Symposium on Experimental Algorithms, SEA 2017, London, UK, June 21-23, 2017
SEA
Costas S. Iliopoulos, Solon P. Pissis, Simon J. Puglisi, Rajeev Raman
2017 J jnl
Covering problems for partial words and for indeterminate strings.
Theor. Comput. Sci.
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2017 C conf
Efficient Computation of Palindromes in Sequences with Uncertainties.
EANN
Mai Alzamel, Jia Gao, Costas S. Iliopoulos, Chang Liu, Solon P. Pissis
2017 Misc conf
Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes.
COCOON
Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2017 C conf
Efficient Identification of k-Closed Strings.
EANN
Hayam Alamro, Mai Alzamel, Costas S. Iliopoulos, Solon P. Pissis, Steven Watts, Wing-Kin Sung
2017 C conf
Efficient Pattern Matching in Elastic-Degenerate Texts.
LATA
Costas S. Iliopoulos, Ritu Kundu, Solon P. Pissis
2017 J jnl
Fast circular dictionary-matching algorithm.
Math. Struct. Comput. Sci.
Tanver Athar, Carl Barton, Widmer Bland, Jia Gao, Costas S. Iliopoulos, Chang Liu, Solon P. Pissis
2017 — conf
Faster Algorithms for 1-Mappability of a Sequence.
COCOA (2)
Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski, Wing-Kin Sung
2017 J jnl
Faster algorithms for 1-mappability of a sequence.
CoRR
Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski, Wing-Kin Sung
2017 J jnl
Foreword.
Math. Comput. Sci.
Costas S. Iliopoulos, Alessio Langiu
2017 C conf
How to Answer a Small Batch of RMQs or LCA Queries in Practice.
IWOCA
Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis
2017 J jnl
How to answer a small batch of RMQs or LCA queries in practice.
CoRR
Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis
2017 — conf
Identification of Fingerprints using Circular String Approximation for Mobile Devices.
FedCSIS (Communication Papers)
Oluwole I. Ajala, Costas S. Iliopoulos, Mujibur R. Khan
2017 C conf
Longest Common Factor After One Edit Operation.
SPIRE
Amihood Amir, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski
2017 J jnl
On avoided words, absent words, and their application to biological sequence analysis.
Algorithms Mol. Biol.
Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos
2017 B conf
On-Line Pattern Matching on Similar Texts.
CPM
Roberto Grossi, Costas S. Iliopoulos, Chang Liu, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Giovanna Rosone, Fatima Vayani, Luca Versari
2017 C conf
Optimal Computation of Overabundant Words.
WABI
Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos
2017 J jnl
Optimal Computation of Overabundant Words.
CoRR
Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos
2017 Misc conf
Palindromic Decompositions with Gaps and Errors.
CSR
Michal Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Jakub Radoszewski
2017 J jnl
Palindromic Decompositions with Gaps and Errors.
CoRR
Michal Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Jakub Radoszewski
2017 C conf
Recent Advances of Palindromic Factorization.
IWOCA
Mai Alzamel, Costas S. Iliopoulos
2017 — ch.
Searching and Indexing Circular Patterns.
Algorithms for Next-Generation Sequencing Data
Costas S. Iliopoulos, Solon P. Pissis, M. Sohel Rahman
2017 J jnl
The longest common substring problem.
Math. Struct. Comput. Sci.
Maxime Crochemore, Costas S. Iliopoulos, Alessio Langiu, Filippo Mignosi
2017 J jnl
Two strings at Hamming distance 1 cannot be both quasiperiodic.
CoRR
Amihood Amir, Costas S. Iliopoulos, Jakub Radoszewski
2017 J jnl
Two strings at Hamming distance 1 cannot be both quasiperiodic.
Inf. Process. Lett.
Amihood Amir, Costas S. Iliopoulos, Jakub Radoszewski
2016 J jnl
Algorithms for Longest Common Abelian Factors.
Int. J. Found. Comput. Sci.
Ali Alatabbi, Costas S. Iliopoulos, Alessio Langiu, M. Sohel Rahman
2016 J jnl
Circular sequence comparison: algorithms and applications.
Algorithms Mol. Biol.
Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Fatima Vayani
2016 J jnl
Closed factorization.
Discret. Appl. Math.
Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto
2016 — conf
Detection Of URL In Image Steganography.
ICC 2016
Moudhi M. Aljamea, Costas S. Iliopoulos, M. Samiruzzaman
2016 — conf
Effective Solutions for Most Common Vulnerabilities in Web Applications.
IntelliSys (2)
Moudhi M. Aljamea, Costas S. Iliopoulos, M. Samiruzzaman
2016 Misc conf
Efficient Computation of Clustered-Clumps in Degenerate Strings.
AIAI
Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed
2016 J jnl
Efficient Pattern Matching in Elastic-Degenerate Strings.
CoRR
Costas S. Iliopoulos, Ritu Kundu, Solon P. Pissis
2016 J jnl
Erratum to: Circular sequence comparison: algorithms and applications.
Algorithms Mol. Biol.
Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Fatima Vayani
2016 — conf
Fast Fingerprint Rotation Recognition Technique Using Circular Strings in Lexicographical Order.
IntelliSys (2)
Oluwole I. Ajala, Moudhi Aljamea, Mai Alzamel, Costas S. Iliopoulos
2016 J jnl
Foreword.
Theor. Comput. Sci.
Costas S. Iliopoulos, Simon J. Puglisi
2016 J jnl
Linear algorithm for conservative degenerate pattern matching.
Eng. Appl. Artif. Intell.
Maxime Crochemore, Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed, Fatima Vayani
2016 J jnl
Linear-time superbubble identification algorithm for genome assembly.
Theor. Comput. Sci.
Ljiljana Brankovic, Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed, Solon P. Pissis, Fatima Vayani
2016 C conf
Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries.
SPIRE
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2016 J jnl
Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries.
CoRR
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2016 C conf
Optimal Computation of Avoided Words.
WABI
Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos
2016 J jnl
Optimal Computation of Avoided Words.
CoRR
Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos
2016 J jnl
Order-preserving indexing.
Theor. Comput. Sci.
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2016 B conf
Popping Superbubbles and Discovering Clumps: Recent Developments in Biological Sequence Analysis.
WALCOM
Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed, Fatima Vayani
2016 J jnl
Quasiperiodicities in Fibonacci strings.
Ars Comb.
Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos
2016 — conf
Smart Meter Data Analysis.
ICC 2016
Moudhi M. Aljamea, Ljiljana Brankovic, Jia Gao, Costas S. Iliopoulos, M. Samiruzzaman
2016 B conf
Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties.
CPM
Costas S. Iliopoulos, Jakub Radoszewski
2015 — conf
A Filter-Based Approach for Approximate Circular Pattern Matching.
ISBRA
Md. Aashikur Rahman Azim, Costas S. Iliopoulos, M. Sohel Rahman, M. Samiruzzaman
2015 J jnl
A note on the longest common compatible prefix problem for partial words.
J. Discrete Algorithms
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
2015 B conf
Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment.
SEA
Carl Barton, Costas S. Iliopoulos, Ritu Kundu, Solon P. Pissis, Ahmad Retha, Fatima Vayani
2015 J jnl
Algorithms for Longest Common Abelian Factors.
CoRR
Ali Alatabbi, Costas S. Iliopoulos, Alessio Langiu, M. Sohel Rahman
2015 J jnl
Antimagicness of Generalized Corona and Snowflake Graphs.
Math. Comput. Sci.
Jacqueline W. Daykin, Costas S. Iliopoulos, Mirka Miller, Oudone Phanalasy
2015 C conf
Average-Case Optimal Approximate Circular String Matching.
LATA
Carl Barton, Costas S. Iliopoulos, Solon P. Pissis
2015 C conf
Circular Sequence Comparison with q-grams.
WABI
Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Fatima Vayani
2015 J jnl
Global and local sequence alignment with a bounded number of gaps.
Theor. Comput. Sci.
Carl Barton, Tomás Flouri, Costas S. Iliopoulos, Solon P. Pissis
2015 J jnl
Linear Algorithm for Conservative Degenerate Pattern Matching.
CoRR
Maxime Crochemore, Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed, Fatima Vayani
2015 J jnl
Linear-Time Superbubble Identification Algorithm.
CoRR
Ljiljana Brankovic, Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed, Solon P. Pissis, Fatima Vayani
2015 — conf
SimpLiSMS: A Simple, Lightweight and Fast Approach for Structured Motifs Searching.
IWBBIO (2)
Ali Alatabbi, Shuhana Azmin, Md. Kawser Habib, Costas S. Iliopoulos, M. Sohel Rahman
2015 C ed.
String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, London, UK, September 1-4, 2015, Proceedings
SPIRE
Costas S. Iliopoulos, Simon J. Puglisi, Emine Yilmaz
2015 B conf
Using Arabic Microblogs Features in Determining Credibility.
ASONAM
Amal Abdullah AlMansour, Costas S. Iliopoulos
2014 — conf
A fast and lightweight filter-based algorithm for circular pattern matching.
BCB
Md. Aashikur Rahman Azim, Costas S. Iliopoulos, Mohammad Sohel Rahman, M. Samiruzzaman
2014 J jnl
Abelian borders in binary words.
Discret. Appl. Math.
Manolis Christodoulakis, Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos
2014 J jnl
Average-Case Optimal Approximate Circular String Matching.
CoRR
Carl Barton, Costas S. Iliopoulos, Solon P. Pissis
2014 Misc conf
Closed Factorization.
PSC
Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto
2014 B conf
Covering Problems for Partial Words and for Indeterminate Strings.
ISAAC
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014 J jnl
Covering Problems for Partial Words and for Indeterminate Strings.
CoRR
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014 — conf
Detection of Web Spambot in the Presence of Decoy Actions.
BDCloud
Vida Ghanaei, Costas S. Iliopoulos, Solon P. Pissis
2014 — conf
Evaluation of credibility assessment for microblogging: models and future directions.
I-KNOW
Amal Abdullah AlMansour, Ljiljana Brankovic, Costas S. Iliopoulos
2014 J jnl
Extending alignments with k-mismatches and ℓ-gaps.
Theor. Comput. Sci.
Carl Barton, Costas S. Iliopoulos, Inbok Lee, Laurent Mouchard, Kunsoo Park, Solon P. Pissis
2014 J jnl
Extracting powers and periods in a word from its runs structure.
Theor. Comput. Sci.
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014 J jnl
Fast algorithms for approximate circular string matching.
Algorithms Mol. Biol.
Carl Barton, Costas S. Iliopoulos, Solon P. Pissis
2014 C conf
Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance.
IWOCA
Carl Barton, Costas S. Iliopoulos, Solon P. Pissis, William F. Smyth
2014 J jnl
New simple efficient algorithms computing powers and runs in strings.
Discret. Appl. Math.
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Krzysztof Stencel, Tomasz Walen
2014 J jnl
On the Average-case Complexity of Pattern Matching with Wildcards.
CoRR
Carl Barton, Costas S. Iliopoulos
2014 J jnl
On the average number of regularities in a word.
Theor. Comput. Sci.
Manolis Christodoulakis, Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos
2014 — conf
On-line Minimum Closed Covers.
AIAI (Workshops)
Costas S. Iliopoulos, Manal Mohamed
2014 J jnl
Optimal computation of all tandem repeats in a weighted sequence.
Algorithms Mol. Biol.
Carl Barton, Costas S. Iliopoulos, Solon P. Pissis
2014 J jnl
Order-preserving matching.
Theor. Comput. Sci.
Jinil Kim, Peter Eades, Rudolf Fleischer, Seok-Hee Hong, Costas S. Iliopoulos, Kunsoo Park, Simon J. Puglisi, Takeshi Tokuyama
2014 — ed.
Proceedings of the 2nd International Conference on Algorithms for Big Data , Palermo, Italy, April 07-09, 2014.
ICABD
Costas S. Iliopoulos, Alessio Langiu
2014 J jnl
The swap matching problem revisited.
Theor. Comput. Sci.
Pritom Ahmed, Costas S. Iliopoulos, A. S. M. Sohidull Islam, Mohammad Sohel Rahman
2013 J jnl
A Note on the Longest Common Compatible Prefix Problem for Partial Words.
CoRR
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
2013 J jnl
A note on efficient computation of all Abelian periods in a string.
Inf. Process. Lett.
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen
2013 J jnl
Bipartite Ramsey numbers involving stars, stripes and trees.
Electron. J. Graph Theory Appl.
Michalis Christou, Costas S. Iliopoulos, Mirka Miller
2013 J jnl
Computing the Longest Previous Factor.
Eur. J. Comb.
Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen
2013 J jnl
Efficient seed computation revisited.
Theor. Comput. Sci.
Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
2013 J jnl
Enhanced string covering.
Theor. Comput. Sci.
Tomás Flouri, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Simon J. Puglisi, W. F. Smyth, Wojciech Tyczynski
2013 — conf
GapsMis: flexible sequence alignment with a bounded number of gaps.
BCB
Carl Barton, Tomás Flouri, Costas S. Iliopoulos, Solon P. Pissis
2013 — conf
Generic Algorithms for Factoring Strings.
Information Theory, Combinatorics, and Search Theory
David E. Daykin, Jacqueline W. Daykin, Costas S. Iliopoulos, W. F. Smyth
2013 — conf
Identification of All Exact and Approximate Inverted Repeats in Regular and Weighted Sequences.
EANN (2)
Carl Barton, Costas S. Iliopoulos, Nicola J. Mulder, Bruce W. Watson
2013 J jnl
Locating tandem repeats in weighted sequences in proteins.
BMC Bioinform.
Hui Zhang, Qing Guo, Costas S. Iliopoulos
2013 Misc conf
Maximal Palindromic Factorization.
PSC
Ali Alatabbi, Costas S. Iliopoulos, Mohammad Sohel Rahman
2013 J jnl
Order Preserving Matching
CoRR
Jinil Kim, Peter Eades, Rudolf Fleischer, Seok-Hee Hong, Costas S. Iliopoulos, Kunsoo Park, Simon J. Puglisi, Takeshi Tokuyama
2013 C conf
Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes.
SPIRE
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2013 J jnl
Order-Preserving Suffix Trees and Their Algorithmic Applications
CoRR
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2013 J jnl
Overlapping factors in words.
Australas. J Comb.
Manolis Christodoulakis, Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos
2013 J jnl
Querying highly similar sequences.
Int. J. Comput. Biol. Drug Des.
Carl Barton, Mathieu Giraud, Costas S. Iliopoulos, Thierry Lecroq, Laurent Mouchard, Solon P. Pissis
2013 J jnl
Suffix Tree of Alignment: An Efficient Index for Similar Data
CoRR
Joong Chae Na, Heejin Park, Maxime Crochemore, Jan Holub, Costas S. Iliopoulos, Laurent Mouchard, Kunsoo Park
2013 C conf
Suffix Tree of Alignment: An Efficient Index for Similar Data.
IWOCA
Joong Chae Na, Heejin Park, Maxime Crochemore, Jan Holub, Costas S. Iliopoulos, Laurent Mouchard, Kunsoo Park
2013 J jnl
The Swap Matching Problem Revisited.
CoRR
Pritom Ahmed, Costas S. Iliopoulos, A. S. M. Sohidull Islam, M. Sohel Rahman
2013 J jnl
Tree template matching in unranked ordered trees.
J. Discrete Algorithms
Michalis Christou, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis, Jan Zdárek
2012 J jnl
A Note on Efficient Computation of All Abelian Periods in a String
CoRR
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen
2012 J jnl
An algorithm for mapping short reads to a dynamically changing genomic sequence.
J. Discrete Algorithms
Costas S. Iliopoulos, Derrick G. Kourie, Laurent Mouchard, Themba K. Musombuka, Solon P. Pissis, Corné de Ridder
2012 J jnl
Computing all subtree repeats in ordered trees.
Inf. Process. Lett.
Michalis Christou, Maxime Crochemore, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis
2012 — conf
Computing the Minimum λ-Cover in Weighted Sequences.
ICIC (1)
Hui Zhang, Qing Guo, Costas S. Iliopoulos
2012 — conf
Conceptualization and Significance Study of a New Appliation CS-MIR.
AIAI (1)
Kaichun K. Chang, Carl Barton, Costas S. Iliopoulos, Jyh-Shing Roger Jang
2012 — conf
Detection of fixed length web spambot using REAL (read aligner).
CUBE
Mourad Elloumi, Pedram Hayati, Costas S. Iliopoulos, Solon P. Pissis, Arfaat Shah
2012 J jnl
Editorial.
J. Discrete Algorithms
Costas S. Iliopoulos, William F. Smyth
2012 J jnl
Editorial.
J. Discrete Algorithms
Costas S. Iliopoulos, William F. Smyth
2012 J jnl
Efficient algorithms for three variants of the LPF table.
J. Discrete Algorithms
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen
2012 J jnl
Exact and approximate rhythm matching algorithms.
Int. J. Digit. Libr.
Joseph Wun-Tat Chan, Costas S. Iliopoulos, Spiros Michalakopoulos, M. Sohel Rahman
2012 — conf
GapMis-OMP: Pairwise Short-Read Alignment on Multi-core Architectures.
AIAI (2)
Tomás Flouri, Costas S. Iliopoulos, Kunsoo Park, Solon P. Pissis
2012 J jnl
Identifying All Abelian Periods of a String in quadratic Time and Relevant Problems.
Int. J. Found. Comput. Sci.
Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos
2012 J jnl
Identifying all abelian periods of a string in quadratic time and relevant problems
CoRR
Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos
2012 J jnl
Improved algorithms for the range next value problem and applications.
Theor. Comput. Sci.
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, German Tischler, Tomasz Walen
2012 — conf
Locating Tandem Repeats in Weighted Biological Sequences.
ICIC (3)
Hui Zhang, Qing Guo, Costas S. Iliopoulos
2012 — conf
Melodic String Matching via Interval Consolidation and Fragmentation.
AIAI (2)
Carl Barton, Emilios Cambouropoulos, Costas S. Iliopoulos, Zsuzsanna Lipták
2012 Misc conf
New and Efficient Approaches to the Quasiperiodic Characterisation of a String.
PSC
Tomás Flouri, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Simon J. Puglisi, William F. Smyth, Wojciech Tyczynski
2012 J jnl
On left and right seeds of a string.
J. Discrete Algorithms
Michalis Christou, Maxime Crochemore, Ondrej Guth, Costas S. Iliopoulos, Solon P. Pissis
2012 — conf
On the repetitive collection indexing problem.
BIBM Workshops
Ali Alatabbi, Carl Barton, Costas S. Iliopoulos
2012 — conf
Overlapping repetitions in weighted sequence.
CUBE
Ali Alatabbi, Maxime Crochemore, Costas S. Iliopoulos, Tewogboye A. Okanlawon
2012 J jnl
Parallel Algorithms for Mapping Short degenerate and Weighted DNA Sequences to a Reference genome.
Int. J. Found. Comput. Sci.
Costas S. Iliopoulos, Mirka Miller, Solon P. Pissis
2012 J jnl
Quasiperiodicities in Fibonacci strings
CoRR
Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos
2012 — conf
Querying Highly Similar Structured Sequences via Binary Encoding and Word Level Operations.
AIAI (2)
Ali Alatabbi, Carl Barton, Costas S. Iliopoulos, Laurent Mouchard
2012 B conf
The Maximum Number of Squares in a Tree.
CPM
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen
2012 J jnl
The maximal number of cubic runs in a word.
J. Comput. Syst. Sci.
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2012 J jnl
Tree template matching in ranked ordered trees by pushdown automata.
J. Discrete Algorithms
Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis
2011 — conf
Approximate string-matching with a single gap for sequence alignment.
BCB
Tomás Flouri, Kunsoo Park, Kimon Frousios, Solon P. Pissis, Costas S. Iliopoulos, German Tischler
2011 C ed.
Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers
IWOCA
Costas S. Iliopoulos, William F. Smyth
2011 C ed.
Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers
IWOCA
Costas S. Iliopoulos, William F. Smyth
2011 C conf
Computing All Subtree Repeats in Ordered Ranked Trees.
SPIRE
Michalis Christou, Maxime Crochemore, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis
2011 J jnl
Construction of Antimagic Labeling for the Cartesian Product of Regular Graphs.
Math. Comput. Sci.
Oudone Phanalasy, Mirka Miller, Costas S. Iliopoulos, Solon P. Pissis, Elaheh Vaezpour
2011 — conf
DynMap: mapping short reads to multiple related genomes.
BCB
Tomás Flouri, Costas S. Iliopoulos, Solon P. Pissis
2011 J jnl
Efficient Seeds Computation Revisited
CoRR
Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
2011 B conf
Efficient Seeds Computation Revisited.
CPM
Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
2011 J jnl
New complexity results for the k-covers problem.
Inf. Sci.
Costas S. Iliopoulos, Manal Mohamed, William F. Smyth
2011 Misc conf
On the Right-Seed Array of a String.
COCOON
Michalis Christou, Maxime Crochemore, Ondrej Guth, Costas S. Iliopoulos, Solon P. Pissis
2011 C conf
Tree Indexing by Pushdown Automata and Repeats of Subtrees.
FedCSIS
Tomás Flouri, Jan Janousek, Borivoj Melichar, Costas S. Iliopoulos, Solon P. Pissis
2011 C conf
Tree Template Matching in Ranked Ordered Trees by Pushdown Automata.
CIAA
Tomás Flouri, Jan Janousek, Borivoj Melichar, Costas S. Iliopoulos, Solon P. Pissis
2010 J jnl
A Note on a priori Estimations of Classification Circuit Complexity.
Fundam. Informaticae
Andreas Alexander Albrecht, Alexander V. Chaskin, Costas S. Iliopoulos, Oktay M. Kasim-Zade, Georgios Lappas, Kathleen Steinhöfel
2010 — conf
A Parallel Algorithm for Fixed-Length Approximate String-Matching with
Algorithms and Applications
Maxime Crochemore, Costas S. Iliopoulos, Solon P. Pissis
2010 B conf
Algorithms for Three Versions of the Shortest Common Superstring Problem.
CPM
Maxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2010 C conf
An Algorithmic Framework for Motif Discovery Problems in Weighted Sequences.
CIAC
Hui Zhang, Qing Guo, Costas S. Iliopoulos
2010 — conf
An algorithm for mapping short reads to a dynamically changing genomic sequence.
BIBM
Tomás Flouri, Jan Holub, Costas S. Iliopoulos, Solon P. Pissis
2010 — conf
Combinatorial Detection of Arrhythmia.
BIOSIGNALS
Julien Allali, Pascal Ferraro, Costas S. Iliopoulos, Spiros Michalakopoulos
2010 — conf
Combinatorial ECG analysis for mobile devices.
Multimedia Information Retrieval
Costas S. Iliopoulos, Spiros Michalakopoulos
2010 B conf
Cover Array String Reconstruction.
CPM
Maxime Crochemore, Costas S. Iliopoulos, Solon P. Pissis, German Tischler
2010 B conf
Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays.
SOFSEM
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen
2010 C conf
Extracting Powers and Periods in a String from Its Runs Structure.
SPIRE
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2010 J jnl
Finding Patterns In Given Intervals.
Fundam. Informaticae
Maxime Crochemore, Marcin Kubica, Tomasz Walen, Costas S. Iliopoulos, M. Sohel Rahman
2010 J jnl
Finite automata based algorithms on subsequences and supersequences of degenerate strings.
J. Discrete Algorithms
Costas S. Iliopoulos, M. Sohel Rahman, Michal Vorácek, Ladislav Vagner
2010 J jnl
Foreword.
Math. Comput. Sci.
Manolis Christodoulakis, Costas S. Iliopoulos
2010 — conf
Music Genre Classification via Compressive Sampling.
ISMIR
Kaichun K. Chang, Jyh-Shing Roger Jang, Costas S. Iliopoulos
2010 Misc conf
New Simple Efficient Algorithms Computing Powers and Runs in Strings.
PSC
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Krzysztof Stencel, Tomasz Walen
2010 J jnl
Number of Occurrences of powers in Strings.
Int. J. Found. Comput. Sci.
Maxime Crochemore, Szilárd Zsolt Fazekas, Costas S. Iliopoulos, Inuka Jayasekera
2010 C conf
On the Maximal Number of Cubic Runs in a String.
LATA
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2010 — conf
REAL: an efficient REad ALigner for next generation sequencing reads.
BCB
Kimon Frousios, Costas S. Iliopoulos, Laurent Mouchard, Solon P. Pissis, German Tischler
2010 C conf
Varieties of Regularities in Weighted Sequences.
AAIM
Hui Zhang, Qing Guo, Costas S. Iliopoulos
2009 J jnl
A New Efficient Algorithm for Computing the Longest Common Subsequence.
Theory Comput. Syst.
Costas S. Iliopoulos, Mohammad Sohel Rahman
2009 — conf
A Parallel Algorithm for the Fixed-length Approximate String Matching Problem for High Throughput Sequencing Technologies.
PARCO
Costas S. Iliopoulos, Laurent Mouchard, Solon P. Pissis
2009 J jnl
Algorithms for mapping short degenerate and weighted sequences to a reference genome.
Int. J. Comput. Biol. Drug Des.
Pavlos Antoniou, Costas S. Iliopoulos, Laurent Mouchard, Solon P. Pissis
2009 J jnl
Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences.
Fundam. Informaticae
Costas S. Iliopoulos, William F. Smyth, Munina Yusufu
2009 J jnl
Foreword: Special issue in honor of the 60th birthday of Prof. Maxime Crochemore.
Theor. Comput. Sci.
Costas S. Iliopoulos, Wojciech Rytter
2009 J jnl
Indexing Factors with Gaps.
Algorithmica
Costas S. Iliopoulos, M. Sohel Rahman
2009 C conf
LPF Computation Revisited.
IWOCA
Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen
2009 J jnl
On the maximal number of highly periodic runs in a string
CoRR
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2009 Misc conf
Parallel Algorithms for Degenerate and Weighted Sequences Derived from High Throughput Sequencing Technologies.
PSC
Costas S. Iliopoulos, Mirka Miller, Solon P. Pissis
2009 — conf
Practical and Efficient Algorithms for Degenerate and Weighted Sequences Derived from High Throughput Sequencing Technologies.
IJCBS
Pavlos Antoniou, Costas S. Iliopoulos, Laurent Mouchard, Solon P. Pissis
2009 J jnl
Toward a General Framework for Polyphonic Comparison.
Fundam. Informaticae
Julien Allali, Pascal Ferraro, Pierre Hanna, Costas S. Iliopoulos, Matthias Robine
2009 Misc conf
Validation and Decomposition of Partially Occluded Images with Holes.
PSC
Julien Allali, Pavlos Antoniou, Costas S. Iliopoulos, Pascal Ferraro, Manal Mohamed
2008 J jnl
A New Approach to Pattern Matching in Degenerate DNA/RNA Sequences and Distributed Pattern Matching.
Math. Comput. Sci.
Costas S. Iliopoulos, Laurent Mouchard, Mohammad Sohel Rahman
2008 B conf
A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns.
SOFSEM
Costas S. Iliopoulos, M. Sohel Rahman
2008 J jnl
Algorithms for Computing the lambda-regularities in Strings.
Fundam. Informaticae
Hui Zhang, Qing Guo, Costas S. Iliopoulos
2008 J jnl
Algorithms for computing variants of the longest common subsequence problem.
Theor. Comput. Sci.
Costas S. Iliopoulos, M. Sohel Rahman
2008 C conf
Bounds on Powers in Strings.
Developments in Language Theory
Maxime Crochemore, Szilárd Zsolt Fazekas, Costas S. Iliopoulos, Inuka Jayasekera
2008 Misc conf
Conservative String Covering of Indeterminate Strings.
PSC
Pavlos Antoniou, Maxime Crochemore, Costas S. Iliopoulos, Inuka Jayasekera, Gad M. Landau
2008 J jnl
External Memory Algorithms for String Problems.
Fundam. Informaticae
Kangho Roh, Maxime Crochemore, Costas S. Iliopoulos, Kunsoo Park
2008 J jnl
Faster index for property matching.
Inf. Process. Lett.
Costas S. Iliopoulos, Mohammad Sohel Rahman
2008 J jnl
Generalized approximate regularities in strings.
Int. J. Comput. Math.
Hui Zhang, Qing Guo, Costas S. Iliopoulos
2008 J jnl
Identifying Rhythms in Musical Texts.
Int. J. Found. Comput. Sci.
Manolis Christodoulakis, Costas S. Iliopoulos, Mohammad Sohel Rahman, William F. Smyth
2008 — conf
Implementation of a Swap Matching Algorithm Using a Graph Theoretic Model.
BIRD
Pavlos Antoniou, Costas S. Iliopoulos, Inuka Jayasekera, M. Sohel Rahman
2008 A conf
Improved Algorithms for the Range Next Value Problem and Applications.
STACS
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Mohammad Sohel Rahman, Tomasz Walen
2008 B conf
Indexing Circular Patterns.
WALCOM
Costas S. Iliopoulos, M. Sohel Rahman
2008 — conf
Indexing Factors in DNA/RNA Sequences.
BIRD
Tomás Flouri, Costas S. Iliopoulos, Mohammad Sohel Rahman, Ladislav Vagner, Michal Vorácek
2008 J jnl
New efficient algorithms for the LCS and constrained LCS problems.
Inf. Process. Lett.
Costas S. Iliopoulos, Mohammad Sohel Rahman
2008 J jnl
Optimal prefix and suffix queries on texts.
Inf. Process. Lett.
Maxime Crochemore, Costas S. Iliopoulos, Mohammad Sohel Rahman
2008 J jnl
Property matching and weighted matching.
Theor. Comput. Sci.
Amihood Amir, Eran Chencinski, Costas S. Iliopoulos, Tsvi Kopelowitz, Hui Zhang
2008 J jnl
Special Issue of the Sixteenth Australasian Workshop on Combinatorial Algorithms (AWOCA 2005) September 18-21, 2005, Ballarat, Australia.
J. Discrete Algorithms
Costas S. Iliopoulos, Mirka Miller
2007 C conf
A New Efficient Algorithm for Computing the Longest Common Subsequence.
AAIM
M. Sohel Rahman, Costas S. Iliopoulos
2007 B conf
Algorithms for Computing the Longest Parameterized Common Subsequence.
CPM
Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, Tomasz Walen
2007 J jnl
Algorithms for extracting motifs from biological weighted sequences.
J. Discrete Algorithms
Costas S. Iliopoulos, Katerina Perdikuri, Evangelos Theodoridis, Athanasios K. Tsakalidis, Kostas Tsichlas
2007 J jnl
All maximal-pairs in step-leap representation of melodic sequence.
Inf. Sci.
Emilios Cambouropoulos, Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot
2007 C conf
Application of suffix trees for the acquisition of common motifs with gaps in a set of strings.
LATA
Pavlos Antoniou, Maxime Crochemore, Costas S. Iliopoulos, Pierre Peterlongo
2007 J jnl
Computing the lambda-covers of a string.
Inf. Sci.
Qing Guo, Hui Zhang, Costas S. Iliopoulos
2007 J jnl
Efficient Algorithms for Counting and Reporting Segregating Sites in Genomic Sequences.
J. Comput. Biol.
Manolis Christodoulakis, Geoffrey Brian Golding, Costas S. Iliopoulos, Yoan José Pinzón Ardila, William F. Smyth
2007 B conf
Finding Patterns in Given Intervals.
MFCS
Maxime Crochemore, Costas S. Iliopoulos, M. Sohel Rahman
2007 — conf
Indexing Factors with Gaps.
SOFSEM (1)
M. Sohel Rahman, Costas S. Iliopoulos
2007 J jnl
Linear time algorithm for the longest common repeat problem.
J. Discrete Algorithms
Inbok Lee, Costas S. Iliopoulos, Kunsoo Park
2007 C conf
Local Transpositions in Alignment of Polyphonic Musical Sequences.
SPIRE
Julien Allali, Pascal Ferraro, Pierre Hanna, Costas S. Iliopoulos
2007 J jnl
Locating Maximal Multirepeats in Multiple Strings Under Various Constraints.
Comput. J.
A. Bakalis, Costas S. Iliopoulos, Christos Makris, Spyros Sioutas, Evangelos Theodoridis, Athanasios K. Tsakalidis, Kostas Tsichlas
2007 — conf
Pattern Matching Algorithms with Don't Cares.
SOFSEM (2)
M. Sohel Rahman, Costas S. Iliopoulos
2007 B conf
Pattern Matching in Degenerate DNA/RNA Sequences.
WALCOM
M. Sohel Rahman, Costas S. Iliopoulos, Laurent Mouchard
2007 C conf
The Constrained Longest Common Subsequence Problem for Degenerate Strings.
CIAA
Costas S. Iliopoulos, M. Sohel Rahman, Michal Vorácek, Ladislav Vagner
2007 — conf
Transformation of Suffix Arrays into Suffix Trees on the MPI Environment.
RSFDGrC
Inbok Lee, Costas S. Iliopoulos, Syng-Yup Ohn
2007 C conf
Weighted Degenerated Approximate Pattern Matching.
LATA
Costas S. Iliopoulos, Inuka Jayasekera, Borivoj Melichar, Jan Supol
2006 B conf
Algorithms for Computing Variants of the Longest Common Subsequence Problem.
ISAAC
M. Sohel Rahman, Costas S. Iliopoulos
2006 B conf
Approximate Matching in Weighted Sequences.
CPM
Amihood Amir, Costas S. Iliopoulos, Oren Kapah, Ely Porat
2006 J jnl
Computation of Repetitions and Regularities of Biologically Weighted Sequences.
J. Comput. Biol.
Manolis Christodoulakis, Costas S. Iliopoulos, Laurent Mouchard, Katerina Perdikuri, Athanasios K. Tsakalidis, Kostas Tsichlas
2006 C conf
Computing the
AAIM
Qing Guo, Hui Zhang, Costas S. Iliopoulos
2006 C conf
Computing the Minimum Approximate
SPIRE
Qing Guo, Hui Zhang, Costas S. Iliopoulos
2006 C conf
Finding Common Motifs with Gaps Using Finite Automata.
CIAA
Pavlos Antoniou, Jan Holub, Costas S. Iliopoulos, Borivoj Melichar, Pierre Peterlongo
2006 Misc conf
Finding Patterns with Variable Length Gaps or Don't Cares.
COCOON
M. Sohel Rahman, Costas S. Iliopoulos, Inbok Lee, Manal Mohamed, William F. Smyth
2006 J jnl
Longest repeats with a block of
Theor. Comput. Sci.
Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot
2006 B conf
Property Matching and Weighted Matching.
CPM
Amihood Amir, Eran Chencinski, Costas S. Iliopoulos, Tsvi Kopelowitz, Hui Zhang
2006 B conf
Simple Algorithm for Sorting the Fibonacci String Rotations.
SOFSEM
Manolis Christodoulakis, Costas S. Iliopoulos, Yoan José Pinzón Ardila
2006 Misc conf
Song classifications for dancing.
PSC
Manolis Christodoulakis, Costas S. Iliopoulos, Mohammad Sohel Rahman, William F. Smyth
2006 J jnl
The Weighted Suffix Tree: An Efficient Data Structure for Handling Molecular Weighted Sequences and its Applications.
Fundam. Informaticae
Costas S. Iliopoulos, Christos Makris, Yannis Panagis, Katerina Perdikuri, Evangelos Theodoridis, Athanasios K. Tsakalidis
2005 — conf
A Pattern Extraction Algorithm for Abstract Melodic Representations that Allow Partial Overlapping of Intervallic Categories.
ISMIR
Emilios Cambouropoulos, Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot
2005 J jnl
A first approach to finding common motifs with gaps.
Int. J. Found. Comput. Sci.
Costas S. Iliopoulos, James A. M. McHugh, Pierre Peterlongo, Nadia Pisanti, Wojciech Rytter, Marie-France Sagot
2005 J jnl
Approximate Seeds of Strings.
J. Autom. Lang. Comb.
Manolis Christodoulakis, Costas S. Iliopoulos, Kunsoo Park, Jeong Seop Sim
2005 Misc conf
Approximation algorithm for the cyclic swap problem.
PSC
Yoan José Pinzón Ardila, Costas S. Iliopoulos, Gad M. Landau, Manal Mohamed
2005 J jnl
Bit-parallel (
J. Discrete Algorithms
Maxime Crochemore, Costas S. Iliopoulos, Gonzalo Navarro, Yoan J. Pinzón, Alejandro Salinger
2005 J jnl
Computing the Repetitions in a Biological Weighted Sequence.
J. Autom. Lang. Comb.
Costas S. Iliopoulos, Laurent Mouchard, Katerina Perdikuri, Athanasios K. Tsakalidis
2005 B conf
Faster Algorithms for delta, gamma-Matching and Related Problems.
CPM
Peter Clifford, Raphaël Clifford, Costas S. Iliopoulos
2005 J jnl
Implementing approximate regularities.
Math. Comput. Model.
Manolis Christodoulakis, Costas S. Iliopoulos, Kunsoo Park, Jeong Seop Sim
2005 — conf
Markov Random Fields and Maximum Entropy Modeling for Music Information Retrieval.
ISMIR
Jeremy Pickens, Costas S. Iliopoulos
2005 J jnl
The Complexity of the Minimum k-Cover Problem.
J. Autom. Lang. Comb.
Richard Cole, Costas S. Iliopoulos, Manal Mohamed, William F. Smyth, Lu Yang
2004 Misc conf
A First Approach to Finding Common Motifs With Gaps.
PSC
Costas S. Iliopoulos, James A. M. McHugh, Pierre Peterlongo, Nadia Pisanti, Wojciech Rytter, Marie-France Sagot
2004 J jnl
Approximate string matching for music analysis.
Soft Comput.
Raphaël Clifford, Costas S. Iliopoulos
2004 — conf
Efficient Algorithms for Handling Molecular Weighted Sequences.
IFIP TCS
Costas S. Iliopoulos, Christos Makris, Yannis Panagis, Katerina Perdikuri, Evangelos Theodoridis, Athanasios K. Tsakalidis
2004 C conf
Linear Time Algorithm for the Longest Common Repeat Problem.
SPIRE
Inbok Lee, Costas S. Iliopoulos, Kunsoo Park
2004 B conf
Longest Repeats with a Block of Don't Cares.
LATIN
Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot
2004 C conf
Motif Extraction from Weighted Sequences.
SPIRE
Costas S. Iliopoulos, Katerina Perdikuri, Evangelos Theodoridis, Athanasios K. Tsakalidis, Kostas Tsichlas
2004 — book
String Algorithmics.
Costas S. Iliopoulos, Thierry Lecroq
2004 C conf
String Matching with Swaps in a Weighted Sequence.
CIS
Hui Zhang, Qing Guo, Costas S. Iliopoulos
2003 C conf
A Bit-Parallel Suffix Automation Approach for (delta, gamma)-Matching in Music Retrieval.
SPIRE
Maxime Crochemore, Costas S. Iliopoulos, Gonzalo Navarro, Yoan J. Pinzón
2003 Misc conf
Approximate Seeds of Strings.
PSC
Manolis Christodoulakis, Costas S. Iliopoulos, Kunsoo Park, Jeong Seop Sim
2003 Misc conf
Computing the Minimum k-Cover of a String.
PSC
Richard Cole, Costas S. Iliopoulos, Manal Mohamed, William F. Smyth, Lu Yang
2003 Misc conf
Computing the Repetitions in a Weighted Sequence.
PSC
Costas S. Iliopoulos, Laurent Mouchard, Katerina Perdikuri, Athanasios K. Tsakalidis
2003 J jnl
Editorial.
J. Autom. Lang. Comb.
Diane M. Donovan, Costas S. Iliopoulos, Mirka Miller
2003 J jnl
Occurrence and Substring Heuristics for i-Matching.
Fundam. Informaticae
Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq
2003 J jnl
On special families of morphisms related to [delta]-matching and don't care symbols.
Inf. Process. Lett.
Richard Cole, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
2003 J jnl
Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms.
Fundam. Informaticae
Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón
2003 J jnl
String Regularities with Don't Cares.
Nord. J. Comput.
Costas S. Iliopoulos, Manal Mohamed, Laurent Mouchard, Katerina Perdikuri, William F. Smyth, Athanasios K. Tsakalidis
2003 J jnl
Truncated suffix trees and their application to data compression.
Theor. Comput. Sci.
Joong Chae Na, Alberto Apostolico, Costas S. Iliopoulos, Kunsoo Park
2002 J jnl
Algorithms for Computing Approximate Repetitions in Musical Sequences.
Int. J. Comput. Math.
Emilios Cambouropoulos, Maxime Crochemore, Costas S. Iliopoulos, Laurent Mouchard, Yoan J. Pinzón
2002 J jnl
Approximate String Matching with Gaps.
Nord. J. Comput.
Maxime Crochemore, Costas S. Iliopoulos, Christos Makris, Wojciech Rytter, Athanasios K. Tsakalidis, Kostas Tsichlas
2002 B conf
Identifying Occurrences of Maximal Pairs in Multiple Strings.
CPM
Costas S. Iliopoulos, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas
2002 J jnl
On-Line Analysis and Validation of Partially Occluded Images: Implementation and Practice.
Int. J. Comput. Math.
Aspassia Daskalopulu, Costas S. Iliopoulos, Manal Mohamed
2002 J jnl
Recovering an LCS in O(n
Rev. Colomb. de Computación
Costas S. Iliopoulos, Yoan J. Pinzón
2002 Misc conf
String Matching with Gaps for Musical Melodic Recognition.
PSC
Costas S. Iliopoulos, Masahiro Kurokawa
2002 Misc conf
String Regularities with Don't Cares.
PSC
Costas S. Iliopoulos, Manal Mohamed, Laurent Mouchard, Katerina Perdikuri, William F. Smyth, Athanasios K. Tsakalidis
2002 B conf
Three Heuristics for delta-Matching: delta-BM Algorithms.
CPM
Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
2002 B conf
Validation and Decomposition of Partially Occluded Images.
SOFSEM
Costas S. Iliopoulos, Manal Mohamed
2001 J jnl
A fast and practical bit-vector algorithm for the Longest Common Subsequence problem.
Inf. Process. Lett.
Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón, James F. Reid
2001 J jnl
Approximate Musical Evolution.
Comput. Humanit.
Tim Crawford, Costas S. Iliopoulos, Russel L. Winder, Haifeng Yu
2001 Misc conf
Approximate String Matching in Musical Sequences.
PSC
Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Yoan J. Pinzón
2001 J jnl
Approximate periods of strings.
Theor. Comput. Sci.
Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth
2001 J jnl
Computing Evolutionary Chains in Musical Sequences.
Electron. J. Comb.
Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón
2001 J jnl
Decomposition of Partially Occluded Strings in the Presence of Errors.
Int. J. Pattern Recognit. Artif. Intell.
Costas S. Iliopoulos, James F. Reid
2001 J jnl
Distributed Pattern Matching Using Finite Automata.
J. Autom. Lang. Comb.
Jan Holub, Costas S. Iliopoulos, Borivoj Melichar, Laurent Mouchard
2001 J jnl
On-Line Validation and Analysis of Partially Occluded Images.
J. Autom. Lang. Comb.
Costas S. Iliopoulos, Jamie Simpson
2001 J jnl
Pattern Processing in Melodic Sequences: Challenges, Caveats and Prospects.
Comput. Humanit.
Emilios Cambouropoulos, Tim Crawford, Costas S. Iliopoulos
2001 C conf
Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms.
SPIRE
Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón
2001 — conf
The Max-Shift Algorithm for Approximate String Matching.
WAE
Costas S. Iliopoulos, Laurent Mouchard, Yoan J. Pinzón
2000 J jnl
Combinatorial Algorithms - Preface.
Theor. Comput. Sci.
Costas S. Iliopoulos
2000 — conf
Computing Approximate Repetitions in Musical Sequences.
PSCW
Costas S. Iliopoulos, Thierry Lecroq, Laurent Mouchard, Yoan J. Pinzón
2000 B conf
Fast Evolutionary Chains.
SOFSEM
Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón
2000 — conf
Finding Motifs with Gaps.
ISMIR
Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón
2000 J jnl
Optimal parallel analysis and decomposition of partially occluded strings.
Parallel Comput.
Costas S. Iliopoulos, James F. Reid
1999 B conf
Approximate Periods of Strings.
CPM
Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth
1999 J jnl
Quasiperiodicity and String Covering.
Theor. Comput. Sci.
Costas S. Iliopoulos, Laurent Mouchard
1999 J jnl
Quasiperiodicity: From Detection to Normal Forms.
J. Autom. Lang. Comb.
Costas S. Iliopoulos, Laurent Mouchard
1998 B conf
Massively Parallel Suffix Array Construction.
SOFSEM
Costas S. Iliopoulos, Maureen Korda
1998 J jnl
Two-Dimensional Prefix String Matching and Covering on Square Matrices.
Algorithmica
Maxime Crochemore, Costas S. Iliopoulos, Maureen Korda
1998 — conf
Validating and Decomposing Partially Occluded Two-Dimensional Images (Extended Abstract).
PSCW
Costas S. Iliopoulos, James F. Reid
1997 J jnl
A Characterization of the Squares in a Fibonacci String.
Theor. Comput. Sci.
Costas S. Iliopoulos, Dennis W. G. Moore, William F. Smyth
1996 J jnl
A Pram Algorithm for a Special Case of the Set Partition Problem.
Parallel Algorithms Appl.
Clive N. Galley, Costas S. Iliopoulos
1996 J jnl
A Work-Time Optimal Algorithm for Computing All String Covers.
Theor. Comput. Sci.
Costas S. Iliopoulos, Kunsoo Park
1996 J jnl
Covering a String.
Algorithmica
Costas S. Iliopoulos, Dennis W. G. Moore, Kunsoo Park
1996 J jnl
On the lower bound for parallel string matching.
Int. J. Comput. Math.
Clive N. Galley, Costas S. Iliopoulos
1996 J jnl
Optimal Parallel Superprimitivity Testing for Square Arrays.
Parallel Process. Lett.
Costas S. Iliopoulos, Maureen Korda
1995 J jnl
A fast average case algorithm for lyndon decomposition.
Int. J. Comput. Math.
Costas S. Iliopoulos, William F. Smyth
1995 J jnl
The Subtree Max Gap Problem with Application to Parallel String Covering.
Inf. Comput.
Omer Berkman, Costas S. Iliopoulos, Kunsoo Park
1994 J jnl
A Simple Parallel Algorithm for the Single Function Coarsest Partition Problem.
Parallel Process. Lett.
Clive N. Galley, Costas S. Iliopoulos
1994 J jnl
Parallel RAM Algorithms for Factorizing Words.
Theor. Comput. Sci.
Jacqueline W. Daykin, Costas S. Iliopoulos, William F. Smyth
1994 A* conf
The Subtree Max Gap Problem with Application to Parallel String Covering.
SODA
Amir M. Ben-Amram, Omer Berkman, Costas S. Iliopoulos, Kunsoo Park
1993 B conf
Covering a String.
CPM
Costas S. Iliopoulos, Dennis W. G. Moore, Kunsoo Park
1992 J jnl
Optimal Algorithms for Computing the canonical form of a circular string.
Theor. Comput. Sci.
Costas S. Iliopoulos, William F. Smyth
1991 J jnl
Optimal Superprimitivity Testing for Strings.
Inf. Process. Lett.
Alberto Apostolico, Martin Farach, Costas S. Iliopoulos
1989 — conf
PRAM Algorithms for Identifying Polygon Similarity.
Optimal Algorithms
Costas S. Iliopoulos, William F. Smyth
1989 J jnl
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.
SIAM J. Comput.
Costas S. Iliopoulos
1989 J jnl
Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Infinite Abelian Groups and Solving Systems of Linear Diophantine Equations.
SIAM J. Comput.
Costas S. Iliopoulos
1988 J jnl
On the Computational Complexity of the Abelian Permutation Group Structure, Membership and Intersection Problems.
Theor. Comput. Sci.
Costas S. Iliopoulos
1988 J jnl
Parallel Construction of a Suffix Tree with Applications.
Algorithmica
Alberto Apostolico, Costas S. Iliopoulos, Gad M. Landau, Baruch Schieber, Uzi Vishkin
1987 — conf
On O(n log n) Cost Parallel Algorithm for the Single Function Coarsest Partition Problem.
Parallel Algorithms and Architectures
Alberto Apostolico, Costas S. Iliopoulos, Robert Paige
1986 J jnl
Monte Carlo Circuits for the Abelian Permutation Group Intersection Problem.
Acta Informatica
Costas S. Iliopoulos
1985 J jnl
Analysis of Algorithms on Problems in General Abelian Groups.
Inf. Process. Lett.
Costas S. Iliopoulos
1985 J jnl
Computing a Basis for a Finite Abelian p-Group.
Inf. Process. Lett.
W. M. Beynon, Costas S. Iliopoulos
1985 J jnl
Computing in General Abelian Groups is Hard.
Theor. Comput. Sci.
Costas S. Iliopoulos
1985 — conf
Gaussian Elimination over a Euclidean Ring.
European Conference on Computer Algebra (2)
Costas S. Iliopoulos
1985 — conf
Worst-Case Analysis of Algorithms for Computational Problems on Abelian Permutation Groups.
European Conference on Computer Algebra (2)
Costas S. Iliopoulos
1982 J jnl
Analysis of an Algorithm for Composition of Binary Quadratic Forms.
J. Algorithms
Costas S. Iliopoulos