Douglas A. Cenzer

Douglas Cenzer

	2011
68		Douglas Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel: Effective Categoricity of Injection Structures. CiE 2011: 51-60
67		Douglas Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel: Σ01 and Π01 equivalence structures. Ann. Pure Appl. Logic 162(7): 490-503 (2011)
66		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)
65		Douglas Cenzer, Paul Brodhead, Ferit Toska, Sebastian Wyman: Algorithmic Randomness and Capacity of Closed Sets Logical Methods in Computer Science 7(3): (2011)
	2010
64		Douglas Cenzer, Paul Brodhead: Effective Capacity and Randomness of Closed Sets CCA 2010: 67-76
63		Douglas A. Cenzer, S. Ali Dashti, Ferit Toska, Sebastian Wyman: Computability of Countable Subshifts. CiE 2010: 88-97
	2009
62		Douglas Cenzer, Rebecca Weber, Guohua Wu: Immunity for Closed Sets. CiE 2009: 109-117
61		Douglas A. Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel: S01 and P01 Equivalence Structures. CiE 2009: 99-108
60		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
59		Wesley Calvert, Douglas A. Cenzer, Valentina S. Harizanov, Andrei S. Morozov: Effective categoricity of Abelian p-groups. Ann. Pure Appl. Logic 159(1-2): 187-197 (2009)
58		Douglas A. Cenzer, Valentina S. Harizanov, David Marker, Carol Wood: Preface. Arch. Math. Log. 48(1): 1-6 (2009)
57		Douglas Cenzer, Rodney G. Downey, Jeffrey B. Remmel, Zia Uddin: Space complexity of Abelian groups. Arch. Math. Log. 48(1): 115-140 (2009)
56		Douglas A. Cenzer, Barbara F. Csima, Bakhadyr Khoussainov: Linear orders with distinguished function symbol. Arch. Math. Log. 48(1): 63-76 (2009)
55		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)
54		Douglas A. Cenzer, Geoffrey LaForte, Guohua Wu: Pseudojumps and Pi10 Classes. J. Log. Comput. 19(1): 77-87 (2009)
53		Douglas Cenzer, Geoffrey LaForte, Jeffrey B. Remmel: Equivalence structures and isomorphisms in the difference hierarchy. J. Symb. Log. 74(2): 535-556 (2009)
	2008
52		Douglas Cenzer, Jeffrey B. Remmel: A Connection between Cantor-Bendixson Derivatives and the Well-Founded Semantics of Logic Programs. ISAIM 2008
51		Douglas A. Cenzer, Rebecca Weber: Preface. Arch. Math. Log. 46(7-8): 529-531 (2008)
50		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)
49		Paul Brodhead, Douglas A. Cenzer: Effectively closed sets and enumerations. Arch. Math. Log. 46(7-8): 565-582 (2008)
48		Douglas A. Cenzer, Peter G. Hinman: Degrees of difficulty of generalized r.e. separating classes. Arch. Math. Log. 46(7-8): 629-647 (2008)
47		Douglas Cenzer, S. Ali Dashti, Jonathan L. F. King: Effective Symbolic Dynamics. Electr. Notes Theor. Comput. Sci. 202: 89-99 (2008)
46		Douglas Cenzer, S. Ali Dashti, Jonathan L. F. King: Computable symbolic dynamics. Math. Log. Q. 54(5): 460-469 (2008)
	2007
45		George Barmpalias, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber: K -Trivial Closed Sets and Continuous Functions. CiE 2007: 135-145
44		Douglas A. Cenzer, Geoffrey LaForte, Guohua Wu: Pseudojump Operators and P01 Classes. CiE 2007: 146-151
43		Douglas Cenzer, Ruth Dillhage, Tanja Grubba, Klaus Weihrauch: Preface. Electr. Notes Theor. Comput. Sci. 167: 1-2 (2007)
42		Douglas Cenzer, Peter G. Hinman: Medvedev Degrees of Generalized R.E. separating Classes. Electr. Notes Theor. Comput. Sci. 167: 203-223 (2007)
41		Paul Brodhead, Douglas Cenzer, Jeffrey B. Remmel: Random Continuous Functions. Electr. Notes Theor. Comput. Sci. 167: 275-287 (2007)
40		George Barmpalias, Paul Brodhead, Douglas Cenzer, Seyyed Dashti, Rebecca Weber: Algorithmic Randomness of Closed Sets. J. Log. Comput. 17(6): 1041-1062 (2007)
	2006
