default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDouglas A. Cenzer
Person information
- affiliation: University of Florida, Gainesville, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j60]Douglas Cenzer, Christopher P. Porter:
Randomness extraction in computability theory. Comput. 12(1): 1-21 (2023)- [c33]Wesley Calvert, Douglas Cenzer, Valentina S. Harizanov:
Generically Computable Abelian Groups. UCNC 2023: 32-45 - [c32]Douglas Cenzer, Cameron Fraize, Christopher P. Porter:
Extraction Rates of Random Continuous Functionals. UCNC 2023: 46-63 - 2022
- [j59]Wesley Calvert, Douglas Cenzer, Valentina S. Harizanov:
Generically and coarsely computable isomorphisms. Comput. 11(3-4): 223-239 (2022) - [j58]Wesley Calvert, Douglas Cenzer, Valentina S. Harizanov:
Densely computable structures. J. Log. Comput. 32(3): 581-607 (2022) - [j57]Richard Krogman, Douglas Cenzer:
Complexity of injection structures induced by finite state transducers. J. Log. Comput. 32(8): 1504-1530 (2022) - [c31]Douglas Cenzer
, Richard Krogman:
The Isomorphism Problem for FST Injection Structures. LFCS 2022: 25-36 - 2021
- [c30]Richard Krogman, Douglas Cenzer:
Complexity and Categoricity of Injection Structures Induced by Finite State Transducers. CiE 2021: 106-119 - 2020
- [j56]Douglas Cenzer, Victor W. Marek, Jeffrey B. Remmel:
On the complexity of index sets for finite predicate logic programs which allow function symbols. J. Log. Comput. 30(1): 107-156 (2020) - [j55]Jacob Carson, Douglas Cenzer, Jeffrey B. Remmel:
Effective Categoricity of Automatic Equivalence and Nested Equivalence Structures. Theory Comput. Syst. 64(6): 1110-1139 (2020)
2010 – 2019
- 2018
- [j54]Douglas Cenzer, Christopher P. Porter:
The Random Members of a Π10 Class. Theory Comput. Syst. 62(7): 1637-1671 (2018) - [c29]Douglas Cenzer, Diego A. Rojas:
Online Computability and Differentiation in the Cantor Space. CiE 2018: 136-145 - 2017
- [j53]Francis Adams, Douglas Cenzer:
Computability and categoricity of weakly ultrahomogeneous structures. Comput. 6(4): 365-389 (2017) - [j52]George Barmpalias, Douglas Cenzer, Christopher P. Porter:
Random numbers as probabilities of machine behavior. Theor. Comput. Sci. 673: 1-18 (2017) - [j51]George Barmpalias, Douglas Cenzer, Christopher P. Porter:
The Probability of a Computable Output from a Random Oracle. ACM Trans. Comput. Log. 18(3): 18:1-18:15 (2017) - [c28]Sam Buss, Douglas Cenzer, Mia Minnes, Jeffrey B. Remmel:
Injection Structures Specified by Finite State Transducers. Computability and Complexity 2017: 394-417 - 2016
- [c27]Douglas A. Cenzer, Victor W. Marek, Jeffrey B. Remmel:
Index Sets for Finite Normal Predicate Logic Programs with Function Symbols. LFCS 2016: 60-75 - [i3]George Barmpalias, Douglas A. Cenzer, Christopher P. Porter:
Random numbers as probabilities of machine behaviour. CoRR abs/1605.05838 (2016) - [i2]George Barmpalias, Douglas Cenzer, Christopher P. Porter:
The probability of a computable output from a random oracle. CoRR abs/1612.08537 (2016) - 2015
- [c26]Douglas Cenzer, Christopher P. Porter:
Algorithmically Random Functions and Effective Capacities. TAMC 2015: 23-37 - 2014
- [j50]Sam Buss, Douglas Cenzer, Jeffrey B. Remmel:
Sub-computable Boundedness Randomness. Log. Methods Comput. Sci. 10(4) (2014) - [c25]Francis Adams, Douglas Cenzer:
Computability and Categoricity of Ultrahomogeneous Structures. CiE 2014: 1-10 - 2013
- [j49]Douglas Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel:
Two-to-one structures. J. Log. Comput. 23(6): 1195-1223 (2013) - [j48]Douglas Cenzer, Rebecca Weber:
Effective Randomness of Unions and Intersections. Theory Comput. Syst. 52(1): 48-64 (2013) - [c24]Douglas Cenzer, Jeffrey B. Remmel:
Sub-computable Bounded Pseudorandomness. LFCS 2013: 104-118 - [i1]Douglas Cenzer, Victor W. Marek, Jeffrey B. Remmel:
Index sets for Finite Normal Predicate Logic Programs. CoRR abs/1303.6555 (2013) - 2012
- [j47]Douglas Cenzer, Jeffrey B. Remmel:
A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs. Ann. Math. Artif. Intell. 65(1): 1-24 (2012) - [j46]Douglas Cenzer, S. Ali Dashti, Ferit Toska, Sebastian Wyman:
Computability of Countable Subshifts in One Dimension. Theory Comput. Syst. 51(3): 352-371 (2012) - 2011
- [j45]Douglas Cenzer, Johanna N. Y. Franklin, Jiang Liu, Guohua Wu:
A superhigh diamond in the c.e. tt-degrees. Arch. Math. Log. 50(1-2): 33-44 (2011) - [j44]Douglas Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel:
Σ01 and Π01 equivalence structures. Ann. Pure Appl. Log. 162(7): 490-503 (2011) - [j43]Douglas Cenzer, Paul Brodhead, Ferit Toska, Sebastian Wyman:
Algorithmic Randomness and Capacity of Closed Sets. Log. Methods Comput. Sci. 7(3) (2011) - [c23]Douglas Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel:
Effective Categoricity of Injection Structures. CiE 2011: 51-60 - 2010
- [c22]Douglas A. Cenzer, S. Ali Dashti, Ferit Toska, Sebastian Wyman:
Computability of Countable Subshifts. CiE 2010: 88-97 - [c21]Douglas Cenzer, Paul Brodhead:
Effective Capacity and Randomness of Closed Sets. CCA 2010: 67-76
2000 – 2009
- 2009
- [j42]Douglas A. Cenzer, Valentina S. Harizanov, David Marker, Carol Wood:
Preface. Arch. Math. Log. 48(1): 1-6 (2009) - [j41]Douglas A. Cenzer, Barbara F. Csima, Bakhadyr Khoussainov:
Linear orders with distinguished function symbol. Arch. Math. Log. 48(1): 63-76 (2009) - [j40]Douglas Cenzer, Rodney G. Downey, Jeffrey B. Remmel, Zia Uddin:
Space complexity of Abelian groups. Arch. Math. Log. 48(1): 115-140 (2009) - [j39]Wesley Calvert, Douglas A. Cenzer, Valentina S. Harizanov, Andrei S. Morozov:
Effective categoricity of Abelian p-groups. Ann. Pure Appl. Log. 159(1-2): 187-197 (2009) - [j38]Douglas Cenzer, Geoffrey LaForte, Jeffrey B. Remmel:
Equivalence structures and isomorphisms in the difference hierarchy. J. Symb. Log. 74(2): 535-556 (2009) - [j37]George Barmpalias, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber:
K-Triviality of Closed Sets and Continuous Functions. J. Log. Comput. 19(1): 3-16 (2009) - [j36]Douglas A. Cenzer, Geoffrey LaForte, Guohua Wu:
Pseudojumps and Pi10 Classes. J. Log. Comput. 19(1): 77-87 (2009) - [c20]Douglas A. Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel:
S01 and P01 Equivalence Structures. CiE 2009: 99-108 - [c19]Douglas Cenzer, Rebecca Weber, Guohua Wu:
Immunity for Closed Sets. CiE 2009: 109-117 - [c18]Douglas Cenzer, Johanna N. Y. Franklin, Jiang Liu, Guohua Wu:
Embedding the Diamond Lattice in the c.e. tt-Degrees with Superhigh Atoms. TAMC 2009: 420-429 - 2008
- [j35]Douglas A. Cenzer, Rebecca Weber:
Preface. Arch. Math. Log. 46(7-8): 529-531 (2008) - [j34]George Barmpalias, Paul Brodhead, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber:
Algorithmic randomness of continuous functions. Arch. Math. Log. 46(7-8): 533-546 (2008) - [j33]Paul Brodhead, Douglas A. Cenzer:
Effectively closed sets and enumerations. Arch. Math. Log. 46(7-8): 565-582 (2008) - [j32]Douglas A. Cenzer, Peter G. Hinman:
Degrees of difficulty of generalized r.e. separating classes. Arch. Math. Log. 46(7-8): 629-647 (2008) - [j31]Douglas Cenzer, S. Ali Dashti, Jonathan L. F. King:
Computable symbolic dynamics. Math. Log. Q. 54(5): 460-469 (2008) - [c17]Douglas Cenzer, Jeffrey B. Remmel:
A Connection between Cantor-Bendixson Derivatives and the Well-Founded Semantics of Logic Programs. ISAIM 2008 - 2007
- [j30]George Barmpalias, Paul Brodhead, Douglas Cenzer, Seyyed Dashti, Rebecca Weber:
Algorithmic Randomness of Closed Sets. J. Log. Comput. 17(6): 1041-1062 (2007) - [c16]George Barmpalias, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber:
K -Trivial Closed Sets and Continuous Functions. CiE 2007: 135-145 - [c15]Douglas A. Cenzer, Geoffrey LaForte, Guohua Wu:
Pseudojump Operators and P01 Classes. CiE 2007: 146-151 - [c14]Douglas Cenzer, S. Ali Dashti, Jonathan L. F. King:
Effective Symbolic Dynamics. CCA 2007: 89-99 - [e1]Douglas Cenzer, Ruth Dillhage, Tanja Grubba, Klaus Weihrauch:
Proceedings of the Third International Conference on Computability and Complexity in Analysis, CCA 2006, November 1-5, 2006, University of Florida, Gainesville, USA. Electronic Notes in Theoretical Computer Science 167, Elsevier 2007 [contents] - 2006
- [j29]Wesley Calvert, Douglas Cenzer, Valentina S. Harizanov, Andrei S. Morozov:
Effective categoricity of equivalence structures. Ann. Pure Appl. Log. 141(1-2): 61-78 (2006) - [j28]Douglas A. Cenzer, Jeffrey B. Remmel:
Complexity, decidability and completeness. J. Symb. Log. 71(2): 399-424 (2006) - [j27]Douglas A. Cenzer, Jeffrey B. Remmel:
On the complexity of inductive definitions. Math. Struct. Comput. Sci. 16(5): 763-788 (2006) - [c13]Paul Brodhead, Douglas Cenzer, Seyyed Dashti:
Random Closed Sets. CiE 2006: 55-64 - [c12]Douglas Cenzer, Zia Uddin:
Logspace Complexity of Functions and Structures. CiE 2006: 75-84 - [c11]Douglas Cenzer, Ruth Dillhage, Tanja Grubba, Klaus Weihrauch:
Preface. CCA 2006: 1-2 - [c10]Douglas Cenzer, Peter G. Hinman:
Medvedev Degrees of Generalized R.E. separating Classes. CCA 2006: 203-223 - [c9]Paul Brodhead, Douglas Cenzer, Jeffrey B. Remmel:
Random Continuous Functions. CCA 2006: 275-287 - 2005
- [j26]Douglas A. Cenzer, Jeffrey B. Remmel, Victor W. Marek:
Logic programming with infinite sets. Ann. Math. Artif. Intell. 44(4): 309-339 (2005) - [j25]Douglas Cenzer, Farzan Riazati:
Minimal extensions of Pi01 classes. Math. Log. Q. 51(2): 206-216 (2005) - [c8]Douglas A. Cenzer, Jeffrey B. Remmel:
The Complexity of Inductive Definability. CiE 2005: 75-85 - 2004
- [j24]Douglas A. Cenzer, Jeffrey B. Remmel, Amy Vanderbilt:
Locally Determined Logic Programs and Recursive Stable Models. Ann. Math. Artif. Intell. 40(3-4): 225-262 (2004) - [j23]Douglas Cenzer, Jeffrey B. Remmel:
Index sets for computable differential equations. Math. Log. Q. 50(4-5): 329-344 (2004) - [c7]Douglas Cenzer, V. Wiktor Marek, Jeffrey B. Remmel:
Using Logic Programs to Reason about Infinite Sets. AI&M 2004 - 2003
- [j22]Douglas A. Cenzer, Peter G. Hinman:
Density of the Medvedev lattice of Pi01 classes. Arch. Math. Log. 42(6): 583-600 (2003) - [j21]Douglas A. Cenzer, Jeffrey B. Remmel:
Index sets for omega-languages. Math. Log. Q. 49(1): 22-33 (2003) - 2002
- [j20]Douglas A. Cenzer, Jeffrey B. Remmel:
Effectively closed sets and graphs of computable real functions. Theor. Comput. Sci. 284(2): 279-318 (2002) - [c6]Douglas Cenzer, Amy Vanderbilt:
Common Derivations in Locally Determined Logic Programs. AI&M 2002 - 2001
- [j19]Douglas A. Cenzer, André Nies:
Initial Segments of The Lattice of PI01 Classes. J. Symb. Log. 66(4): 1749-1765 (2001) - 2000
- [c5]Douglas A. Cenzer, Jeffrey B. Remmel, Amy Vanderbilt:
Characterizing the Set of Extensions of a Nonmonotonic Rule System with Levels. AI&M 2000
1990 – 1999
- 1999
- [j18]Douglas A. Cenzer, Jeffrey B. Remmel:
Index Sets in Computable Analysis. Theor. Comput. Sci. 219(1-2): 111-150 (1999) - [c4]Douglas A. Cenzer, Jeffrey B. Remmel, Amy Vanderbilt:
Locally Determined Logic Programs. LPNMR 1999: 34-48 - [p1]Douglas Cenzer:
∏10 Classes in Computability Theory. Handbook of Computability Theory 1999: 37-85 - 1998
- [j17]Douglas A. Cenzer, William R. Moser:
A Good Oracle Is Hard to Beat. Algorithmica 22(1/2): 18-34 (1998) - [j16]Douglas A. Cenzer, Jeffrey B. Remmel:
Preface. Ann. Pure Appl. Log. 93(1-3): 1-2 (1998) - [j15]Douglas A. Cenzer, Jeffrey B. Remmel:
Index Sets for Pi01 Classes. Ann. Pure Appl. Log. 93(1-3): 3-61 (1998) - [j14]Douglas A. Cenzer, Jeffrey B. Remmel:
Feasible Graphs with Standard Universe. Ann. Pure Appl. Log. 94(1-3): 21-35 (1998) - [j13]Douglas A. Cenzer, Jeffrey B. Remmel:
Complexity and Categoricity. Inf. Comput. 140(1): 2-25 (1998) - 1995
- [j12]Jeffrey B. Remmel, Douglas A. Cenzer:
Feasible Graphs and Colorings. Math. Log. Q. 41: 327-352 (1995) - [c3]Douglas A. Cenzer, William R. Moser:
Inductive Inference of Functions on the Rationals. COLT 1995: 178-181 - 1994
- [c2]Douglas A. Cenzer, Jeffrey B. Remmel:
Feasibly Categorial Models. LCC 1994: 300-312 - 1993
- [j11]Douglas A. Cenzer, Rodney G. Downey, Carl G. Jockusch Jr., Richard A. Shore:
Countable Thin Pi01 Classes. Ann. Pure Appl. Log. 59(2): 79-139 (1993) - 1992
- [j10]Douglas A. Cenzer, Jeffrey B. Remmel:
Polynomial-Time Abelian Groups. Ann. Pure Appl. Log. 56(1-3): 313-363 (1992) - 1991
- [j9]Douglas A. Cenzer, Jeffrey B. Remmel:
Polynomial-Time versus Recursive Models. Ann. Pure Appl. Log. 54(1): 17-58 (1991)
1980 – 1989
- 1989
- [j8]Douglas A. Cenzer, Rick L. Smith:
On the Ranked Points of A pi01 Set. J. Symb. Log. 54(3): 975-991 (1989) - 1986
- [j7]Douglas A. Cenzer, Peter Clote, Rick L. Smith, Robert I. Soare, Stanley S. Wainer:
Members of countable π10 classes. Ann. Pure Appl. Log. 31: 145-163 (1986) - 1984
- [j6]Douglas A. Cenzer:
Monotone Reducibility and the Family of Infinite Sets. J. Symb. Log. 49(3): 774-782 (1984) - 1980
- [j5]Douglas A. Cenzer:
Non-generable formal languages. Fundam. Informaticae 3(1): 95-104 (1980)
1970 – 1979
- 1978
- [j4]Douglas Cenzer, Edward Howorka:
On vertex k-partitions of certain infinite graphs. Discret. Math. 23(2): 105-113 (1978) - 1977
- [c1]Douglas A. Cenzer:
Non-Generable RE Sets. FCT 1977: 379-385 - 1976
- [j3]Douglas A. Cenzer:
Monotone Inductive Definitions over the Continuum. J. Symb. Log. 41(1): 188-198 (1976) - 1974
- [j2]Douglas A. Cenzer:
Analytic Inductive Definitions. J. Symb. Log. 39(2): 310-312 (1974) - [j1]Andreas Blass, Douglas A. Cenzer:
Cores of pi11 Sets of Reals. J. Symb. Log. 39(4): 649-654 (1974)
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-05-02 20:58 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:
