Paul E. Schupp

According to our database, Paul E. Schupp authored at least 31 papers between 1981 and 2017.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2017

Computational complexity and the conjugacy problem.

Alexei Miasnikov, Paul E. Schupp

Comput., 2017

Asymptotic Density and the Theory of Computability: A Partial Survey.

Carl G. Jockusch Jr., Paul E. Schupp

Proceedings of the Computability and Complexity, 2017

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 coarse computability bound.

Denis R. Hirschfeldt, Carl G. Jockusch Jr., Timothy H. McNicholl, Paul E. Schupp

Comput., 2016

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 Ershov hierarchy.

Rod Downey, Carl G. Jockusch Jr., Timothy H. McNicholl, Paul E. Schupp

Math. Log. Q., 2015

2014

Multipass automata and group word problems.

Tullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi, Paul E. Schupp

CoRR, 2014

2013

Asymptotic density and computably Enumerable Sets.

Rodney G. Downey, Carl G. Jockusch Jr., Paul E. Schupp

J. Math. Log., 2013

2012

Generic computability, Turing degrees, and asymptotic density.

Carl G. Jockusch Jr., Paul E. Schupp

J. Lond. Math. Soc., 2012

Groups, graphs, languages, automata, games and second-order monadic logic.

Tullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi, Paul E. Schupp

Eur. J. Comb., 2012

2007

Membership Problem for the Modular Group.

Yuri Gurevich, Paul E. Schupp

SIAM J. Comput., 2007

Some Quantitative Aspects of Fractional Computability

Ilya Kapovich, Paul E. Schupp

CoRR, 2007

2003

Generic properties of Whitehead's Algorithm, stabilizers in Aut(F_k) and one-relator groups

Ilya Kapovich, Paul E. Schupp, Vladimir Shpilrain

CoRR, 2003

2002

Average-case complexity and decision problems in group theory

Ilya Kapovich, Alexei G. Myasnikov, Paul E. Schupp, Vladimir Shpilrain

CoRR, 2002

Generic-case complexity, decision problems in group theory and random walks

Ilya Kapovich, Alexei G. Myasnikov, Paul E. Schupp, Vladimir Shpilrain

CoRR, 2002

1998

On the Structure of Hamiltonian Cycles in Cayley Graphs of Finite Quotients of the Modular Group.

Paul E. Schupp

Theor. Comput. Sci., 1998

1995

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

1992

Alternating Automata, the Weak Monadic Theory of Trees and its Complexity.

David E. Muller, Ahmed Saoudi, Paul E. Schupp

Theor. Comput. Sci., 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

On the Decidability of the Linear Z-Temporal Logic and the Monadic Second Order Theory.

David E. Muller, Paul E. Schupp, Ahmed Saoudi

Proceedings of the Computing and Information, 1992

1990

On the Complexity of omega-Tree Sets and Nerode Theorem.

Ahmed Saoudi, David E. Muller, Paul E. Schupp

Int. J. Found. Comput. Sci., 1990

1988

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

Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

1987

Alternating Automata on Infinite Trees.

David E. Muller, Paul E. Schupp

Theor. Comput. Sci., 1987

1986

Arrays, Automata and Groups: Some Interconnections.

Paul E. Schupp

Proceedings of the Automata Networks, LITP Spring School on Theoretical Computer Science, 1986

Automata on the Integers, Recurrence Distinguishability, and the Equivalence and Decidability of Monadic Theories

Dominique Perrin, Paul E. Schupp

Proceedings of the Symposium on Logic in Computer Science (LICS '86), 1986

Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity.

David E. Muller, Ahmed Saoudi, Paul E. Schupp

Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

1985

The Theory of Ends, Pushdown Automata, and Second-Order Logic.

David E. Muller, Paul E. Schupp

Theor. Comput. Sci., 1985

1984

Sur les Monoides À un Relateur qui sont des Groupes.

Dominique Perrin, Paul E. Schupp

Theor. Comput. Sci., 1984

Alternating automata on infinite objects, determinacy and Rabin's theorem.

David E. Muller, Paul E. Schupp

Proceedings of the Automata on Infinite Words, 1984

1983

Groups, the Theory of Ends, and Context-Free Languages.

David E. Muller, Paul E. Schupp

J. Comput. Syst. Sci., 1983

1981

Pushdown Automata, Graphs, Ends, Second-Order Logic, and Reachability Problems

David E. Muller, Paul E. Schupp

Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981