On mathematical contributions of Paul E. Schupp
From MaRDI portal
Publication:716386
zbMath1210.01035MaRDI QIDQ716386
Publication date: 28 April 2011
Published in: Illinois Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.ijm/1299679735
01A70: Biographies, obituaries, personalia, bibliographies
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
- Average-case complexity and decision problems in group theory.
- Genericity, the Arzhantseva-Ol'shanskii method and the isomorphism problem for one-relator groups.
- An analogue of a theorem of Magnus
- Artin groups and infinite Coxeter groups
- Groups, the theory of ends, and context-free languages
- Generic complexity of Presburger arithmetic
- Generic properties of Whitehead's algorithm and isomorphism rigidity of random one-relator groups.
- Peripheral fillings of relatively hyperbolic groups.
- The subadditive ergodic theorem and generic stretching factors for free group automorphisms.
- On group-theoretic models of randomness and genericity.
- The accessibility of finitely presented groups
- The theory of ends, pushdown automata, and second-order logic
- Alternating automata on infinite trees
- Alternating automata, the weak monadic theory of trees and its complexity
- On the structure of Hamiltonian cycles in Cayley graphs of finite quotients of the modular group
- Generic-case complexity, decision problems in group theory, and random walks.
- Random walk in random groups.
- The halting problem is decidable on a set of asymptotic probability one
- Densities in free groups and \(\mathbb{Z}^k\), visible points and test elements.
- On Dehn's algorithm and the conjugacy problem
- On the conjugacy problem for certain quotient groups of free products
- Small cancellation theory over free products with amalgamation
- Delzant's \(T\)-invariant, Kolmogorov complexity and one-relator groups.
- Dehn's algorithm for the word problem
- Generic complexity of undecidable problems
- Random quotients of the modular group are rigid and essentially incompressible
- Context-free languages, groups, the theory of ends, second-order logic, tiling problems, cellular automata, and vector addition systems
- ALMOST EVERY GROUP IS HYPERBOLIC
- On the hyperbolicity of small cancellation groups and one-relator groups
- On Dehn's algorithms for the conjugacy and word problems, with applications
- On Greendlinger's lemma
- Decidability of Second-Order Theories and Automata on Infinite Trees
- The Conjugacy Problem for the Group of Any Tame Alternating Knot is Solvable
