Pushdown Automata, Graphs, Ends, Second-Order Logic, and Reachability Problems - David E. Muller; Paul E. Schupp (STOC, 1981)

Groups, the Theory of Ends, and Context-Free Languages. - David E. Muller; Paul E. Schupp (J. Comput. Syst. Sci., 1983)

Alternating automata on infinite objects, determinacy and Rabin's theorem. - David E. Muller; Paul E. Schupp (Automata on Infinite Words, 1984)

Sur les Monoides À un Relateur qui sont des Groupes. - Dominique Perrin; Paul E. Schupp (Theor. Comput. Sci., 1984)

The Theory of Ends, Pushdown Automata, and Second-Order Logic. - David E. Muller; Paul E. Schupp (Theor. Comput. Sci., 1985)

Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity. - David E. Muller; Ahmed Saoudi; Paul E. Schupp (ICALP, 1986)

Automata on the Integers, Recurrence Distinguishability, and the Equivalence and Decidability of Monadic Theories - Dominique Perrin; Paul E. Schupp (LICS, 1986)

Arrays, Automata and Groups: Some Interconnections. - Paul E. Schupp (Automata Networks, 1986)

Alternating Automata on Infinite Trees. - David E. Muller; Paul E. Schupp (Theor. Comput. Sci., 1987)

Weak Alternating Automata Give a Simple Explanation of Why Most Temporal and Dynamic Logics are Decidable in Exponential Time - David E. Muller; Ahmed Saoudi; Paul E. Schupp (LICS, 1988)

On the Complexity of omega-Tree Sets and Nerode Theorem. - Ahmed Saoudi; David E. Muller; Paul E. Schupp (Int. J. Found. Comput. Sci., 1990)

On the Decidability of the Linear Z-Temporal Logic and the Monadic Second Order Theory. - David E. Muller; Paul E. Schupp; Ahmed Saoudi (ICCI, 1992)

Finite State Processes, Z-Temporal Logic and the Monadic Theory of the Integers. - Ahmed Saoudi; David E. Muller; Paul E. Schupp (Int. J. Found. Comput. Sci., 1992)

Alternating Automata, the Weak Monadic Theory of Trees and its Complexity. - David E. Muller; Ahmed Saoudi; Paul E. Schupp (Theor. Comput. Sci., 1992)

Simulating Alternating Tree Automata by Nondeterministic Automata: New Results and New Proofs of the Theorems of Rabin, McNaughton and Safra. - David E. Muller; Paul E. Schupp (Theor. Comput. Sci., 1995)

On the Structure of Hamiltonian Cycles in Cayley Graphs of Finite Quotients of the Modular Group. - Paul E. Schupp (Theor. Comput. Sci., 1998)

Generic-case complexity, decision problems in group theory and random walks - Ilya Kapovich; Alexei G. Myasnikov; Paul E. Schupp; Vladimir Shpilrain (CoRR, 2002)

Average-case complexity and decision problems in group theory - Ilya Kapovich; Alexei G. Myasnikov; Paul E. Schupp; Vladimir Shpilrain (CoRR, 2002)

Generic properties of Whitehead's Algorithm, stabilizers in Aut(Fk) and one-relator groups - Ilya Kapovich; Paul E. Schupp; Vladimir Shpilrain (CoRR, 2003)

Some Quantitative Aspects of Fractional Computability - Ilya Kapovich; Paul E. Schupp (CoRR, 2007)

Membership Problem for the Modular Group. - Yuri Gurevich; Paul E. Schupp (SIAM J. Comput., 2007)

Groups, graphs, languages, automata, games and second-order monadic logic. - Tullio Ceccherini-Silberstein; Michel Coornaert; Francesca Fiorenzi; Paul E. Schupp (Eur. J. Comb., 2012)

Generic computability, Turing degrees, and asymptotic density. - Carl G. Jockusch Jr.; Paul E. Schupp (J. Lond. Math. Soc., 2012)

Asymptotic density and computably Enumerable Sets. - Rodney G. Downey; Carl G. Jockusch Jr.; Paul E. Schupp (J. Math. Log., 2013)

Multipass automata and group word problems. - Tullio Ceccherini-Silberstein; Michel Coornaert; Francesca Fiorenzi; Paul E. Schupp (CoRR, 2014)

Asymptotic density and the Ershov hierarchy. - Rod Downey; Carl G. Jockusch Jr.; Timothy H. McNicholl; Paul E. Schupp (Math. Log. Q., 2015)

Multipass automata and group word problems. - Tullio Ceccherini-Silberstein; Michel Coornaert; Francesca Fiorenzi; Paul E. Schupp; Nicholas W. M. Touikan (Theor. Comput. Sci., 2015)

Asymptotic density and the coarse computability bound. - Denis R. Hirschfeldt; Carl G. Jockusch Jr.; Timothy H. McNicholl; Paul E. Schupp (Comput., 2016)

Coarse Reducibility and Algorithmic Randomness. - Denis R. Hirschfeldt; Carl G. Jockusch Jr.; Rutger Kuyper; Paul E. Schupp (J. Symb. Log., 2016)

Asymptotic Density and the Theory of Computability: A Partial Survey. - Carl G. Jockusch Jr.; Paul E. Schupp (Computability and Complexity, 2017)

Computational complexity and the conjugacy problem. - Alexei Miasnikov; Paul E. Schupp (Comput., 2017)

Coarse computability, the density metric, Hausdorff distances between Turing degrees, perfect trees, and reverse mathematics. - Denis R. Hirschfeldt; Carl G. Jockusch Jr.; Paul E. Schupp (J. Math. Log., 2024)