Paul Schupp | Academic Influence

Paul Schupp's AcademicInfluence.com Rankings

Paul Schupp

Mathematics

#2319

World Rank

#3600

Historical Rank

#926

USA Rank

Group Theory

#23

World Rank

#32

Historical Rank

#6

USA Rank

Algebra

#413

World Rank

#565

Historical Rank

#79

USA Rank

Measure Theory

#2753

World Rank

#3288

Historical Rank

#793

USA Rank

mathematics Degrees

Download Badge

Mathematics

Paul Schupp's Degrees

PhD Mathematics University of California, Berkeley
Masters Mathematics University of California, Berkeley
Bachelors Mathematics University of California, Berkeley

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Paul Schupp Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Paul Eugene Schupp was a professor emeritus of mathematics at the University of Illinois at Urbana Champaign. He is known for his contributions to geometric group theory, computational complexity and the theory of computability.

(See a Problem?)

Paul Schupp's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Combinatorial Group Theory (1977) (2102)
The Theory of Ends, Pushdown Automata, and Second-Order Logic (1985) (361)
Simulating Alternating Tree Automata by Nondeterministic Automata: New Results and New Proofs of the Theorems of Rabin, McNaughton and Safra (1995) (266)
Groups, the Theory of Ends, and Context-Free Languages (1983) (248)
Alternating Automata on Infinite Trees (1987) (222)
Generic-case complexity, decision problems in group theory and random walks (2002) (188)
Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity (1986) (160)
Weak alternating automata give a simple explanation of why most temporal and dynamic logics are decidable in exponential time (1988) (127)
Artin groups and infinite Coxeter groups (1983) (94)
Generic properties of Whitehead’s algorithm and isomorphism rigidity of random one-relator groups (2003) (82)
Alternating Automata, the Weak Monadic Theory of Trees and its Complexity (1992) (64)
Average-case complexity and decision problems in group theory (2002) (63)
Genericity, the Arzhantseva-Ol’shanskii method and the isomorphism problem for one-relator groups (2002) (59)
On Dehn's algorithm and the conjugacy problem (1968) (58)
Embeddings into Simple Groups (1976) (52)
Generic computability, Turing degrees, and asymptotic density (2010) (51)
Alternating automata and the temporal logic of ordinals (1997) (47)
Alternating automata on infinite objects, determinacy and Rabin's theorem (1984) (46)
Small cancellation theory over free products with amalgamation (1971) (38)
The Subadditive Ergodic Theorem and generic stretching factors for free group automorphisms (2005) (37)
Asymptotic density and computably Enumerable Sets (2013) (35)
Membership Problem for the Modular Group (2007) (35)
A characterization of inner automorphisms (1987) (31)
Sq-Universality in Hnn Groups and One Relator Groups (1974) (30)
A Survey of Small Cancellation Theory (1973) (28)
Coxeter Groups, 2-Completion, Perimeter Reduction and Subgroup Separability (2002) (27)
On one relator groups and HNN extensions (1973) (26)
Embeddings into hopfian groups (1971) (26)
On the hyperbolicity of small cancellation groups and one-relator groups (1998) (24)
Translation equivalence in free groups (2004) (24)
Groups and graphs (1979) (24)
On group-theoretic models of randomness and genericity (2007) (23)
On the substitution problem for free groups (1969) (20)
The geometry of higman‐neumann‐neumann extensions (1973) (20)
Automata on the Integers, Recurrence Distinguishability, and the Equivalence and Decidability of Monadic Theories (1986) (20)
Finiteness Conditions on Subgroups and Formal Language Theory (1989) (19)
Quadratic Equations in Groups, Cancellation Diagrams on Compact Surfaces, and Automorphisms of Surface Groups (1980) (19)
DENSITIES IN FREE GROUPS AND Z k , VISIBLE POINTS AND TEST ELEMENTS (2005) (19)
Asymptotic density and the coarse computability bound (2015) (18)
Context-free languages, groups, the theory of ends, second-order logic, tiling problems, cellular automata, and vector addition systems (1981) (18)
The conjugacy problem for the group of any tame alternating knot is solvable (1972) (17)
Delzant's $T$-invariant, Kolmogorov complexity and one-relator groups (2003) (15)
Delzant's T-invariant, one-relator groups and Kolmogorov complexity (2003) (15)
Densities in free groups and $\mathbb{Z}^k$, Visible Points and Test Elements (2005) (14)
COARSE REDUCIBILITY AND ALGORITHMIC RANDOMNESS (2015) (14)
On Greendlinger's lemma (1970) (13)
Asymptotic density and the Ershov hierarchy (2013) (12)
On the conjugacy problem for certain quotient groups of free products (1970) (12)
Random quotients of the modular group are rigid and essentially incompressible (2006) (11)
A survey of SQ-universality (1973) (10)
Bounded Rank Subgroups of Coxeter Groups, Artin Groups and One‐Relator Groups with Torsion (2002) (10)
Multipass automata and group word problems (2014) (10)
Asymptotic Density and the Theory of Computability: A Partial Survey (2016) (10)
Computational complexity and the conjugacy problem (2016) (10)
Pushdown automata, graphs, ends, second-order logic, and reachability problems (1981) (10)
Contributions to group theory (1984) (10)
Groups, graphs, languages, automata, games and second-order monadic logic (2012) (7)
Generic properties of Whitehead's Algorithm, stabilizers in Aut(Fk) and one-relator groups (2003) (7)
Some Reflections on HNN Extensions (1974) (7)
A Remark on Finitely Generated Subgroups of Free Groups (2000) (7)
On the Structure of Hamiltonian Cycles in Cayley Graphs of Finite Quotients of the Modular Group (1998) (6)
Arrays, Automata and Groups: Some Interconnections (1986) (6)
Relative Hyperbolicity and Artin Groups (2002) (5)
Lifting surface groups to SL(2, ℂ)* (1983) (4)
A note on recursively enumerable predicates in groups (1970) (2)
On the Decidability of the Linear Z-Temporal Logic and the Monadic Second Order Theory (1992) (2)
Small Cancellation Theory (2001) (1)
Computable permutations and word problems (2019) (1)
A Note on Non-Hopfian Groups (1977) (1)
CONTEXT-FREE LANGUAGES, GROUPS, THE THEORY OF ENDS, SECOND-ORDER LOGIC, TILING PROBLEMS, CELLULAR AUTOMATA, AND VECTOR SYSTEMS (2007) (1)
Coarse computability, the density metric, hausdorff distances between turing degrees, perfect trees, and reverse mathematics (2021) (1)
On the decidability of linear Z-temporal logic and the monadic second order theory of the integers (1992) (1)
CONTEXT-FREE LANGUAGES, GROUPS, THE THEORY OF ENDS, SECOND-ORDER LOGIC, TILING PROBLEMS, CELLULAR AUTOMATA, AND VECTOR SYSTEMS (2007) (1)
2 7 Ju l 2 00 5 ASYMPTOTIC DENSITY IN FREE GROUPS AND Z k , VISIBILE POINTS AND TEST ELEMENTS (2005) (0)
Generators and Relations (2001) (0)
Delzant's T-invariant and one-relator groups (2003) (0)
S ep 2 00 2 RELATIVE HYPERBOLICITY AND ARTIN GROUPS (2002) (0)
CERTAIN FREE GROUP FUNCTIONS AND UNTANGLING CLOSED CURVES ON SURFACES BY NEHA GUPTA (2016) (0)
Some Quantitative Aspects of Fractional Computability (2007) (0)
Reflections on Computer Experiments with Automorphisms of Free Groups (2014) (0)
Free Products and HNN Extensions (2001) (0)
Ju l 2 00 3 RELATIVE HYPERBOLICITY AND ARTIN GROUPS (2002) (0)
Asymptotic density in free groups and $\mathbb{Z}^k$, Visibile Points and Test Elements (2005) (0)
EQUIVALENCE IN FREE GROUPS (2006) (0)
Finite State Processes, Z-Temporal Logic and the Monadic Theory of the Integers (1992) (0)
On the Complexity of omega-Tree Sets and Nerode Theorem (1990) (0)
Free Groups and Their Subgroups (2001) (0)

This paper list is powered by the following services:

Other Resources About Paul Schupp

en.wikipedia.org

What Schools Are Affiliated With Paul Schupp?

Paul Schupp is affiliated with the following schools:

Image Attributions

Image Source for Paul Schupp