Paul E. Schupp
-
- Finite Group Theory Research 10
- Geometry and Topology top 0.1%
- Geometric and Algebraic Topology 26
- Advanced Topology and Set Theory 5
- Mathematical Physics top 0.5%
- Mathematical Dynamics and Fractals 8
- Advanced Operator Algebra Research 5
- Computational Theory and Mathematics top 0.2%
- semigroups and automata theory 24
- Computability, Logic, AI Algorithms 11
- Algebra and Number Theory top 5%
-
- Logic, programming, and type systems 8
- Co-authors
- Roger C. LyndonDavid E. MullerIlya KapovichVladimir ShpilrainK. I. AppelAlexei MyasnikovA. SaoudiCharles F. Miller
- Journals
- Theoretical Computer Science (7 papers)Proceedings of the American Mathematical Society (5 papers)Mathematische Annalen (5 papers)
- Partner nations
- United StatesFranceCanada
In The Last Decade
Paul E. Schupp
53 papers receiving 2.6k citations
Hit Papers
Peers
Comparison fields: 5 of 75
- Discrete Mathematics and Combinatorics 826
- Geometry and Topology 2.1k
- Mathematical Physics 1.3k
- Computational Theory and Mathematics 1.5k
- Algebra and Number Theory 191
Countries citing papers authored by Paul E. Schupp
This map shows the geographic impact of Paul E. Schupp'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 Paul E. Schupp with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Paul E. Schupp more than expected).
Fields of papers citing papers by Paul E. Schupp
This network shows the impact of papers produced by Paul E. Schupp. 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 Paul E. Schupp. The network helps show where Paul E. Schupp may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Paul E. Schupp, 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 | 2019 | 0 | |
| 2 | 2015 | 3 | |
| 3 | 2007 | 8 | |
| 4 | 2006 | 9 | |
| 5 | 2005 | 10 | |
| 6 | 2004 | 28 | |
| 7 | Delzant's T-invariant, one-relator groups and Kolmogorov complexity | 2003 | 0 |
| 8 | Generic properties of Whitehead's Algorithm, stabilizers in Aut(F k ) and one-relator groups | 2003 | 3 |
| 9 | 2003 | 81 | |
| 10 | 1998 | 4 | |
| 11 | 1995 | 92 | |
| 12 | 1992 | 25 | |
| 13 | Combinatorial Group Theorybreakdown → | 1990 | 1367 |
| 14 | 1987 | 115 | |
| 15 | 1987 | 17 | |
| 16 | Automata on the Integers, Recurrence Distinguishability, and the Equivalence and Decidability of Monadic Theories | 1986 | 4 |
| 17 | 1985 | 117 | |
| 18 | 1984 | 17 | |
| 19 | 1983 | 117 | |
| 20 | 1971 | 16 |
About Paul E. Schupp
Paul E. Schupp is a scholar working on Discrete Mathematics and Combinatorics, Geometry and Topology and Computational Theory and Mathematics, having authored 58 papers that have together received 3.0k indexed citations. Recurring topics across this work include Geometric and Algebraic Topology (26 papers), semigroups and automata theory (24 papers), Computability, Logic, AI Algorithms (11 papers), Finite Group Theory Research (10 papers), Logic, programming, and type systems (8 papers), Mathematical Dynamics and Fractals (8 papers), Advanced Topology and Set Theory (5 papers) and Advanced Operator Algebra Research (5 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (826 citations), Geometry and Topology (2.1k citations) and Mathematical Physics (1.3k citations). Paul E. Schupp has collaborated with scholars based in United States, France and Canada. Frequent co-authors include Roger C. Lyndon, David E. Muller, Ilya Kapovich, Vladimir Shpilrain, K. I. Appel, Alexei Myasnikov, A. Saoudi, Charles F. Miller, George S. Sacerdote and James McCool. Their work appears in journals such as Theoretical Computer Science, Proceedings of the American Mathematical Society, Mathematische Annalen, Journal of the London Mathematical Society 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.