Paul E. Schupp

33 papers A* 4C 1Journal 25Unranked 3

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	Coarse computability, the density metric, Hausdorff distances between Turing degrees, perfect trees, and reverse mathematics. J. Math. Log. Denis R. Hirschfeldt, Carl G. Jockusch Jr., Paul E. Schupp
2017	—	`conf`	Asymptotic Density and the Theory of Computability: A Partial Survey. Computability and Complexity Carl G. Jockusch Jr., Paul E. Schupp
2017	J	`jnl`	Computational complexity and the conjugacy problem. Comput. Alexei Miasnikov, Paul E. Schupp
2016	J	`jnl`	Asymptotic density and the coarse computability bound. Comput. Denis R. Hirschfeldt, Carl G. Jockusch Jr., Timothy H. McNicholl, Paul E. Schupp
2016	J	`jnl`	Coarse Reducibility and Algorithmic Randomness. J. Symb. Log. Denis R. Hirschfeldt, Carl G. Jockusch Jr., Rutger Kuyper, Paul E. Schupp
2015	J	`jnl`	Asymptotic density and the Ershov hierarchy. Math. Log. Q. Rod Downey, Carl G. Jockusch Jr., Timothy H. McNicholl, Paul E. Schupp
2015	J	`jnl`	Multipass automata and group word problems. Theor. Comput. Sci. Tullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi, Paul E. Schupp, Nicholas W. M. Touikan
2014	J	`jnl`	Multipass automata and group word problems. CoRR Tullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi, Paul E. Schupp
2013	J	`jnl`	Asymptotic density and computably Enumerable Sets. J. Math. Log. Rodney G. Downey, Carl G. Jockusch Jr., Paul E. Schupp
2012	J	`jnl`	Generic computability, Turing degrees, and asymptotic density. J. Lond. Math. Soc. Carl G. Jockusch Jr., Paul E. Schupp
2012	J	`jnl`	Groups, Graphs, Languages, Automata, Games and Second-order Monadic Logic CoRR Tullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi, Paul E. Schupp
2012	J	`jnl`	Groups, graphs, languages, automata, games and second-order monadic logic. Eur. J. Comb. Tullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi, Paul E. Schupp
2007	J	`jnl`	Membership Problem for the Modular Group. SIAM J. Comput. Yuri Gurevich, Paul E. Schupp
2007	J	`jnl`	Some Quantitative Aspects of Fractional Computability CoRR Ilya Kapovich, Paul E. Schupp
2003	J	`jnl`	Generic properties of Whitehead's Algorithm, stabilizers in Aut(F CoRR Ilya Kapovich, Paul E. Schupp, Vladimir Shpilrain
2002	J	`jnl`	Average-case complexity and decision problems in group theory CoRR Ilya Kapovich, Alexei G. Myasnikov, Paul E. Schupp, Vladimir Shpilrain
2002	J	`jnl`	Generic-case complexity, decision problems in group theory and random walks CoRR Ilya Kapovich, Alexei G. Myasnikov, Paul E. Schupp, Vladimir Shpilrain
1998	J	`jnl`	On the Structure of Hamiltonian Cycles in Cayley Graphs of Finite Quotients of the Modular Group. Theor. Comput. Sci. Paul E. Schupp
1995	J	`jnl`	Simulating Alternating Tree Automata by Nondeterministic Automata: New Results and New Proofs of the Theorems of Rabin, McNaughton and Safra. Theor. Comput. Sci. David E. Muller, Paul E. Schupp
1992	J	`jnl`	Alternating Automata, the Weak Monadic Theory of Trees and its Complexity. Theor. Comput. Sci. David E. Muller, Ahmed Saoudi, Paul E. Schupp
1992	J	`jnl`	Finite State Processes, Z-Temporal Logic and the Monadic Theory of the Integers. Int. J. Found. Comput. Sci. Ahmed Saoudi, David E. Muller, Paul E. Schupp
1992	C	`conf`	On the Decidability of the Linear Z-Temporal Logic and the Monadic Second Order Theory. ICCI David E. Muller, Paul E. Schupp, Ahmed Saoudi
1990	J	`jnl`	On the Complexity of omega-Tree Sets and Nerode Theorem. Int. J. Found. Comput. Sci. Ahmed Saoudi, David E. Muller, Paul E. Schupp
1988	A*	`conf`	Weak Alternating Automata Give a Simple Explanation of Why Most Temporal and Dynamic Logics are Decidable in Exponential Time LICS David E. Muller, Ahmed Saoudi, Paul E. Schupp
1987	J	`jnl`	Alternating Automata on Infinite Trees. Theor. Comput. Sci. David E. Muller, Paul E. Schupp
1986	A*	`conf`	Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity. ICALP David E. Muller, Ahmed Saoudi, Paul E. Schupp
1986	—	`conf`	Arrays, Automata and Groups: Some Interconnections. Automata Networks Paul E. Schupp
1986	A*	`conf`	Automata on the Integers, Recurrence Distinguishability, and the Equivalence and Decidability of Monadic Theories LICS Dominique Perrin, Paul E. Schupp
1985	J	`jnl`	The Theory of Ends, Pushdown Automata, and Second-Order Logic. Theor. Comput. Sci. David E. Muller, Paul E. Schupp
1984	—	`conf`	Alternating automata on infinite objects, determinacy and Rabin's theorem. Automata on Infinite Words David E. Muller, Paul E. Schupp
1984	J	`jnl`	Sur les Monoides À un Relateur qui sont des Groupes. Theor. Comput. Sci. Dominique Perrin, Paul E. Schupp
1983	J	`jnl`	Groups, the Theory of Ends, and Context-Free Languages. J. Comput. Syst. Sci. David E. Muller, Paul E. Schupp
1981	A*	`conf`	Pushdown Automata, Graphs, Ends, Second-Order Logic, and Reachability Problems STOC David E. Muller, Paul E. Schupp