The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Douglas A. Cenzer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Douglas A. Cenzer, V. Wiktor Marek, Jeffrey B. Remmel
    Using Logic Programs to Reason about Infinite Sets. [Citation Graph (0, 0)][DBLP]
    AMAI, 2004, pp:- [Conf]
  2. Douglas A. Cenzer, Jeffrey B. Remmel, Amy Vanderbilt
    Characterizing the Set of Extensions of a Nonmonotonic Rule System with Levels. [Citation Graph (0, 0)][DBLP]
    AMAI, 2000, pp:- [Conf]
  3. Douglas A. Cenzer, Amy Vanderbilt
    Common Derivations in Locally Determined Logic Programs. [Citation Graph (0, 0)][DBLP]
    AMAI, 2002, pp:- [Conf]
  4. Douglas A. Cenzer, Jeffrey B. Remmel
    The Complexity of Inductive Definability. [Citation Graph (0, 0)][DBLP]
    CiE, 2005, pp:75-85 [Conf]
  5. Douglas A. Cenzer, William R. Moser
    Inductive Inference of Functions on the Rationals. [Citation Graph (0, 0)][DBLP]
    COLT, 1995, pp:178-181 [Conf]
  6. Douglas A. Cenzer
    Non-Generable RE Sets. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:379-385 [Conf]
  7. Douglas A. Cenzer, Jeffrey B. Remmel
    Feasibly Categorial Models. [Citation Graph (0, 0)][DBLP]
    LCC, 1994, pp:300-312 [Conf]
  8. Douglas A. Cenzer, Jeffrey B. Remmel, Amy Vanderbilt
    Locally Determined Logic Programs. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1999, pp:34-48 [Conf]
  9. Douglas A. Cenzer, William R. Moser
    A Good Oracle Is Hard to Beat. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:22, n:1/2, pp:18-34 [Journal]
  10. Douglas A. Cenzer, Jeffrey B. Remmel, Victor W. Marek
    Logic programming with infinite sets. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2005, v:44, n:4, pp:309-339 [Journal]
  11. Douglas A. Cenzer, Jeffrey B. Remmel, Amy Vanderbilt
    Locally Determined Logic Programs and Recursive Stable Models. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2004, v:40, n:3-4, pp:225-262 [Journal]
  12. Douglas A. Cenzer, Peter G. Hinman
    Density of the Medvedev lattice of Pi01 classes. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2003, v:42, n:6, pp:583-600 [Journal]
  13. Douglas A. Cenzer, Rodney G. Downey, Carl G. Jockusch Jr., Richard A. Shore
    Countable Thin Pi01 Classes. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1993, v:59, n:2, pp:79-139 [Journal]
  14. Douglas A. Cenzer, Jeffrey B. Remmel
    Polynomial-Time versus Recursive Models. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1991, v:54, n:1, pp:17-58 [Journal]
  15. Douglas A. Cenzer, Jeffrey B. Remmel
    Polynomial-Time Abelian Groups. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1992, v:56, n:1-3, pp:313-363 [Journal]
  16. Douglas A. Cenzer, Jeffrey B. Remmel
    Feasible Graphs with Standard Universe. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1998, v:94, n:1-3, pp:21-35 [Journal]
  17. Douglas A. Cenzer, Jeffrey B. Remmel
    Preface. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1998, v:93, n:1-3, pp:1-2 [Journal]
  18. Douglas A. Cenzer, Jeffrey B. Remmel
    Index Sets for Pi01 Classes. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1998, v:93, n:1-3, pp:3-61 [Journal]
  19. Douglas A. Cenzer
    Non-generable formal languages. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1980, v:3, n:1, pp:95-104 [Journal]
  20. Douglas A. Cenzer, Jeffrey B. Remmel
    Complexity and Categoricity. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1998, v:140, n:1, pp:2-25 [Journal]
  21. Andreas Blass, Douglas A. Cenzer
    Cores of pi11 Sets of Reals. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1974, v:39, n:4, pp:649-654 [Journal]
  22. Douglas A. Cenzer
    Analytic Inductive Definitions. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1974, v:39, n:2, pp:310-312 [Journal]
  23. Douglas A. Cenzer
    Monotone Inductive Definitions over the Continuum. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:1, pp:188-198 [Journal]
  24. Douglas A. Cenzer
    Monotone Reducibility and the Family of Infinite Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1984, v:49, n:3, pp:774-782 [Journal]
  25. Douglas A. Cenzer, André Nies
    Initial Segments of The Lattice of PI01 Classes. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2001, v:66, n:4, pp:1749-1765 [Journal]
  26. Douglas A. Cenzer, Rick L. Smith
    On the Ranked Points of A pi01 Set. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1989, v:54, n:3, pp:975-991 [Journal]
  27. Douglas A. Cenzer, Jeffrey B. Remmel
    Index sets for omega-languages. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2003, v:49, n:1, pp:22-33 [Journal]
  28. Jeffrey B. Remmel, Douglas A. Cenzer
    Feasible Graphs and Colorings. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1995, v:41, n:, pp:327-352 [Journal]
  29. Douglas A. Cenzer, Jeffrey B. Remmel
    Effectively closed sets and graphs of computable real functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:284, n:2, pp:279-318 [Journal]
  30. Douglas A. Cenzer, Jeffrey B. Remmel
    Index Sets in Computable Analysis. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:219, n:1-2, pp:111-150 [Journal]
  31. George Barmpalias, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber
    K -Trivial Closed Sets and Continuous Functions. [Citation Graph (0, 0)][DBLP]
    CiE, 2007, pp:135-145 [Conf]
  32. Douglas A. Cenzer, Geoffrey LaForte, Guohua Wu
    Pseudojump Operators and P01 Classes. [Citation Graph (0, 0)][DBLP]
    CiE, 2007, pp:146-151 [Conf]

  33. S01 and P01 Equivalence Structures. [Citation Graph (, )][DBLP]


  34. Computability of Countable Subshifts. [Citation Graph (, )][DBLP]


  35. Effectively closed sets and enumerations. [Citation Graph (, )][DBLP]


  36. Preface. [Citation Graph (, )][DBLP]


  37. Algorithmic randomness of continuous functions. [Citation Graph (, )][DBLP]


  38. Degrees of difficulty of generalized r.e. separating classes. [Citation Graph (, )][DBLP]


  39. Preface. [Citation Graph (, )][DBLP]


  40. Linear orders with distinguished function symbol. [Citation Graph (, )][DBLP]


  41. Effective categoricity of Abelian p-groups. [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.010secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002