The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Rodney G. Downey: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Rodney G. Downey, Michael R. Fellows
    Fixed-Parameter Tractability and Completeness I: Basic Results. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:4, pp:873-921 [Journal]
  2. Rodney G. Downey, Catherine McCartin
    Bounded Persistence Pathwidth. [Citation Graph (0, 0)][DBLP]
    CATS, 2005, pp:51-56 [Conf]
  3. Rodney G. Downey, Wolfgang Merkle, Jan Reimann
    Schnorr Dimension. [Citation Graph (0, 0)][DBLP]
    CiE, 2005, pp:96-105 [Conf]
  4. Rodney G. Downey, Michael R. Fellows
    Fixed-Parameter Intractability. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:36-49 [Conf]
  5. Rodney G. Downey, Lance Fortnow
    Uniformly Hard Languages. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1998, pp:228-0 [Conf]
  6. Rodney G. Downey, Steven Homer, William I. Gasarch, Michael Moses
    On Honest Polynomial Reductions, Relativizations, and P=NP. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:196-207 [Conf]
  7. Rodney G. Downey, André Nies
    Undecidability Results for Low Complexity Degree Structures. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:128-132 [Conf]
  8. Rodney G. Downey, Patricia A. Evans, Michael R. Fellows
    Parameterized Learning Complexity. [Citation Graph (0, 0)][DBLP]
    COLT, 1993, pp:51-57 [Conf]
  9. Peter Cholak, Efim B. Kinber, Rodney G. Downey, Martin Kummer, Lance Fortnow, Stuart A. Kurtz, William I. Gasarch, Theodore A. Slaman
    Degrees of Inferability. [Citation Graph (0, 0)][DBLP]
    COLT, 1992, pp:180-192 [Conf]
  10. Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham
    The Parameterized Complexity of Sequence Alignment and Consensus. [Citation Graph (0, 0)][DBLP]
    CPM, 1994, pp:15-30 [Conf]
  11. Rodney G. Downey, Michael R. Fellows
    Fixed Parameter Tractability and Completeness. [Citation Graph (0, 0)][DBLP]
    Complexity Theory: Current Research, 1992, pp:191-225 [Conf]
  12. Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger
    05301 Summary - Exact Algorithms and Fixed-Parameter Tractability. [Citation Graph (0, 0)][DBLP]
    Exact Algorithms and Fixed-Parameter Tractability, 2005, pp:- [Conf]
  13. Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger
    05301 Abstracts Collection - Exact Algorithms and Fixed-Parameter Tractability. [Citation Graph (0, 0)][DBLP]
    Exact Algorithms and Fixed-Parameter Tractability, 2005, pp:- [Conf]
  14. Rodney G. Downey, Catherine McCartin
    Some New Directions and Questions in Parameterized Complexity. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2004, pp:12-26 [Conf]
  15. Rodney G. Downey, Michael R. Fellows, Catherine McCartin
    Parameterized Approximation Problems. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2006, pp:121-129 [Conf]
  16. Rodney G. Downey, Catherine McCartin
    Online Problems, Pathwidth, and Persistence. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:13-24 [Conf]
  17. Rodney G. Downey
    Some Recent Progress in Algorithmic Randomness. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:42-83 [Conf]
  18. Rodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte
    Randomness and Reducibility. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:316-327 [Conf]
  19. Karl R. Abrahamson, Rodney G. Downey, Michael R. Fellows
    Fixed-Parameter Intractability II (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:374-385 [Conf]
  20. Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows
    On the Structure of Parameterized Problems in NP (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:509-520 [Conf]
  21. Rodney G. Downey, Denis R. Hirschfeldt, André Nies
    Randomness, Computability, and Density. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:195-205 [Conf]
  22. Karl R. Abrahamson, Rodney G. Downey, Michael R. Fellows
    Fixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogues. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1995, v:73, n:3, pp:235-276 [Journal]
  23. Colin Bailey, Rodney G. Downey
    Tabular Degrees in alpha-Recursion Theory. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1992, v:55, n:3, pp:205-236 [Journal]
  24. 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]
  25. Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows
    Advice Classes of Parameterized Tractability. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1997, v:84, n:1, pp:119-138 [Journal]
  26. Peter Cholak, Rodney G. Downey
    Lattice Nonembeddings and Intervals of the Recursively Enumerable Degrees. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1993, v:61, n:3, pp:195-221 [Journal]
  27. Peter Cholak, Rodney G. Downey, Eberhard Herrmann
    Some orbits for E. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2001, v:107, n:1-3, pp:193-226 [Journal]
  28. Chi Tat Chong, Rodney G. Downey
    Minimal Degrees Recursive in 1-Generic Degrees. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1990, v:48, n:3, pp:215-225 [Journal]
  29. Richard Coles, Rodney G. Downey, Carl G. Jockusch Jr., Geoffrey LaForte
    Completing pseudojump operators. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2005, v:136, n:3, pp:297-333 [Journal]
  30. Rodney G. Downey
    Intervals and Sublattices of the r.e. Weak Truth Table Degrees, Part I: Density. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1989, v:41, n:1, pp:1-26 [Journal]
  31. Rodney G. Downey
    Intervals and Sublattices of the r.e. Weak Truth Table Degrees, Part II: Nonbounding. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1989, v:44, n:3, pp:153-172 [Journal]
  32. Rodney G. Downey
    Corrigendum: Correction to ``Undecidability of L(Finfty) and Other Lattices of r.e. Substructures''. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1990, v:48, n:3, pp:299-301 [Journal]
  33. Rodney G. Downey
    Lattice Nonembeddings and Initial Segments of the Recursively Enumerable Degrees. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1990, v:49, n:2, pp:97-119 [Journal]
  34. Rodney G. Downey
    Every Recursive Boolean Algebra is Isomorphic to One with Incomplete Atoms. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1993, v:60, n:3, pp:193-206 [Journal]
  35. Rodney G. Downey, Zoltán Füredi, Carl G. Jockusch Jr., Lee A. Rubel
    Difference Sets and Computability Theory. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1998, v:93, n:1-3, pp:63-72 [Journal]
  36. Rodney G. Downey, Robert Goldblatt
    Foreword. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:138, n:1-3, pp:1-0 [Journal]
  37. Rodney G. Downey, William I. Gasarch, Michael Moses
    The Structure of the Honest Polynomial m-Degrees. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1994, v:70, n:2, pp:113-139 [Journal]
  38. Rodney G. Downey, Leo Harrington
    There is No Fat Orbit. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1996, v:80, n:3, pp:277-289 [Journal]
  39. Rodney G. Downey, Carl G. Jockusch Jr., Joseph S. Miller
    On self-embeddings of computable linear orderings. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:138, n:1-3, pp:52-76 [Journal]
  40. Rodney G. Downey, Geoffrey LaForte, André Nies
    Computably Enumerable Sets and Quasi-Reducibility. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1998, v:95, n:1-3, pp:1-35 [Journal]
  41. Rodney G. Downey, Jeffrey B. Remmel
    Classification of Degree Classes Associated with r.e. Subspaces. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1989, v:42, n:2, pp:105-124 [Journal]
  42. Rodney G. Downey, Theodore A. Slaman
    Completely Mitotic r.e. Degrees. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1989, v:41, n:2, pp:119-152 [Journal]
  43. Rodney G. Downey, Theodore A. Slaman
    On co-Simple Isols and Their Intersection Types. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1992, v:56, n:1-3, pp:221-237 [Journal]
  44. Rodney G. Downey, Michael Stob
    Splitting Theorems in Recursion Theory. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1993, v:65, n:1, pp:1-106 [Journal]
  45. Rodney G. Downey, Michael Stob
    Friedberg Splittings of Recursively Enumerable Sets. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1993, v:59, n:3, pp:175-199 [Journal]
  46. Rodney G. Downey, Richard A. Shore
    Splitting Theorems and the Jump Operator. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1998, v:94, n:1-3, pp:45-52 [Journal]
  47. Rodney G. Downey, Yang Yue
    A Rank one Cohesive Set. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1994, v:68, n:2, pp:161-171 [Journal]
  48. Liang Yu, Decheng Ding, Rodney G. Downey
    The Kolmogorov complexity of random reals. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2004, v:129, n:1-3, pp:163-180 [Journal]
  49. Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Michael T. Hallett, Harold T. Wareham
    Parameterized complexity analysis in computational biology. [Citation Graph (0, 0)][DBLP]
    Computer Applications in the Biosciences, 1995, v:11, n:1, pp:49-57 [Journal]
  50. Rodney G. Downey, Michael R. Fellows, Venkatesh Raman
    The complexity of irredundant sets parameterized by size. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:100, n:3, pp:155-167 [Journal]
  51. Rodney G. Downey, Michael R. Fellows, Ulrike Stege
    Computational Tractability: The View From Mars. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1999, v:69, n:, pp:73-97 [Journal]
  52. Rodney G. Downey, Vladimir Estivill-Castro, Michael R. Fellows, Elena Prieto, Frances A. Rosamond
    Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:78, n:, pp:- [Journal]
  53. Rodney G. Downey, Evan J. Griffiths
    Schnorr Randomness. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:66, n:1, pp:- [Journal]
  54. Rodney G. Downey, Denis R. Hirschfeldt, André Nies, Frank Stephan
    Trivial Reals. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:66, n:1, pp:- [Journal]
  55. Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows
    On the Structure of Parameterized Problems in NP. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:123, n:1, pp:38-49 [Journal]
  56. Rodney G. Downey
    Nondiamond Theorems for Polynomial Time Reducibility. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1992, v:45, n:3, pp:385-395 [Journal]
  57. Rodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte
    Randomness and reducibility. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:1, pp:96-114 [Journal]
  58. Rodney G. Downey, André Nies
    Undecidability Results for Low Complexity Time Classes. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:60, n:2, pp:465-479 [Journal]
  59. Rodney G. Downey, Catherine McCartin
    Online promise problems with online width metrics. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2007, v:73, n:1, pp:57-72 [Journal]
  60. Christopher J. Ash, Rodney G. Downey
    Decidable Subspaces and Recursively Enumerable Subspaces. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1984, v:49, n:4, pp:1137-1145 [Journal]
  61. Peter Cholak, Rodney G. Downey
    On the Cantor-Bendixon Rank of Recursively Enumerable Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1993, v:58, n:2, pp:629-640 [Journal]
  62. Peter Cholak, Rodney G. Downey, Stephen Walk
    Maximal Contiguous Degrees. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2002, v:67, n:1, pp:409-437 [Journal]
  63. Rodney G. Downey
    Co-Immune Subspaces and Complementation in V. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1984, v:49, n:2, pp:528-538 [Journal]
  64. Rodney G. Downey
    Bases of Supermaximal Subspaces and Steinitz Systems. I. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1984, v:49, n:4, pp:1146-1159 [Journal]
  65. Rodney G. Downey
    Recursively Enumerable m- and tt-Degrees. I: The Quantity of m- Degrees. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1989, v:54, n:2, pp:553-567 [Journal]
  66. Rodney G. Downey
    On Hyper-Torre Isols. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1989, v:54, n:4, pp:1160-1166 [Journal]
  67. Rodney G. Downey, Geoffrey R. Hird
    Automorphisms of Supermaximal Subspaces. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1985, v:50, n:1, pp:1-9 [Journal]
  68. Rodney G. Downey, Christine Ann Haught
    Embedding Lattices into the wtt-Degrees below 0'. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1994, v:59, n:4, pp:1360-1382 [Journal]
  69. Rodney G. Downey, Denis R. Hirschfeldt, Steffen Lempp, Reed Solomon
    A delta02 Set with No Infinite Low Subset in Either It or Its Complement. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2001, v:66, n:3, pp:1371-1381 [Journal]
  70. Rodney G. Downey, Carl G. Jockusch Jr.
    Effective Presentability of Boolean Algebras of Cantor-Bendixson Rank 1. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1999, v:64, n:1, pp:45-52 [Journal]
  71. Rodney G. Downey, Steffen Lempp
    Contiguity and Distributivity in The Enumerable Turing Degrees - Corrigendum. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2002, v:67, n:4, pp:1579-1580 [Journal]
  72. Rodney G. Downey, Steffen Lempp
    Contiguity and Distributivity in the Enumerable Turing Degrees. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1997, v:62, n:4, pp:1215-1240 [Journal]
  73. Rodney G. Downey, Geoffrey LaForte, Steffen Lempp
    A Delta02 Set With Barely Sigma02 Degree. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1999, v:64, n:4, pp:1700-1718 [Journal]
  74. Rodney G. Downey, Geoffrey LaForte, Richard A. Shore
    Decomposition and infima in the computably enumerable degrees. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2003, v:68, n:2, pp:551-579 [Journal]
  75. Rodney G. Downey, Jeffrey B. Remmel
    The Universal Complementation Property. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1984, v:49, n:4, pp:1125-1136 [Journal]
  76. Rodney G. Downey, Richard A. Shore
    Degree Theoretic Definitions of the low2 Recursively Enumerable Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1995, v:60, n:3, pp:727-756 [Journal]
  77. Rodney G. Downey, L. V. Welch
    Splitting Properties of R. E. Sets and Degrees. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1986, v:51, n:1, pp:88-109 [Journal]
  78. Bruno Courcelle, Rodney G. Downey, Michael R. Fellows
    A Note on the Computability of Graph Minor Obstruction Sets for Monadic Second Order Ideals. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1997, v:3, n:11, pp:1194-1198 [Journal]
  79. Rodney G. Downey
    On the Universal Splitting Property. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1997, v:43, n:, pp:311-320 [Journal]
  80. Rodney G. Downey, Sebastiaan Terwijn
    Computably Enumerable Reals and Uniformly Presentable Ideals. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2002, v:48, n:S1, pp:29-40 [Journal]
  81. Amy Gale, Rodney G. Downey
    On Genericity and Ershov's Hierarchy. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2001, v:47, n:2, pp:161-182 [Journal]
  82. Steffen Lempp, Rodney G. Downey, Richard A. Shore
    Highness and Bounding Minimal Pairs. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1993, v:39, n:, pp:475-491 [Journal]
  83. Rodney G. Downey
    On Pi10 Classes and their Ranked Points. [Citation Graph (0, 0)][DBLP]
    Notre Dame Journal of Formal Logic, 1991, v:32, n:4, pp:499-512 [Journal]
  84. Rich Blaylock, Rodney G. Downey, Steffen Lempp
    Infima in the Recursively Enumerable Weak Truth Table Degrees. [Citation Graph (0, 0)][DBLP]
    Notre Dame Journal of Formal Logic, 1997, v:38, n:3, pp:406-418 [Journal]
  85. Rodney G. Downey
    Roman Murawski, Recursive Functions and Metamathematics. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 2002, v:70, n:2, pp:297-299 [Journal]
  86. Rodney G. Downey, Michael R. Fellows, Alexander Vardy, Geoff Whittle
    The Parametrized Complexity of Some Fundamental Problems in Coding Theory. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:545-570 [Journal]
  87. Rodney G. Downey, Denis R. Hirschfeldt, André Nies
    Randomness, Computability, and Density. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:4, pp:1169-1183 [Journal]
  88. Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham
    The Parameterized Complexity of Sequence Alignment and Consensus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:147, n:1&2, pp:31-54 [Journal]
  89. Kevin Cattell, Michael J. Dinneen, Rodney G. Downey, Michael R. Fellows, Michael A. Langston
    On computing graph minor obstruction sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:233, n:1-2, pp:107-127 [Journal]
  90. Rodney G. Downey
    On Computational Complexity and Honest Polynomial Degrees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:78, n:2, pp:305-317 [Journal]
  91. Rodney G. Downey, Lance Fortnow
    Uniformly hard languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:2, n:298, pp:303-315 [Journal]
  92. Rodney G. Downey, Michael R. Fellows
    Fixed-Parameter Tractability and Completeness II: On Completeness for W[1]. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:141, n:1&2, pp:109-131 [Journal]
  93. Rodney G. Downey, Michael R. Fellows
    Threshold Dominating Sets and an Improved Characterization of W[2]. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:209, n:1-2, pp:123-140 [Journal]
  94. Rodney G. Downey, Michael R. Fellows, Kenneth W. Regan
    Parameterized Circuit Complexity and the W Hierarchy. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:191, n:1-2, pp:97-115 [Journal]
  95. Rodney G. Downey, Evan J. Griffiths, Stephanie Reid
    On Kurtz randomness. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:2-3, pp:249-270 [Journal]
  96. Rodney G. Downey, Geoffrey LaForte
    Presentations of computably enumerable reals. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:284, n:2, pp:539-555 [Journal]
  97. Rodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte
    Undecidability of the structure of the Solovay degrees of c.e. reals. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2007, v:73, n:5, pp:769-787 [Journal]

  98. On Problems without Polynomial Kernels (Extended Abstract). [Citation Graph (, )][DBLP]


  99. Index sets and parametric reductions. [Citation Graph (, )][DBLP]


  100. On the parameterized complexity of short computation and factorization. [Citation Graph (, )][DBLP]


  101. Space complexity of Abelian groups. [Citation Graph (, )][DBLP]


  102. Calibrating Randomness. [Citation Graph (, )][DBLP]


  103. The Complexity of Orbits of Computably Enumerable Sets. [Citation Graph (, )][DBLP]


  104. The Computer Journal Special Issue on Parameterized Complexity: Foreword by the Guest Editors. [Citation Graph (, )][DBLP]


Search in 0.065secs, Finished in 0.068secs
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