| Discipline name | Position | Best Scientists | Publications | D-Index |
|---|---|---|---|---|
| Computer Science | 661 | 29 | 30 | 8 |
ACM Transactions on Computation Theory is mainly concerned with subjects like Discrete mathematics, Combinatorics, Upper and lower bounds, Function (mathematics) and Time complexity. The studies in Discrete mathematics featured incorporate elements of Proof complexity and Mathematical proof. ACM Transactions on Computation Theory aims to investigate interdisciplinary topics such as Mathematical proof and Oracle.
Some problems in Combinatorics that were presented in ACM Transactions on Computation Theory overlapped with concepts under Polynomial and Bounded function. It focuses on Bounded function research which is adjacent to topics in Real number. In ACM Transactions on Computation Theory, Binary logarithm, Binary decision diagram, Exponential function and Disjoint sets are investigated in conjunction with one another to address concerns in Upper and lower bounds research.
Most of the Function (mathematics) studies addressed also intersect with Property testing. Complexity class is a primary topic of Time complexity research in the journal. The featured Parameterized complexity works encompass concepts such as Kernelization and examines them in conjunction with Polynomial kernel.
The published papers explore disciplines such as Discrete mathematics, Combinatorics, Upper and lower bounds, Computational complexity theory and Constraint satisfaction problem. While the most cited articles focused on Discrete mathematics, they were also able to explore topics like Development (topology), Quantum entanglement, Dimension (graph theory), Simple (abstract algebra) and Distribution (number theory). The most cited papers are mostly focused on Combinatorics, specifically Parameterized complexity.
The journal is organized to address concerns in the fields of Combinatorics, Upper and lower bounds, Discrete mathematics, Algorithm and Time complexity. The journal deals with Combinatorics in conjunction with Polynomial and similar fields in Binary logarithm and Boolean function. The studies on Upper and lower bounds discussed can also contribute to research in the domains of Function (mathematics) and Proof complexity, Mathematical proof.
The work on Discrete mathematics tackled in the journal brings together disciplines like Multilinear map and Arithmetic circuits. The concepts on Algorithm presented in ACM Transactions on Computation Theory can also apply to other research fields, including Bipartite graph and Finite set. It focuses on Time complexity but the discussions also offer insight into other areas such as Computational complexity theory, PSPACE and Boolean satisfiability problem.
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 ACM Transactions on Computation Theory (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 ACM Transactions on Computation Theory (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, 0.00% of publications had an unrecognized affiliation. Out of the publications with recognized affiliations, 34.78% were posted by at least one author from the top 10 institutions publishing in the journal. Another 8.70% included authors affiliated with research institutions from the top 11-20 affiliations. Institutions from the 21-50 range included 21.74% of all publications and 34.78% 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.
Edith Hemaspaandra;Lane A. Hemaspaandra;Curtis Menton
(2020)Sushmita Gupta;Pranabendu Misra;Saket Saurabh;Meirav Zehavi
(2021)Dušan Knop;Michał Pilipczuk;Marcin Wrochna
(2020)Andreas Galanis;Leslie Ann Goldberg;James Stewart
(2021)Srinivasan Arunachalam;Sourav Chakraborty;Michal Koucký;Nitin Saurabh
(2021)Ivona Bezáková;Andreas Galanis;Leslie Ann Goldberg;Daniel Štefankovič
(2021)Henning Fernau;Florin Manea;Robert Mercaş;Markus L. Schmid
(2020)Exploring related fields alongside Computer Science can expand your career opportunities and skill set. For instance, pursuing online mechanical engineering degrees offers a strong foundation in the design and manufacturing aspects of technology, complementing software skills with practical engineering knowledge.
Students who enjoy scientific principles and mathematical modeling might consider a bachelor of science in physics online. This degree hones problem-solving abilities and analytical thinking, which are valuable in fields like algorithm development and artificial intelligence.
The rise of big data has made data science degrees increasingly relevant. These programs teach how to extract insights from large datasets, a skill integral to modern tech roles and decision-making in business.
Additionally, an interest in hardware and electronics can be supported by enrolling in accredited online electrical engineering programs. These prepare students for careers in circuit design, robotics, and telecommunications, often working alongside software developers.
Choosing related online degrees can help computer science students diversify their expertise and adapt to the evolving technology landscape, offering multiple pathways into thriving career fields.
