World's Best Scientists 2026 revealed!
Theoretical Computer Science
H-index 23

Theoretical Computer Science

Ranking & Metrics

Discipline name Position Best Scientists Publications D-Index
Computer Science 247 286 542 22

Additional Metrics

Number of Best Scientists*: 352
Documents by Best Scientists*: 616
Top 100 Ranked Scientists*: 9
SCIMAGO H-index: 133
SCIMAGO SJR: 0.494
Impact Factor: 1

Overview

Top Research Topics at Theoretical Computer Science?

Theoretical Computer Science mainly tackles studies in Combinatorics, Discrete mathematics, Algorithm, Theoretical computer science and Algebra. In Theoretical Computer Science, Upper and lower bounds, Bounded function and Set (abstract data type) are investigated in conjunction with one another to address concerns in Combinatorics research. While Theoretical Computer Science focused on Discrete mathematics, it was also able to explore topics like Class (set theory), Automaton and Polynomial.

Studies on Theoretical computer science discussed in it link to the field of Programming language.

  • Combinatorics (39.12%)
  • Discrete mathematics (37.59%)
  • Algorithm (15.16%)

What are the most cited papers published in the journal?

  • A theory of timed automata (5907 citations)
  • The complexity of computing the permanent (2329 citations)
  • Results on the propositional μ-calculus (1734 citations)

Research areas of the most cited articles at Theoretical Computer Science:

The most cited articles focus on Discrete mathematics, Combinatorics, Algorithm, Theoretical computer science and Algebra. The journal publications center on topics in Discrete mathematics, with a focus on Decidability. Time complexity is a major topic of Combinatorics research in the published articles.

What topics the last edition of the journal is best known for?

  • Artificial intelligence
  • Programming language
  • Algorithm

The previous edition focused in particular on these issues:

The journal mainly deals with areas of study such as Combinatorics, Discrete mathematics, Time complexity, Set (abstract data type) and Upper and lower bounds. The journal aims to address concerns in Combinatorics, specifically in the areas of Vertex (geometry), Graph, Graph (abstract data type), Vertex (graph theory) and Integer. The main emphasis of it is the subject of Graph, focusing on Bipartite graph.

While work presented in the journal provided substantial information on Discrete mathematics, it also covered topics in Bounded function and Constant (mathematics). The featured Time complexity study falls within the wider topic of Algorithm. Theoretical Computer Science features Set (abstract data type) research that overlaps with concepts in Theoretical computer science.

The most cited articles from the last journal are:

  • Maximum Nash welfare and other stories about EFX (10 citations)
  • Complexity of modification problems for best match graphs (9 citations)
  • On cherry-picking and network containment (9 citations)

Papers citation over time

A key indicator for each journal is its effectiveness in reaching other researchers with the papers published at that venue.

The chart below presents the interquartile range (first quartile 25%, median 50% and third quartile 75%) of the number of citations of articles over time.

The top authors publishing in Theoretical Computer Science (based on the number of publications) are:

  • Grzegorz Rozenberg (64 papers) published 1 paper at the last edition the same number as at the previous edition,
  • Oscar H. Ibarra (62 papers) published 1 paper at the last edition,
  • Arto Salomaa (43 papers) published 1 paper at the last edition,
  • Antonio Restivo (39 papers) published 2 papers at the last edition the same number as at the previous edition,
  • Kai Salomaa (38 papers) published 2 papers at the last edition.

The overall trend for top authors publishing in this journal is outlined below. The chart shows the number of publications at each edition of the journal for top authors.

Only papers with recognized affiliations are considered

The top affiliations publishing in Theoretical Computer Science (based on the number of publications) are:

  • University of Paris (276 papers) published 9 papers at the last edition, 2 more than at the previous edition,
  • French Institute for Research in Computer Science and Automation (198 papers) published 2 papers at the last edition, 10 less than at the previous edition,
  • Centre national de la recherche scientifique (188 papers) published 5 papers at the last edition the same number as at the previous edition,
  • University of Waterloo (148 papers) published 2 papers at the last edition, 6 less than at the previous edition,
  • University of Turku (136 papers) published 5 papers at the last edition, 2 more than at the previous edition.

The overall trend for top affiliations publishing in this journal is outlined below. The chart shows the number of publications at each edition of the journal for top affiliations.

Publication chance based on affiliation

The publication chance index shows the ratio of articles published by the best research institutions in the journal edition to all articles published within that journal. The best research institutions were selected based on the largest number of articles published during all editions of the journal.

The chart below presents the percentage ratio of articles from top institutions (based on their ranking of total papers).Top affiliations were grouped by their rank into the following tiers: top 1-10, top 11-20, top 21-50, and top 51+. Only articles with a recognized affiliation are considered.

During the most recent 2021 edition, 8.44% of publications had an unrecognized affiliation. Out of the publications with recognized affiliations, 9.22% were posted by at least one author from the top 10 institutions publishing in the journal. Another 6.45% included authors affiliated with research institutions from the top 11-20 affiliations. Institutions from the 21-50 range included 14.52% of all publications and 69.82% were from other institutions.

