Kenneth McAloon
Impact in
- Geometry and Topology top 5%
- Advanced Topology and Set Theory
-
- Computability, Logic, AI Algorithms
- semigroups and automata theory
- Advanced Algebra and Logic
- Formal Methods in Verification
Papers in
-
- Computability, Logic, AI Algorithms 6
- Advanced Algebra and Logic 3
- semigroups and automata theory 2
- Petri Nets in System Modeling 1
-
- Advanced Topology and Set Theory 5
- Co-authors
- Harvey Friedman (1 shared paper)Stephen G. Simpson (1 shared paper)Akihiro Kanamori (1 shared paper)Ronald V. Book (1 shared paper)Stephen R. Mahaney (1 shared paper)Ker‐I Ko (1 shared paper)Peter Clote (1 shared paper)Patrick Cégielski (1 shared paper)
- Journals
- Proceedings of the American Mathematical Society (2 papers)Lecture notes in mathematics (2 papers)Journal of Symbolic Logic (2 papers)Theoretical Computer Science (1 paper)Transactions of the American Mathematical Society (1 paper)
- Partner nations
- United StatesFrance
In The Last Decade
Kenneth McAloon
14 papers receiving 263 citations
Peers
Comparison fields: 5 of 34
- Geometry and Topology 145
- Computational Theory and Mathematics 258
- Theoretical Computer Science 15
- Discrete Mathematics and Combinatorics 28
- Mathematical Physics 60
Countries citing papers authored by Kenneth McAloon
This map shows the geographic impact of Kenneth McAloon'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 Kenneth McAloon with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Kenneth McAloon more than expected).
Fields of papers citing papers by Kenneth McAloon
This network shows the impact of papers produced by Kenneth McAloon. 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 Kenneth McAloon. The network helps show where Kenneth McAloon may publish in the future.
Co-authors
The 9 scholars most cited alongside Kenneth McAloon, 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 | 1982 | 65 | |
| 2 | 1971 | 52 | |
| 3 | 1987 | 37 | |
| 4 | 1984 | 35 | |
| 5 | 1982 | 28 | |
| 6 | Studies in complexity theory | 1986 | 28 |
| 7 | 1978 | 22 | |
| 8 | 1981 | 20 | |
| 9 | 1974 | 8 | |
| 10 | 1983 | 6 | |
| 11 | 1982 | 5 | |
| 12 | 1983 | 2 | |
| 13 | 1983 | 2 | |
| 14 | Multithreaded constraint programming and applications | 1999 | 2 |
| 15 | 1981 | 0 | |
| 16 | 1981 | 0 |
About Kenneth McAloon
Kenneth McAloon is a scholar working on Computational Theory and Mathematics, Geometry and Topology, Artificial Intelligence, Mathematical Physics and Discrete Mathematics and Combinatorics, having authored 16 papers that have together received 312 indexed citations. Recurring topics across this work include Computability, Logic, AI Algorithms (6 papers), Advanced Topology and Set Theory (5 papers), Logic, Reasoning, and Knowledge (3 papers), Advanced Algebra and Logic (3 papers), Mathematical and Theoretical Analysis (2 papers), Limits and Structures in Graph Theory (2 papers), semigroups and automata theory (2 papers) and Petri Nets in System Modeling (1 paper). The work is most often cited by research in Geometry and Topology (145 citations), Computational Theory and Mathematics (258 citations), Theoretical Computer Science (15 citations), Discrete Mathematics and Combinatorics (28 citations) and Mathematical Physics (60 citations). Kenneth McAloon has collaborated with scholars based in United States and France. Frequent co-authors include Harvey Friedman, Stephen G. Simpson, Akihiro Kanamori, Ronald V. Book, Stephen R. Mahaney, Ker‐I Ko, Peter Clote, Patrick Cégielski and Michael Anshel. Their work appears in journals such as Proceedings of the American Mathematical Society, Lecture notes in mathematics, Journal of Symbolic Logic, Theoretical Computer Science and Transactions of the American Mathematical Society.
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.