☰

Douglas Cenzer - Publications

Affiliations: 
University of Florida, Gainesville, Gainesville, FL, United States 
Area:
Mathematics
Tree Info Similar researchers PubMed Report error

48 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Cenzer D, Marek VW, Remmel JB. On the complexity of index sets for finite predicate logic programs which allow function symbols Journal of Logic and Computation. 30: 107-156. DOI: 10.1093/Logcom/Exaa005  0.403
2018 Cenzer D, Porter CP. The Random Members of a ${\Pi }_{1}^{0}$ Class Theory of Computing Systems \/ Mathematical Systems Theory. 62: 1637-1671. DOI: 10.1007/S00224-017-9824-3  0.388
2017 Barmpalias G, Cenzer D, Porter CP. The Probability of a Computable Output from a Random Oracle Acm Transactions On Computational Logic. 18: 18. DOI: 10.1145/3091527  0.402
2016 Cenzer D, Marek VW, Remmel JB. Index sets for finite normal predicate logic programs with function symbols Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9537: 60-75. DOI: 10.1007/978-3-319-27683-0_5  0.349
2014 Buss S, Cenzer D, Remmel JB. Sub-computable bounded randomness Logical Methods in Computer Science. 10. DOI: 10.2168/Lmcs-10(4:15)2014  0.451
2014 Cenzer D, Harizanov V, Remmel JB. Computability-Theoretic Properties of Injection Structures Algebra and Logic. 53: 39-69. DOI: 10.1007/S10469-014-9270-0  0.394
2013 Cenzer D, Harizanov V, Remmel JB. Two-to-one structures Journal of Logic and Computation. 23: 1195-1223. DOI: 10.1093/Logcom/Ext040  0.36
2013 Cenzer D, Weber R. Effective Randomness of Unions and Intersections Theory of Computing Systems. 52: 48-64. DOI: 10.1007/S00224-012-9416-1  0.422
2013 Cenzer D, Remmel JB. Sub-computable bounded pseudorandomness Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7734: 104-118. DOI: 10.1007/978-3-642-35722-0_8  0.312
2012 Cenzer D, Remmel JB. A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs Annals of Mathematics and Artificial Intelligence. 65: 1-24. DOI: 10.1007/S10472-012-9294-X  0.443
2012 Cenzer D, Dashti A, Toska F, Wyman S. Computability of Countable Subshifts in One Dimension Theory of Computing Systems. 51: 352-371. DOI: 10.1007/S00224-011-9358-Z  0.73
2011 Brodhead P, Cenzer D, Toska F, Wyman S. Algorithmic randomness and capacity of closed sets Logical Methods in Computer Science. 7. DOI: 10.2168/Lmcs-7(3:16)2011  0.706
2011 Cenzer D, Harizanov V, Remmel JB. σ10 and Π10 equivalence structures Annals of Pure and Applied Logic. 162: 490-503. DOI: 10.1016/J.Apal.2011.01.002  0.307
2011 Cenzer D, Franklin JNY, Liu J, Wu G. A superhigh diamond in the c.e. tt-degrees Archive For Mathematical Logic. 50: 33-44. DOI: 10.1007/S00153-010-0198-3  0.307
2010 Cenzer D, Brodhead P. Effective capacity and randomness of closed sets Electronic Proceedings in Theoretical Computer Science, Eptcs. 24: 67-76. DOI: 10.4204/EPTCS.24.11  0.388
2009 Cenzer D, Laforte G, Remmel J. Equivalence structures and isomorphisms in the difference hierarchy Journal of Symbolic Logic. 74: 535-565. DOI: 10.2178/Jsl/1243948326  0.355
2009 Cenzer D, Laforte G, Wu G. Pseudojumps and Π01 classes Journal of Logic and Computation. 19: 77-87. DOI: 10.1093/Logcom/Exn028  0.33
2009 Barmpalias G, Cenzer D, Remmel JB, Weber R. K-triviality of closed sets and continuous functions Journal of Logic and Computation. 19: 3-16. DOI: 10.1093/Logcom/Exn021  0.365
2009 Cenzer D, Downey RG, Remmel JB, Uddin Z. Space complexity of Abelian groups Archive For Mathematical Logic. 48: 115-140. DOI: 10.1007/S00153-008-0113-3  0.678
2008 Cenzer D, Ali Dashti S, King JLF. Effective Symbolic Dynamics Electronic Notes in Theoretical Computer Science. 202: 89-99. DOI: 10.1016/J.Entcs.2008.03.010  0.382
2008 Brodhead P, Cenzer D. Effectively closed sets and enumerations Archive For Mathematical Logic. 46: 565-582. DOI: 10.1007/S00153-008-0065-7  0.78
2008 Barmpalias G, Brodhead P, Cenzer D, Remmel JB, Weber R. Algorithmic randomness of continuous functions Archive For Mathematical Logic. 46: 533-546. DOI: 10.1007/S00153-007-0060-4  0.77
2008 Cenzer D, Ali Dashti S, King JLF. Computable symbolic dynamics Mathematical Logic Quarterly. 54: 460-469. DOI: 10.1002/Malq.200710066  0.41
2007 Barmpalias G, Brodhead P, Cenzer D, Dashti S, Weber R. Algorithmic randomness of closed sets Journal of Logic and Computation. 17: 1041-1062. DOI: 10.1093/Logcom/Exm033  0.763
2007 Brodhead P, Cenzer D, Remmel JB. Random Continuous Functions Electronic Notes in Theoretical Computer Science. 167: 275-287. DOI: 10.1016/J.Entcs.2006.08.016  0.762
2007 Cenzer D, Hinman PG. Medvedev Degrees of Generalized R.E. separating Classes Electronic Notes in Theoretical Computer Science. 167: 203-223. DOI: 10.1016/J.Entcs.2006.08.014  0.368
2006 Cenzer D, Remmel JB. Complexity, decidability and completeness Journal of Symbolic Logic. 71: 399-424. DOI: 10.2178/jsl/1146620150  0.333
2006 Cenzer D, Remmel JB. On the complexity of inductive definitions Mathematical Structures in Computer Science. 16: 763-788. DOI: 10.1017/S0960129506005585  0.414
2006 Calvert W, Cenzer D, Harizanov V, Morozov A. Effective categoricity of equivalence structures Annals of Pure and Applied Logic. 141: 61-78. DOI: 10.1016/J.Apal.2005.10.002  0.432
2006 Brodhead P, Cenzer D, Dashti S. Random closed sets Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3988: 55-64. DOI: 10.1007/11780342_6  0.358
2005 Cenzer D, Remmel JB, Marek VW. Logic programming with infinite sets Annals of Mathematics and Artificial Intelligence. 44: 309-339. DOI: 10.1007/S10472-005-7030-5  0.394
2005 Cenzer D, Riazati F. Minimal extensions of II10 classes Mathematical Logic Quarterly. 51: 206-216. DOI: 10.1002/Malq.200410021  0.656
2005 Cenzer D, Remmel JB. The complexity of inductive definability Lecture Notes in Computer Science. 3526: 75-85.  0.31
2004 Cenzer D, Remmel JB, Vanderbilt A. Locally determined logic programs and recursive stable models Annals of Mathematics and Artificial Intelligence. 40: 225-262. DOI: 10.1023/B:Amai.0000012868.41613.E7  0.654
2004 Cenzer D, Remmel JB. Index sets for computable differential equations Mathematical Logic Quarterly. 50: 329-344. DOI: 10.1002/Malq.200310102  0.383
2002 Cenzer D, Remmel JB. Effectively closed sets and graphs of computable real functions Theoretical Computer Science. 284: 279-318. DOI: 10.1016/S0304-3975(01)00069-X  0.444
1999 Cenzer D, Remmel JB. Index sets in computable analysis Theoretical Computer Science. 219: 111-150. DOI: 10.1016/S0304-3975(98)00286-2  0.412
1999 Cenzer D. Chapter 2 Π10 Classes in computability theory Studies in Logic and the Foundations of Mathematics. 140: 37-85. DOI: 10.1016/S0049-237X(99)80018-4  0.394
1998 Cenzer D, Remmel JB. Chapter 13 Π10 classes in mathematics Studies in Logic and the Foundations of Mathematics. 139: 623-821. DOI: 10.1016/S0049-237X(98)80046-3  0.367
1998 Cenzer D, Remmel JB. Chapter 10 Complexity theoretic model theory and algebra Studies in Logic and the Foundations of Mathematics. 138: 381-513. DOI: 10.1016/S0049-237X(98)80011-6  0.379
1998 Cenzer D, Remmel JB. Complexity and categoricity Information and Computation. 140: 2-25. DOI: 10.1006/Inco.1997.2676  0.341
1995 Cenzer D, Remmel J. Feasible Graphs and Colorings Mathematical Logic Quarterly. 41: 327-352. DOI: 10.1002/Malq.19950410305  0.312
1993 Cenzer D, Downey R, Jockusch C, Shore RA. Countable thin Π01 classes Annals of Pure and Applied Logic. 59: 79-139. DOI: 10.1016/0168-0072(93)90001-T  0.305
1985 Cenzer D. The stability problem: New results and counterexamples Letters in Mathematical Physics. 10: 155-160. DOI: 10.1007/Bf00398152  0.321
1983 Cenzer D, Mauldin RD. Representations of Well-Founded Preference Orders Canadian Journal of Mathematics. 35: 496-508. DOI: 10.4153/Cjm-1983-027-4  0.344
1982 Cenzer D, Mauldin RD. On the Borel class of the derived set operator Bulletin De La SociéTé MathéMatique De France. 79: 357-380. DOI: 10.24033/Bsmf.1968  0.327
1978 Cenzer D, Howorka E. On vertex k-partitions of certain infinite graphs Discrete Mathematics. 23: 105-113. DOI: 10.1016/0012-365X(78)90110-3  0.342
1974 Blass A, Cenzer D. Cores of π11 sets of reals Journal of Symbolic Logic. 39: 649-654. DOI: 10.2307/2272848  0.318
Show low-probability matches.