Published by: University of Chicago Press
| Discipline name | Position | Best Scientists | Publications | D-Index |
|---|---|---|---|---|
| Computer Science | 766 | 18 | 13 | 6 |
The journal generally zeroes in on subjects such as Discrete mathematics, Combinatorics, Upper and lower bounds, Polynomial and Approximation algorithm. The journal addresses concerns in Discrete mathematics which are intertwined with other disciplines, such as Quantum computer, Quantum algorithm and Constant (mathematics). Research in Quantum computer tackled falls within the umbrella of Quantum.
The research on Quantum algorithm tackled can also make contributions to studies in the areas of Quantum capacity and Quantum operation. The journal focuses on Combinatorics research which is adjacent to topics in Function (mathematics). Discussions in Theory of Computing are anchored in the subject of Upper and lower bounds and the similar topic of Communication complexity.
Theory of Computing tackles topics on Communication complexity, which can potentially contribute to the wider field of Theoretical computer science. It focuses on Polynomial as well as the interrelated topic of Field (mathematics). Theory of Computing encompasses Approximation algorithm studies in the context of Mathematical optimization as a whole.
The journal articles mainly tackle studies in Discrete mathematics, Combinatorics, Quantum computer, Upper and lower bounds and Quantum. Time complexity is a major topic of Discrete mathematics research in the published papers. While Combinatorics is the focus of the most cited papers, it also provides insights into the studies of Maximization and Communication complexity.
The journal focuses on Combinatorics, Upper and lower bounds, Omega, Communication complexity and Exponent. The Combinatorics study tackled is a key component of adjacent topics in the area of Random walk. While Upper and lower bounds is the focus of Theory of Computing, it also provided insights into the studies of Discrete mathematics, Approximation algorithm, Hardness of approximation and Graph partition.
The Discrete mathematics study presented in the journal encompasses related topics like Complexity class and also examines its connection to subjects such as Models of communication. The journal explores topics in Communication complexity which can be helpful for research in disciplines like Function (mathematics), Polynomial method, Variety (universal algebra) and Degree (graph theory). The journal deals with Monomial in conjunction with Bounded function and similar fields in Binary logarithm, Matrix (mathematics), Random graph and Eigenvalues and eigenvectors.
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 Theory of Computing (based on the number of publications) are:
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 Theory of Computing (based on the number of publications) are:
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.
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, 100.00% of publications had an unrecognized affiliation. Out of the publications with recognized affiliations, nan% were posted by at least one author from the top 10 institutions publishing in the journal. Another nan% included authors affiliated with research institutions from the top 11-20 affiliations. Institutions from the 21-50 range included nan% of all publications and nan% were from other institutions.
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.
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.
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:
The chart below illustrates experience levels of first authors in cases of publications with multiple authors.
Scott Aaronson;Sam Gunn
(2020)Amir Abboud;Robert Krauthgamer;Ohad Trabelsi
(2021)Julia Chuzhoy;David Hong Kyun Kim;Rachit Nimavat
(2021)Roksana Baleshzar;Deeparnab Chakrabarty;Ramesh Krishnan S. Pallavoor;Sofya Raskhodnikova
(2020)Chandra Chekuri;Shi Li
(2020)Ryan O'Donnell;Tselil Schramm
(2021)Michael A. Forbes;Amir Shpilka;Iddo Tzameret;Avi Wigderson
(2021)Noga Alon;Elchanan Mossel;Robin Pemantle
(2020)Alessandro Chiesa;Peter Manohar;Igor Shinkar
(2020)Anindya De;Ryan O'Donnell;Rocco A. Servedio
(2020)Exploring online degrees in Computer Science can open doors to some of the highest paying jobs in the technology sector. Online programs often offer flexibility, allowing students to balance studies with work or personal commitments while preparing for lucrative career paths.
For budget-conscious learners, finding the most cost-effective route is crucial. Many online universities offer affordable tuition, and a great place to start is by researching the cheapest online bachelors degree options. This ensures quality education without the financial strain often associated with a traditional campus experience.
Additionally, some accredited online schools waive application fees, making it easier and less costly to apply. Checking lists of no application fee colleges can simplify your admission process and save money upfront.
For those eager to jumpstart their careers, accelerated programs offer an efficient path to earning a degree faster. These programs are ideal for motivated students seeking to enter the workforce quickly or advance their current careers without delay.
