default search action
Paul E. Schupp
Person information
- affiliation: University of Illinois at Urbana-Champaign, Department of Mathematics, Urbana, IL, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j19]Denis R. Hirschfeldt, Carl G. Jockusch Jr., Paul E. Schupp:
Coarse computability, the density metric, Hausdorff distances between Turing degrees, perfect trees, and reverse mathematics. J. Math. Log. 24(2): 2350005:1-2350005:76 (2024)
2010 – 2019
- 2017
- [j18]Alexei Miasnikov
, Paul E. Schupp:
Computational complexity and the conjugacy problem. Comput. 6(4): 307-318 (2017) - [c8]Carl G. Jockusch Jr., Paul E. Schupp:
Asymptotic Density and the Theory of Computability: A Partial Survey. Computability and Complexity 2017: 501-520 - 2016
- [j17]Denis R. Hirschfeldt, Carl G. Jockusch Jr., Timothy H. McNicholl, Paul E. Schupp:
Asymptotic density and the coarse computability bound. Comput. 5(1): 13-27 (2016) - [j16]Denis R. Hirschfeldt, Carl G. Jockusch Jr., Rutger Kuyper, Paul E. Schupp:
Coarse Reducibility and Algorithmic Randomness. J. Symb. Log. 81(3): 1028-1046 (2016) - 2015
- [j15]Rod Downey, Carl G. Jockusch Jr., Timothy H. McNicholl, Paul E. Schupp:
Asymptotic density and the Ershov hierarchy. Math. Log. Q. 61(3): 189-195 (2015) - [j14]Tullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi, Paul E. Schupp, Nicholas W. M. Touikan
Multipass automata and group word problems. Theor. Comput. Sci. 600: 19-33 (2015) - 2014
- [i6]Tullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi, Paul E. Schupp:
Multipass automata and group word problems. CoRR abs/1404.7442 (2014) - 2013
- [j13]Rodney G. Downey, Carl G. Jockusch Jr., Paul E. Schupp:
Asymptotic density and computably Enumerable Sets. J. Math. Log. 13(2): 1350005 (2013) - 2012
- [j12]Tullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi, Paul E. Schupp:
Groups, graphs, languages, automata, games and second-order monadic logic. Eur. J. Comb. 33(7): 1330-1368 (2012) - [j11]Carl G. Jockusch Jr., Paul E. Schupp:
Generic computability, Turing degrees, and asymptotic density. J. Lond. Math. Soc. 85(2): 472-490 (2012) - [i5]Tullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi, Paul E. Schupp:
Groups, Graphs, Languages, Automata, Games and Second-order Monadic Logic. CoRR abs/1201.3108 (2012)
2000 – 2009
- 2007
- [j10]Yuri Gurevich, Paul E. Schupp:
Membership Problem for the Modular Group. SIAM J. Comput. 37(2): 425-459 (2007) - [i4]Ilya Kapovich, Paul E. Schupp:
Some Quantitative Aspects of Fractional Computability. CoRR abs/0706.4095 (2007) - 2003
- [i3]Ilya Kapovich, Paul E. Schupp, Vladimir Shpilrain:
Generic properties of Whitehead's Algorithm, stabilizers in Aut(Fk) and one-relator groups. CoRR math.GR/0303386 (2003) - 2002
- [i2]Ilya Kapovich, Alexei G. Myasnikov, Paul E. Schupp, Vladimir Shpilrain:
Generic-case complexity, decision problems in group theory and random walks. CoRR math.GR/0203239 (2002) - [i1]Ilya Kapovich, Alexei G. Myasnikov, Paul E. Schupp, Vladimir Shpilrain:
Average-case complexity and decision problems in group theory. CoRR math.GR/0206273 (2002)
1990 – 1999
- 1998
- [j9]Paul E. Schupp:
On the Structure of Hamiltonian Cycles in Cayley Graphs of Finite Quotients of the Modular Group. Theor. Comput. Sci. 204(1-2): 233-248 (1998) - 1995
- [j8]David E. Muller, Paul E. Schupp:
Simulating Alternating Tree Automata by Nondeterministic Automata: New Results and New Proofs of the Theorems of Rabin, McNaughton and Safra. Theor. Comput. Sci. 141(1&2): 69-107 (1995) - 1992
- [j7]Ahmed Saoudi, David E. Muller, Paul E. Schupp:
Finite State Processes, Z-Temporal Logic and the Monadic Theory of the Integers. Int. J. Found. Comput. Sci. 3(3): 233-244 (1992) - [j6]David E. Muller, Ahmed Saoudi, Paul E. Schupp:
Alternating Automata, the Weak Monadic Theory of Trees and its Complexity. Theor. Comput. Sci. 97(2): 233-244 (1992) - [c7]David E. Muller, Paul E. Schupp, Ahmed Saoudi:
On the Decidability of the Linear Z-Temporal Logic and the Monadic Second Order Theory. ICCI 1992: 2-5 - 1990
- [j5]Ahmed Saoudi, David E. Muller, Paul E. Schupp:
On the Complexity of omega-Tree Sets and Nerode Theorem. Int. J. Found. Comput. Sci. 1(1): 11-22 (1990)
1980 – 1989
- 1988
- [c6]David E. Muller, Ahmed Saoudi, Paul E. Schupp:
Weak Alternating Automata Give a Simple Explanation of Why Most Temporal and Dynamic Logics are Decidable in Exponential Time. LICS 1988: 422-427 - 1987
- [j4]David E. Muller, Paul E. Schupp:
Alternating Automata on Infinite Trees. Theor. Comput. Sci. 54: 267-276 (1987) - 1986
- [c5]David E. Muller, Ahmed Saoudi, Paul E. Schupp:
Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity. ICALP 1986: 275-283 - [c4]Dominique Perrin, Paul E. Schupp:
Automata on the Integers, Recurrence Distinguishability, and the Equivalence and Decidability of Monadic Theories. LICS 1986: 301-304 - [c3]Paul E. Schupp:
Arrays, Automata and Groups: Some Interconnections. Automata Networks 1986: 19-28 - 1985
- [j3]David E. Muller, Paul E. Schupp:
The Theory of Ends, Pushdown Automata, and Second-Order Logic. Theor. Comput. Sci. 37: 51-75 (1985) - 1984
- [j2]Dominique Perrin, Paul E. Schupp:
Sur les Monoides À un Relateur qui sont des Groupes. Theor. Comput. Sci. 33: 331-334 (1984) - [c2]David E. Muller, Paul E. Schupp:
Alternating automata on infinite objects, determinacy and Rabin's theorem. Automata on Infinite Words 1984: 100-107 - 1983
- [j1]David E. Muller, Paul E. Schupp:
Groups, the Theory of Ends, and Context-Free Languages. J. Comput. Syst. Sci. 26(3): 295-310 (1983) - 1981
- [c1]David E. Muller, Paul E. Schupp:
Pushdown Automata, Graphs, Ends, Second-Order Logic, and Reachability Problems. STOC 1981: 46-54
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: