Paul E. Schupp

6.4k total citations · 1 hit paper
58 papers, 3.0k citations indexed

About

Paul E. Schupp is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Mathematical Physics. According to data from OpenAlex, Paul E. Schupp has authored 58 papers receiving a total of 3.0k indexed citations (citations by other indexed papers that have themselves been cited), including 34 papers in Computational Theory and Mathematics, 29 papers in Geometry and Topology and 12 papers in Mathematical Physics. Recurrent topics in Paul E. Schupp's work include Geometric and Algebraic Topology (26 papers), semigroups and automata theory (24 papers) and Computability, Logic, AI Algorithms (11 papers). Paul E. Schupp is often cited by papers focused on Geometric and Algebraic Topology (26 papers), semigroups and automata theory (24 papers) and Computability, Logic, AI Algorithms (11 papers). Paul E. Schupp collaborates with scholars based in United States, France and Canada. Paul E. Schupp's 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 Yuri Gurevich and has published in prestigious journals such as Communications on Pure and Applied Mathematics, Transactions of the American Mathematical Society and Inventiones mathematicae.

In The Last Decade

Paul E. Schupp

53 papers receiving 2.6k citations

Hit Papers

Combinatorial Group Theory 1990 2026 2002 2014 1990 400 800 1.2k

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Paul E. Schupp United States 18 2.1k 1.5k 1.3k 826 568 58 3.0k
Roger C. Lyndon United States 24 2.2k 1.0× 1.6k 1.1× 1.3k 1.1× 913 1.1× 722 1.3× 63 3.6k
Andreas Blass United States 26 945 0.5× 2.3k 1.5× 535 0.4× 351 0.4× 1.3k 2.3× 164 3.2k
Vera T. Sós Hungary 22 954 0.5× 1.4k 0.9× 242 0.2× 1.3k 1.6× 236 0.4× 62 2.2k
Graham Higman Slovakia 21 985 0.5× 777 0.5× 457 0.4× 1.2k 1.5× 741 1.3× 38 2.4k
George M. Bergman United States 21 1.7k 0.8× 737 0.5× 762 0.6× 240 0.3× 111 0.2× 94 2.4k
Peter Freyd United States 14 1.0k 0.5× 483 0.3× 848 0.7× 272 0.3× 440 0.8× 37 1.7k
E. Rodney Canfield United States 18 404 0.2× 433 0.3× 414 0.3× 567 0.7× 244 0.4× 70 1.5k
John Howie United Kingdom 23 1.3k 0.6× 3.6k 2.4× 529 0.4× 410 0.5× 642 1.1× 100 4.2k
Jeffrey Shallit Canada 22 259 0.1× 1.8k 1.2× 522 0.4× 250 0.3× 1.3k 2.2× 199 2.4k
C. C. Chang United States 12 647 0.3× 2.3k 1.5× 384 0.3× 123 0.1× 1.3k 2.2× 28 3.2k

Countries citing papers authored by Paul E. Schupp

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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 of co-authors of Paul E. Schupp

This figure shows the co-authorship network connecting the top 25 collaborators of Paul E. Schupp. A scholar is included among the top collaborators of Paul E. Schupp based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Paul E. Schupp. Paul E. Schupp is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Morozov, Andrey & Paul E. Schupp. (2019). Computable permutations and word problems. 64(1). 143–160.
2.
Ceccherini‐Silberstein, Tullio, et al.. (2015). Multipass automata and group word problems. Theoretical Computer Science. 600. 19–33. 3 indexed citations
3.
Kapovich, Ilya, Igor Rivin, Paul E. Schupp, & Vladimir Shpilrain. (2007). Densities in free groups and $\mathbb{Z}^k$, Visible Points and Test Elements. Mathematical Research Letters. 14(2). 263–284. 8 indexed citations
4.
Gurevich, Yuri & Paul E. Schupp. (2007). Membership Problem for the Modular Group. SIAM Journal on Computing. 37(2). 425–459. 11 indexed citations
5.
Kapovich, Ilya, Paul E. Schupp, & Vladimir Shpilrain. (2006). Generic properties of Whitehead’s algorithm and isomorphism rigidity of random one-relator groups. Pacific Journal of Mathematics. 223(1). 113–140. 33 indexed citations
6.
Kapovich, Ilya, Gilbert Levitt, Paul E. Schupp, & Vladimir Shpilrain. (2006). Translation equivalence in free groups. Transactions of the American Mathematical Society. 359(4). 1527–1546. 9 indexed citations
7.
Kapovich, Ilya & Paul E. Schupp. (2005). Delzant's $T$-invariant, Kolmogorov complexity and one-relator groups. Commentarii Mathematici Helvetici. 80(4). 911–933. 10 indexed citations
8.
Kapovich, Ilya, Alexei Myasnikov, Paul E. Schupp, & Vladimir Shpilrain. (2004). Average-case complexity and decision problems in group theory. Advances in Mathematics. 190(2). 343–359. 28 indexed citations
9.
Kapovich, Ilya & Paul E. Schupp. (2003). Delzant's T-invariant, one-relator groups and Kolmogorov complexity. arXiv (Cornell University).
10.
Kapovich, Ilya, Paul E. Schupp, & Vladimir Shpilrain. (2003). Generic properties of Whitehead's Algorithm, stabilizers in Aut(F k ) and one-relator groups. arXiv (Cornell University). 3 indexed citations
11.
Schupp, Paul E.. (1998). On the structure of Hamiltonian cycles in Cayley graphs of finite quotients of the modular group. Theoretical Computer Science. 204(1-2). 233–248. 4 indexed citations
12.
Ivanov, Sergei & Paul E. Schupp. (1998). On the hyperbolicity of small cancellation groups and one-relator groups. Transactions of the American Mathematical Society. 350(5). 1851–1894. 12 indexed citations
13.
Muller, David E. & Paul E. Schupp. (1995). Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra. Theoretical Computer Science. 141(1-2). 69–107. 92 indexed citations
14.
Muller, David E., A. Saoudi, & Paul E. Schupp. (1992). Alternating automata, the weak monadic theory of trees and its complexity. Theoretical Computer Science. 97(2). 233–244. 25 indexed citations
15.
Muller, David E. & Paul E. Schupp. (1987). Alternating automata on infinite trees. Theoretical Computer Science. 54(2-3). 267–276. 115 indexed citations
16.
Schupp, Paul E.. (1987). A characterization of inner automorphisms. Proceedings of the American Mathematical Society. 101(2). 226–228. 17 indexed citations
17.
Perrin, Dominique & Paul E. Schupp. (1986). Automata on the Integers, Recurrence Distinguishability, and the Equivalence and Decidability of Monadic Theories. 301–304. 4 indexed citations
18.
Muller, David E. & Paul E. Schupp. (1985). The theory of ends, pushdown automata, and second-order logic. Theoretical Computer Science. 37. 51–75. 117 indexed citations
19.
Appel, K. I. & Paul E. Schupp. (1972). The conjugacy problem for the group of any tame alternating knot is solvable. Proceedings of the American Mathematical Society. 33(2). 329–336. 10 indexed citations
20.
Miller, Charles F. & Paul E. Schupp. (1971). Embeddings into hopfian groups. Journal of Algebra. 17(2). 171–176. 16 indexed citations

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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026