Returning Authors Index

A very common phenomenon observed among researchers publishing scientific articles is the intentional selection of journals they have already attended in the past. In particular, it is worth analyzing the case when the authors participate in the same journal from year to year.

The Returning Authors Index presented below illustrates the ratio of authors who participated in both a given as well as the previous edition of the journal in relation to all participants in a given year.

Returning Institution Index

The graph below shows the Returning Institution Index, illustrating the ratio of institutions that participated in both a given and the previous edition of the conference in relation to all affiliations present in a given year.

The experience to innovation index

Our experience to innovation index was created to show a cross-section of the experience level of authors publishing in a journal. The index includes the authors publishing at the last edition of a journal, grouped by total number of publications throughout their academic career (P) and the total number of citations of these publications ever received (C).

The group intervals were selected empirically to best show the diversity of the authors' experiences, their labels were selected as a convenience, not as judgment. The authors were divided into the following groups:

  • Novice - P < 5 or C < 25 (the number of publications less than 5 or the number of citations less than 25),
  • Competent - P < 10 or C < 100 (the number of publications less than 10 or the number of citations less than 100),
  • Experienced - P < 25 or C < 625 (the number of publications less than 25 or the number of citations less than 625),
  • Master - P < 50 or C < 2500 (the number of publications less than 50 or the number of citations less than 2500),
  • Star - P ≥ 50 and C ≥ 2500 (both the number of publications greater than 50 and the number of citations greater than 2500).

The chart below illustrates experience levels of first authors in cases of publications with multiple authors.

Career Opportunities in Theoretical Computer Science

Given the wide array of topics one can explore in theoretical computer science, it's clear that the field offers numerous career opportunities with promising outlooks. One potential career path to consider is becoming a computer science teacher in a school or university, where you can share knowledge of combinatorics, algorithms, discrete mathematics, and more. For those interested in teaching younger minds, they might want to consider a career in early childhood education. Having a solid foundation in theoretical computer science can also be advantageous in this field because it allows you to effectively introduce basic mathematical concepts to children in an engaging manner. In some areas, like Minnesota, you might be curious to know how to begin a teaching career in early childhood education. If you want to learn more about making this transition from computer science to early childhood education, you can refer to this guide on how to become a preschool teacher in Minnesota. Don't forget, the move to teaching should always stem from a passion for sharing knowledge. If you have the passion and patience and enjoy being around kids, this career shift could be a rewarding next step for you.

Top Publications

  • Optimal parameter choices via precise black-box analysis

    Benjamin Doerr;Carola Doerr;Jing Yang

    (2020)
    221 Citations
  • A game-based approximate verification of deep neural networks with provable guarantees

    Min Wu;Matthew Wicker;Wenjie Ruan;Xiaowei Huang

    (2020)
    113 Citations
  • Temporal Graph Classes: A View Through Temporal Separators

    Till Fluschnik;Hendrik Molter;Rolf Niedermeier;Philipp Zschoche

    (2020)
    59 Citations
  • Lower bounds on the run time of the Univariate Marginal Distribution Algorithm on OneMax

    Martin S. Krejca;Carsten Witt

    (2020)
    57 Citations
  • Fully persistent B-trees

    Gerth Stølting Brodal;Spyros Sioutas;Konstantinos Tsakalidis;Kostas Tsichlas

    (2020)
    36 Citations
  • A Hierarchy of Local Decision

    Laurent Feuilloley;Pierre Fraigniaud;Juho Hirvonen

    (2021)
    34 Citations
  • A fully distributed hierarchical attribute-based encryption scheme

    Mohammad Ali;Javad Mohajeri;Mohammad-Reza Sadeghi;Ximeng Liu;Ximeng Liu

    (2020)
    33 Citations
  • Unifying theories of reactive design contracts

    Simon David Foster;Ana Lucia Caneca Cavalcanti;Samuel James Canham;James Charles Paul Woodcock

    (2020)
    32 Citations
  • Quality gain analysis of the weighted recombination evolution strategy on general convex quadratic functions

    Youhei Akimoto;Anne Auger;Nikolaus Hansen

    (2020)
    32 Citations
  • On the performance of learned data structures

    Paolo Ferragina;Fabrizio Lillo;Giorgio Vinciguerra

    (2021)
    31 Citations

Related Online Degrees & Career Pathways

Pursuing a Computer Science degree online in the USA offers diverse opportunities, both in terms of education and career growth. Many students prioritize affordability and flexibility, making the cheap online colleges an attractive option without compromising quality.

Additionally, applicants can benefit from institutions that are recognized yet demand minimal upfront costs, such as the best online colleges with no application fee. This helps reduce barriers while exploring degree programs that align with career ambitions.

For those eager to enter the workforce quickly, accelerated colleges provide fast-track degree options, enabling learners to complete their studies in less time without sacrificing depth and rigor.

Lastly, students interested in maximizing their earning potential should consider that Computer Science ranks among the highest paid college majors, making investments in education well-worthwhile for long-term career success.

Best Scientists Contributing to This Journal

Recently Published Articles