Paul E. Schupp

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Computational complexity and the conjugacy problem.
Computability, 2017

Asymptotic Density and the Theory of Computability: A Partial Survey.
Proceedings of the Computability and Complexity, 2017

2016
Coarse Reducibility and Algorithmic Randomness.
J. Symb. Log., 2016

Asymptotic density and the coarse computability bound.
Computability, 2016

2015
Multipass automata and group word problems.
Theor. Comput. Sci., 2015

Asymptotic density and the Ershov hierarchy.
Math. Log. Q., 2015

2014
Multipass automata and group word problems.
CoRR, 2014

2013
Asymptotic density and computably Enumerable Sets.
J. Mathematical Logic, 2013

2012
Generic computability, Turing degrees, and asymptotic density.
J. London Math. Society, 2012

Groups, graphs, languages, automata, games and second-order monadic logic.
Eur. J. Comb., 2012

2007
Membership Problem for the Modular Group.
SIAM J. Comput., 2007

Some Quantitative Aspects of Fractional Computability
CoRR, 2007

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

2002
Average-case complexity and decision problems in group theory
CoRR, 2002

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

1998
On the Structure of Hamiltonian Cycles in Cayley Graphs of Finite Quotients of the Modular Group.
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.
Theor. Comput. Sci., 1995

1992
Alternating Automata, the Weak Monadic Theory of Trees and its Complexity.
Theor. Comput. Sci., 1992

Finite State Processes, Z-Temporal Logic and the Monadic Theory of the Integers.
Int. J. Found. Comput. Sci., 1992

On the Decidability of the Linear Z-Temporal Logic and the Monadic Second Order Theory.
Proceedings of the Computing and Information, 1992

1990
On the Complexity of omega-Tree Sets and Nerode Theorem.
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
Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

1987
Alternating Automata on Infinite Trees.
Theor. Comput. Sci., 1987

1986
Arrays, Automata and Groups: Some Interconnections.
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
Proceedings of the Symposium on Logic in Computer Science (LICS '86), 1986

Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity.
Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

1985
The Theory of Ends, Pushdown Automata, and Second-Order Logic.
Theor. Comput. Sci., 1985

1984
Sur les Monoides À un Relateur qui sont des Groupes.
Theor. Comput. Sci., 1984

Alternating automata on infinite objects, determinacy and Rabin's theorem.
Proceedings of the Automata on Infinite Words, 1984

1983
Groups, the Theory of Ends, and Context-Free Languages.
J. Comput. Syst. Sci., 1983

1981
Pushdown Automata, Graphs, Ends, Second-Order Logic, and Reachability Problems
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981


  Loading...