D-Index & Metrics Best Publications

D-Index & Metrics

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Computer Science D-index 33 Citations 5,948 330 World Ranking 6675 National Ranking 390

Overview

What is he best known for?

The fields of study he is best known for:

  • Algorithm
  • Combinatorics
  • Artificial intelligence

Costas S. Iliopoulos mainly investigates Combinatorics, Algorithm, String, Pattern matching and String searching algorithm. His Combinatorics research includes themes of Discrete mathematics and Theory of computation. His studies deal with areas such as Search engine indexing, Data structure, A priori and a posteriori and Identification as well as Algorithm.

His String research is multidisciplinary, relying on both Prefix and Computation. The study incorporates disciplines such as Theoretical computer science, Preprocessor, Hybrid genome assembly, DNA sequencing and Component in addition to Pattern matching. His String searching algorithm research is multidisciplinary, incorporating elements of Approximate string matching and 3-dimensional matching.

His most cited work include:

  • Extracting powers and periods in a string from its runs structure (421 citations)
  • Finding common motifs with gaps using finite automata (293 citations)
  • On the maximal number of cubic runs in a string (267 citations)

What are the main themes of his work throughout his whole career to date?

His primary areas of investigation include Combinatorics, Algorithm, String, Discrete mathematics and Pattern matching. His Combinatorics research integrates issues from Set, Substring and String searching algorithm. His research integrates issues of Approximate string matching and 3-dimensional matching in his study of String searching algorithm.

The concepts of his Algorithm study are interwoven with issues in Data structure and Suffix tree. His research in String intersects with topics in Prefix, Cover and Suffix. He has included themes like Theoretical computer science and Pattern recognition in his Pattern matching study.

He most often published in these fields:

  • Combinatorics (51.79%)
  • Algorithm (36.35%)
  • String (31.07%)

What were the highlights of his more recent work (between 2014-2021)?

  • Combinatorics (51.79%)
  • Algorithm (36.35%)
  • String (31.07%)

In recent papers he was focusing on the following fields of study:

His primary areas of study are Combinatorics, Algorithm, String, Pattern matching and Integer. His study of Time complexity is a part of Combinatorics. Costas S. Iliopoulos has researched Algorithm in several fields, including Simple, State and Genome.

Costas S. Iliopoulos interconnects Binary logarithm and Factorization in the investigation of issues within String. His Integer study combines topics from a wide range of disciplines, such as Prefix and Type. The Discrete mathematics study combines topics in areas such as Edit distance and String searching algorithm.

Between 2014 and 2021, his most popular works were:

  • Circular sequence comparison: algorithms and applications (35 citations)
  • On avoided words, absent words, and their application to biological sequence analysis. (17 citations)
  • Average-Case Optimal Approximate Circular String Matching (17 citations)

In his most recent research, the most cited papers focused on:

  • Algorithm
  • Combinatorics
  • Algebra

His main research concerns Combinatorics, Algorithm, String, Pattern matching and Edit distance. His work deals with themes such as Discrete mathematics and String, which intersect with Combinatorics. His Discrete mathematics research is multidisciplinary, incorporating elements of Approximate string matching, Combinatorics on words and String searching algorithm.

His Algorithm research is multidisciplinary, relying on both Value, State and Factor. His String study incorporates themes from Binary logarithm, Prefix, Suffix and Order. His work carried out in the field of Pattern matching brings together such families of science as Efficient algorithm, Set and Search engine indexing.

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.

Best Publications

Extracting powers and periods in a string from its runs structure

Maxime Crochemore;Costas S. Iliopoulos;Marcin Kubica;Jakub Radoszewski.
string processing and information retrieval (2010)

423 Citations

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)

295 Citations

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)

269 Citations

Parallel construction of a suffix tree with applications

A. Apostolico;C. Iliopoulos;G. M. Landau;B. Schieber.
Algorithmica (1988)

200 Citations

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)

178 Citations

A New Efficient Algorithm for Computing the Longest Common Subsequence

M. Sohel Rahman;Costas S. Iliopoulos.
algorithmic applications in management (2007)

177 Citations

Optimal superprimitivity testing for strings

Alberto Apostolico;Alberto Apostolico;Martin Farach;Costas S. Iliopoulos.
Information Processing Letters (1991)

145 Citations

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)

127 Citations

Finding patterns in given intervals

Maxime Crochemore;Costas S. Iliopoulos;M. Sohel Rahman.
mathematical foundations of computer science (2007)

126 Citations

SOFSEM 2006: Theory and Practice of Computer Science

Manolis Christodoulakis;Costas Iliopoulos;Y. J. Pinzon Ardila.
Springer Finance (2006)

125 Citations

Best Scientists Citing Costas S. Iliopoulos

Gonzalo Navarro

Gonzalo Navarro

University of Chile

Publications: 80

Maxime Crochemore

Maxime Crochemore

King's College London

Publications: 58

Amihood Amir

Amihood Amir

Bar-Ilan University

Publications: 47

William F. Smyth

William F. Smyth

McMaster University

Publications: 41

Gad M. Landau

Gad M. Landau

University of Haifa

Publications: 33

Wojciech Rytter

Wojciech Rytter

University of Warsaw

Publications: 26

Simon J. Puglisi

Simon J. Puglisi

University of Helsinki

Publications: 24

Uzi Vishkin

Uzi Vishkin

University of Maryland, College Park

Publications: 23

Veli Mäkinen

Veli Mäkinen

University of Helsinki

Publications: 22

Kunsoo Park

Kunsoo Park

Seoul National University

Publications: 21

Esko Ukkonen

Esko Ukkonen

University of Helsinki

Publications: 13

Ricardo Baeza-Yates

Ricardo Baeza-Yates

Northeastern University

Publications: 12

Xindong Wu

Xindong Wu

Hefei University of Technology

Publications: 11

Paolo Ferragina

Paolo Ferragina

University of Pisa

Publications: 10

Alexandros Stamatakis

Alexandros Stamatakis

Heidelberg Institute for Theoretical Studies

Publications: 10

Jeffrey Shallit

Jeffrey Shallit

University of Waterloo

Publications: 9

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking d-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us
Something went wrong. Please try again later.