54th Annual ACM Symposium on Theory of Computing

Top Research Topics at Symposium on the Theory of Computing?

• Discrete mathematics (47.86%)
• Combinatorics (42.40%)
• Algorithm (12.55%)

Discrete mathematics, Combinatorics, Algorithm, Upper and lower bounds and Theoretical computer science are the subjects of interest in the conference. Discrete mathematics research featured in the event incorporates concerns from various other topics such as Function (mathematics), Polynomial and Bounded function. Combinatorics study tackled is connected to the field of Constant (mathematics).

Symposium on the Theory of Computing encompasses Approximation algorithm studies in the context of Mathematical optimization as a whole.

What are the most cited papers published at the conference?

• The complexity of theorem-proving procedures (5134 citations)
• A fast quantum mechanical algorithm for database search (4639 citations)
• A theory of the learnable (4427 citations)

Research areas of the most cited articles at Symposium on the Theory of Computing:

The conference papers primarily tackle Discrete mathematics, Combinatorics, Theoretical computer science, Algorithm and Time complexity. The majority of Discrete mathematics studies in the published articles are focused on the issues of Conjecture. While the conference papers focused on Combinatorics, they were also able to explore topics like Bounded function and Polynomial.

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

• Algorithm
• Programming language
• Artificial intelligence

The previous edition focused in particular on these issues:

The main points discussed in Symposium on the Theory of Computing deals with Discrete mathematics, Combinatorics, Function (mathematics), Upper and lower bounds and Bounded function. Communication complexity is a primary topic of Discrete mathematics research in Symposium on the Theory of Computing. The conference dives deep in exploring the relationship between the study of Combinatorics and Simple (abstract algebra).

The research on Polynomial tackled can also make contributions to studies in the areas of Monomial, Monotone polygon, Sampling (statistics), Class (set theory) and Applied mathematics. Symposium on the Theory of Computing holds forums on Time complexity that merges themes from other disciplines such as Path (graph theory) and Minimum cut. Open problem and Metric (mathematics) are some topics wherein Approximation algorithm research discussed in Symposium on the Theory of Computing have an impact.

The most cited articles from the last conference are:

• Minimum cost flows, MDPs, and ℓ1-regression in nearly linear time for dense instances (16 citations)
• Optimal mixing of Glauber dynamics: entropy factorization via high-dimensional expansion (16 citations)
• Fiber bundle codes: breaking the n1/2 polylog(n) barrier for Quantum LDPC codes (12 citations)

Papers citation over time

A key indicator for each conference 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.

Top authors and change over time

The top authors publishing at Symposium on the Theory of Computing (based on the number of publications) are:

• Avi Wigderson (66 papers) absent at the last edition,
• Moni Naor (36 papers) published 1 paper at the last edition,
• Noam Nisan (35 papers) published 1 paper at the last edition,
• Mihalis Yannakakis (34 papers) absent at the last edition,
• Rafail Ostrovsky (33 papers) absent at the last edition.

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

Top affiliations and change over time

Only papers with recognized affiliations are considered

The top affiliations publishing at Symposium on the Theory of Computing (based on the number of publications) are:

• Massachusetts Institute of Technology (421 papers) published 21 papers at the last edition, 7 more than at the previous edition,
• IBM (267 papers) published 1 paper at the last edition, 1 less than at the previous edition,
• Princeton University (236 papers) published 11 papers at the last edition the same number as at the previous edition,
• University of California, Berkeley (236 papers) published 7 papers at the last edition, 2 more than at the previous edition,
• Microsoft (208 papers) published 4 papers at the last edition, 1 less than at the previous edition.

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

Publication chance based on affiliation

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

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, 47.59% were posted by at least one author from the top 10 institutions publishing at the conference. Another 15.66% included authors affiliated with research institutions from the top 11-20 affiliations. Institutions from the 21-50 range included 20.48% of all publications and 16.27% were from other institutions.

Returning Authors Index

A very common phenomenon observed among researchers publishing scientific articles is the intentional selection of conferences they have already attended in the past. In particular, it is worth analyzing the case when the authors participate in the same conference 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 conference 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 at a conference. The index includes the authors publishing at the last edition of a conference, 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.