39		Paul Brodhead, Douglas Cenzer, Seyyed Dashti: Random Closed Sets. CiE 2006: 55-64
38		Douglas Cenzer, Zia Uddin: Logspace Complexity of Functions and Structures. CiE 2006: 75-84
37		Wesley Calvert, Douglas Cenzer, Valentina S. Harizanov, Andrei S. Morozov: Effective categoricity of equivalence structures. Ann. Pure Appl. Logic 141(1-2): 61-78 (2006)
36		Douglas A. Cenzer, Jeffrey B. Remmel: Complexity, decidability and completeness. J. Symb. Log. 71(2): 399-424 (2006)
35		Douglas A. Cenzer, Jeffrey B. Remmel: On the complexity of inductive definitions. Mathematical Structures in Computer Science 16(5): 763-788 (2006)
	2005
34		Douglas A. Cenzer, Jeffrey B. Remmel: The Complexity of Inductive Definability. CiE 2005: 75-85
33		Douglas A. Cenzer, Jeffrey B. Remmel, Victor W. Marek: Logic programming with infinite sets. Ann. Math. Artif. Intell. 44(4): 309-339 (2005)
32		Douglas Cenzer, Farzan Riazati: Minimal extensions of Pi01 classes. Math. Log. Q. 51(2): 206-216 (2005)
	2004
31		Douglas A. Cenzer, V. Wiktor Marek, Jeffrey B. Remmel: Using Logic Programs to Reason about Infinite Sets. AMAI 2004
30		Douglas Cenzer, V. Wiktor Marek, Jeffrey B. Remmel: Using Logic Programs to Reason about Infinite Sets. ISAIM 2004
29		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)
28		Douglas Cenzer, Jeffrey B. Remmel: Index sets for computable differential equations. Math. Log. Q. 50(4-5): 329-344 (2004)
	2003
27		Douglas A. Cenzer, Peter G. Hinman: Density of the Medvedev lattice of Pi01 classes. Arch. Math. Log. 42(6): 583-600 (2003)
26		Douglas A. Cenzer, Jeffrey B. Remmel: Index sets for omega-languages. Math. Log. Q. 49(1): 22-33 (2003)
	2002
25		Douglas A. Cenzer, Amy Vanderbilt: Common Derivations in Locally Determined Logic Programs. AMAI 2002
24		Douglas Cenzer, Amy Vanderbilt: Common Derivations in Locally Determined Logic Programs. ISAIM 2002
23		Douglas A. Cenzer, Jeffrey B. Remmel: Effectively closed sets and graphs of computable real functions. Theor. Comput. Sci. 284(2): 279-318 (2002)
	2001
22		Douglas A. Cenzer, André Nies: Initial Segments of The Lattice of PI01 Classes. J. Symb. Log. 66(4): 1749-1765 (2001)
	2000
21		Douglas A. Cenzer, Jeffrey B. Remmel, Amy Vanderbilt: Characterizing the Set of Extensions of a Nonmonotonic Rule System with Levels. AMAI 2000
	1999
20		Douglas A. Cenzer, Jeffrey B. Remmel, Amy Vanderbilt: Locally Determined Logic Programs. LPNMR 1999: 34-48
19		Douglas A. Cenzer, Jeffrey B. Remmel: Index Sets in Computable Analysis. Theor. Comput. Sci. 219(1-2): 111-150 (1999)
	1998
18		Douglas A. Cenzer, William R. Moser: A Good Oracle Is Hard to Beat. Algorithmica 22(1/2): 18-34 (1998)
17		Douglas A. Cenzer, Jeffrey B. Remmel: Preface. Ann. Pure Appl. Logic 93(1-3): 1-2 (1998)
16		Douglas A. Cenzer, Jeffrey B. Remmel: Index Sets for Pi01 Classes. Ann. Pure Appl. Logic 93(1-3): 3-61 (1998)
15		Douglas A. Cenzer, Jeffrey B. Remmel: Feasible Graphs with Standard Universe. Ann. Pure Appl. Logic 94(1-3): 21-35 (1998)
14		Douglas A. Cenzer, Jeffrey B. Remmel: Complexity and Categoricity. Inf. Comput. 140(1): 2-25 (1998)
	1995
13		Douglas A. Cenzer, William R. Moser: Inductive Inference of Functions on the Rationals. COLT 1995: 178-181
12		Jeffrey B. Remmel, Douglas A. Cenzer: Feasible Graphs and Colorings. Math. Log. Q. 41: 327-352 (1995)
	1994
11		Douglas A. Cenzer, Jeffrey B. Remmel: Feasibly Categorial Models. LCC 1994: 300-312
	1993
10		Douglas A. Cenzer, Rodney G. Downey, Carl G. Jockusch Jr., Richard A. Shore: Countable Thin Pi01 Classes. Ann. Pure Appl. Logic 59(2): 79-139 (1993)
	1992
9		Douglas A. Cenzer, Jeffrey B. Remmel: Polynomial-Time Abelian Groups. Ann. Pure Appl. Logic 56(1-3): 313-363 (1992)
	1991
8		Douglas A. Cenzer, Jeffrey B. Remmel: Polynomial-Time versus Recursive Models. Ann. Pure Appl. Logic 54(1): 17-58 (1991)
	1989
7		Douglas A. Cenzer, Rick L. Smith: On the Ranked Points of A pi01 Set. J. Symb. Log. 54(3): 975-991 (1989)
	1984
6		Douglas A. Cenzer: Monotone Reducibility and the Family of Infinite Sets. J. Symb. Log. 49(3): 774-782 (1984)
	1980
5		Douglas A. Cenzer: Non-generable formal languages. Fundam. Inform. 3(1): 95-104 (1980)
	1977
4		Douglas A. Cenzer: Non-Generable RE Sets. FCT 1977: 379-385
	1976
3		Douglas A. Cenzer: Monotone Inductive Definitions over the Continuum. J. Symb. Log. 41(1): 188-198 (1976)
	1974
2		Douglas A. Cenzer: Analytic Inductive Definitions. J. Symb. Log. 39(2): 310-312 (1974)
1		Andreas Blass, Douglas A. Cenzer: Cores of pi11 Sets of Reals. J. Symb. Log. 39(4): 649-654 (1974)

Coauthor Index

1	George Barmpalias	[40] [45] [50] [55]
2	Andreas Blass	[1]
3	Paul Brodhead	[39] [40] [41] [49] [50] [64] [65]
4	Wesley Calvert	[37] [59]
5	Barbara F. Csima	[56]
6	S. Ali Dashti	[46] [47] [63]
7	Seyyed Dashti	[39] [40]
8	Ruth Dillhage	[43]
9	Rodney G. Downey (Rod Downey)	[10] [57]
10	Johanna N. Y. Franklin	[60] [66]
11	Tanja Grubba	[43]
12	Valentina S. Harizanov	[37] [58] [59] [61] [67] [68]
13	Peter G. Hinman	[27] [42] [48]
14	Carl G. Jockusch Jr.	[10]
15	Bakhadyr Khoussainov	[56]
16	Jonathan L. F. King	[46] [47]
17	Geoffrey LaForte	[44] [53] [54]
18	Jiang Liu	[60] [66]
19	Victor W. Marek (V. Wiktor Marek)	[30] [31] [33]
20	David Marker	[58]
21	Andrei S. Morozov	[37] [59]
22	William R. Moser	[13] [18]
23	André Nies	[22]
24	Jeffrey B. Remmel	[8] [9] [11] [12] [14] [15] [16] [17] [19] [20] [21] [23] [26] [28] [29] [30] [31] [33] [34] [35] [36] [41] [45] [50] [52] [53] [55] [57] [61] [67] [68]
25	Farzan Riazati	[32]
26	Richard A. Shore	[10]
27	Rick L. Smith	[7]
28	Ferit Toska	[63] [65]
29	Zia Uddin	[38] [57]
30	Amy Vanderbilt	[20] [21] [24] [25] [29]
31	Rebecca Weber	[40] [45] [50] [51] [55] [62]
32	Klaus Weihrauch	[43]
33	Carol Wood	[58]
34	Guohua Wu	[44] [54] [60] [62] [66]
35	Sebastian Wyman	[63] [65]

Colors in the list of coauthors

Last update Tue May 29 01:28:40 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page