Theory Of Computation
Theory of Computation is the branch of theoretical computer science that studies the fundamental capabilities and limitations of computational models by investigating which problems can be solved algorithmically, their computational complexity, and the inherent bounds on what can be computed.
38.6K
Publications
2.4M
Citations
37.2K
Authors
5K
Institutions
Publications per year
2017–2026
4.5K
38.6K
A Unified Approach to Interpreting Model Predictions
Scott Lundberg, Su‐In Lee · arXiv (Cornell University) · 2017 · 7.6K citations · Full text
Jeannette M. Wing · Communications of the ACM · 2006 · 7.1K citations · Full text
1–5 of 38.6K
37.2K
47
h-index
44
h-index
43
h-index
43
h-index
University of California San Diego, United States
79 publications · 8.5K citations
41
h-index
1–5 of 37.2K
5K
Massachusetts Institute of Technology
Cambridge, United States
140 h-index
1.1K publications
157.8K citations
Stanford University
Stanford, United States
122 h-index
917 publications
124.3K citations
University of California, Berkeley
Berkeley, United States
122 h-index
1.1K publications
118.5K citations
Carnegie Mellon University
Pittsburgh, United States
100 h-index
935 publications
94.7K citations
Princeton University
Princeton, United States
98 h-index
773 publications
71.7K citations
IBM (United States)
Armonk, United States
95 h-index
452 publications
97.7K citations

Cornell University
Ithaca, United States
95 h-index
624 publications
57.9K citations

Weizmann Institute of Science
Rehovot, Israel
85 h-index
440 publications
41.9K citations
1–8 of 5K
1.1K publications · 111.3K citations
151
h-index
JACM · 496 publications · 78.7K citations
134
h-index
674 publications · 59.9K citations
105
h-index
850 publications · 54.3K citations
96
h-index
335 publications · 38.4K citations
87
h-index
1–5
See also Theory Of Computation | |
|---|---|
Computational Models | Finite Automata Regular Expressions Turing Machines Pushdown Automata Cellular Automata Context-free Grammars Linear Bounded Automata Lambda Calculus Register Machines |
Decidability | |
Formal Languages | Formal Language Theory Chomsky Hierarchy Regular Languages Context-free Grammars Deterministic Finite Automata Nondeterministic Finite Automata Context-sensitive Grammars Turing Machines Recursively Enumerable Languages Regular Expressions Context-free Languages |
Reducibility | |