His Combinatorics study frequently draws connections between related disciplines such as Topology (electrical circuits). His research combines Combinatorics and Topology (electrical circuits). Costas S. Iliopoulos performs integrative Programming language and Constant (computer programming) research in his work. His Space (punctuation) study frequently draws connections between adjacent fields such as Operating system. His Operating system study frequently intersects with other fields, such as Space (punctuation). His Algorithm study often links to related topics such as Running time. His research ties Algorithm and Running time together. Binary logarithm is closely attributed to Discrete mathematics in his research. Costas S. Iliopoulos regularly ties together related areas like Binary logarithm in his Discrete mathematics studies.
His Algorithm study frequently draws parallels with other fields, such as Time complexity, Theory of computation and Computation. His Discrete mathematics study frequently draws connections between adjacent fields such as Binary logarithm and Time complexity. Many of his studies on Binary logarithm involve topics that are commonly interrelated, such as Discrete mathematics. His Mathematical analysis study has been linked to subjects such as Upper and lower bounds and Bounded function. His research on Bounded function frequently connects to adjacent areas such as Mathematical analysis. His research links Tree (set theory) with Combinatorics. He regularly ties together related areas like Combinatorics in his Tree (set theory) studies. His Programming language study typically links adjacent topics like Substring. His research on Substring often connects related areas such as Data structure.
Costas S. Iliopoulos links adjacent fields of study such as Search engine indexing and Parsing in the subject of Artificial intelligence. His Search engine indexing study frequently draws connections between related disciplines such as Artificial intelligence. Combinatorics is frequently linked to Tree (set theory) in his study. His Tree (set theory) study typically links adjacent topics like Combinatorics. Mathematical analysis and Attractor are frequently intertwined in his study. In most of his Upper and lower bounds studies, his work intersects topics such as Log-log plot. His research ties Upper and lower bounds and Log-log plot together. His work on Operating system expands to the thematically related Space (punctuation). His Space (punctuation) research extends to the thematically linked field of Operating system.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Extracting Powers and Periods in a String from Its Runs Structure
Maxime Crochemore;Costas S. Iliopoulos;Marcin Kubica;Jakub Radoszewski.
Lecture Notes in Computer Science (2010)
Finding common motifs with gaps using finite automata
Pavlos Antoniou;Jan Holub;Costas S. Iliopoulos;Bořivoj Melichar.
international conference on implementation and application of automata (2006)
On the maximal number of cubic runs in a string
Maxime Crochemore;Costas Iliopoulos;Marcin Kubica;Jakub Radoszewski.
language and automata theory and applications (2010)
Parallel construction of a suffix tree with applications
A. Apostolico;C. Iliopoulos;G. M. Landau;B. Schieber.
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
Costas S. Iliopoulos.
SIAM Journal on Computing (1989)
Optimal superprimitivity testing for strings
Alberto Apostolico;Alberto Apostolico;Martin Farach;Costas S. Iliopoulos.
Information Processing Letters (1991)
Algorithms for computing approximate repetitions in musical sequences
Emilios Cambouropoulos;Maxime Crochemore;Costas S. Iliopoulos;Costas S. Iliopoulos;Laurent Mouchard;Laurent Mouchard.
International Journal of Computer Mathematics (2002)
SOFSEM 2006: Theory and Practice of Computer Science
Manolis Christodoulakis;Costas Iliopoulos;Y. J. Pinzon Ardila.
Springer Finance (2006)
Sofsem 2008: Theory and Practice of Computer Science
Costas Iliopoulos;M S Rahman;Geffert;J Karhumaki.
34th Conference on Current Trends in Theory and Practice of Computer Science (2008)
Pattern Processing in Melodic Sequences: Challenges, Caveats and Prospects
Emilios Cambouropoulos;Tim Crawford;Costas S. Iliopoulos.
Computers and The Humanities (2001)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: