Stål Aanderaa
Impact in
-
- Computability, Logic, AI Algorithms
- semigroups and automata theory
- Complexity and Algorithms in Graphs
- Polynomial and algebraic computation
- Theoretical Computer Science top 10%
Papers in
-
- Computability, Logic, AI Algorithms 13
- semigroups and automata theory 5
- Complexity and Algorithms in Graphs 3
- Advanced Graph Theory Research 3
-
- Advanced Topology and Set Theory 10
- Geometric and Algebraic Topology 2
- Co-authors
- Stephen A Cook (1 shared paper)Daniel E. Cohen (2 shared papers)Burton Dreben (2 shared papers)Peter B. Andrews (1 shared paper)Patrick C. Fischer (1 shared paper)Yuri G. Gurevich (1 shared paper)Warren Goldfarb (1 shared paper)Egon Börger (2 shared papers)
- Journals
- Journal of Symbolic Logic (5 papers)Bulletin of the American Mathematical Society (2 papers)Archive for Mathematical Logic (1 paper)Transactions of the American Mathematical Society (1 paper)Mathematics of Computation (1 paper)
- Partner nations
- NorwayUnited StatesGermany
In The Last Decade
Stål Aanderaa
18 papers receiving 337 citations
Peers
Comparison fields: 5 of 32
- Computational Theory and Mathematics 218
- Theoretical Computer Science 13
- Geometry and Topology 56
- Information Systems 113
- Computational Mathematics 2
Countries citing papers authored by Stål Aanderaa
This map shows the geographic impact of Stål Aanderaa's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Stål Aanderaa with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Stål Aanderaa more than expected).
Fields of papers citing papers by Stål Aanderaa
This network shows the impact of papers produced by Stål Aanderaa. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Stål Aanderaa. The network helps show where Stål Aanderaa may publish in the future.
Co-authors
The 8 scholars most cited alongside Stål Aanderaa, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 1969 | 231 | |
| 2 | 1971 | 26 | |
| 3 | 1963 | 22 | |
| 4 | 1973 | 21 | |
| 5 | 1974 | 17 | |
| 6 | 1974 | 17 | |
| 7 | 1980 | 12 | |
| 8 | 1981 | 12 | |
| 9 | 1967 | 11 | |
| 10 | 1973 | 9 | |
| 11 | 1971 | 7 | |
| 12 | 1980 | 7 | |
| 13 | 1993 | 5 | |
| 14 | 1964 | 3 | |
| 15 | The Horn complexity of Boolean functions and Cook's problem | 1979 | 2 |
| 16 | 1980 | 2 | |
| 17 | 1982 | 2 | |
| 18 | 1974 | 1 | |
| 19 | 2017 | 1 | |
| 20 | 1984 | 0 |
About Stål Aanderaa
Stål Aanderaa is a scholar working on Computational Theory and Mathematics, Geometry and Topology, Artificial Intelligence, Discrete Mathematics and Combinatorics and Algebra and Number Theory, having authored 20 papers that have together received 408 indexed citations. Recurring topics across this work include Computability, Logic, AI Algorithms (13 papers), Advanced Topology and Set Theory (10 papers), semigroups and automata theory (5 papers), Complexity and Algorithms in Graphs (3 papers), Advanced Graph Theory Research (3 papers), Logic, Reasoning, and Knowledge (3 papers), Geometric and Algebraic Topology (2 papers) and Logic, programming, and type systems (2 papers). The work is most often cited by research in Computational Theory and Mathematics (218 citations), Theoretical Computer Science (13 citations), Geometry and Topology (56 citations), Information Systems (113 citations) and Computational Mathematics (2 citations). Stål Aanderaa has collaborated with scholars based in Norway, United States and Germany. Frequent co-authors include Stephen A Cook, Daniel E. Cohen, Burton Dreben, Peter B. Andrews, Patrick C. Fischer, Yuri G. Gurevich, Warren Goldfarb and Egon Börger. Their work appears in journals such as Journal of Symbolic Logic, Bulletin of the American Mathematical Society, Archive for Mathematical Logic, Transactions of the American Mathematical Society and Mathematics of Computation.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.