Rodney G. Downey

Rod Downey

	2012
143		Rod Downey: Randomness, Computation and Mathematics. CiE 2012: 162-181
142		Paul Brodhead, Rod Downey, Keng Meng Ng: Bounded Randomness. Computation, Physics and Beyond 2012: 59-70
141		Rod Downey: A Parameterized Complexity Tutorial. LATA 2012: 38-56
140		Verónica Becher, Laurent Bienvenu, Rodney G. Downey, Elvira Mayordomo: Computability, Complexity and Randomness (Dagstuhl Seminar 12021). Dagstuhl Reports 2(1): 19-38 (2012)
	2011
139		Rodney G. Downey, Dimitrios M. Thilikos: Confronting Intractability via Parameters CoRR abs/1106.3161: (2011)
138		Rodney G. Downey, Noam Greenberg, Carl G. Jockusch Jr., Kevin G. Milans: Binary subtrees with few labeled paths. Combinatorica 31(3): 285-303 (2011)
137		Rodney G. Downey, Dimitrios M. Thilikos: Confronting intractability via parameters. Computer Science Review 5(4): 279-317 (2011)
136		George Barmpalias, Rod Downey, Keng Meng Ng: Jump inversions inside effectively closed sets and applications to randomness. J. Symb. Log. 76(2): 491-518 (2011)
135		Barbara F. Csima, Rod Downey, Keng Meng Ng: Limits on jump inversion for strong reducibilities. J. Symb. Log. 76(4): 1287-1296 (2011)
134		Rodney G. Downey, Asher M. Kach: Euclidean Functions of Computable Euclidean Domains. Notre Dame Journal of Formal Logic 52(2): 163-172 (2011)
	2010
133		Rodney G. Downey, Sergei S. Goncharov, Asher M. Kach, Julia F. Knight, Oleg V. Kudinov, Alexander G. Melnikov, Daniel Turetsky: Decidability and Computability of Certain Torsion-Free Abelian Groups. Notre Dame Journal of Formal Logic 51(1): 85-96 (2010)
132		Rod Downey, Keng Meng Ng: Effective Packing Dimension and Traceability. Notre Dame Journal of Formal Logic 51(2): 279-290 (2010)
	2009
131		Rod Downey, Keng Meng Ng: Lowness for Demuth Randomness. CiE 2009: 154-166
130		Laurent Bienvenu, Rod Downey: Kolmogorov Complexity and Solovay Functions. STACS 2009: 147-158
129		Douglas Cenzer, Rodney G. Downey, Jeffrey B. Remmel, Zia Uddin: Space complexity of Abelian groups. Arch. Math. Log. 48(1): 115-140 (2009)
128		Laurent Bienvenu, Rod Downey: Kolmogorov Complexity and Solovay Functions CoRR abs/0902.1041: (2009)
127		Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin: On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8): 423-434 (2009)
126		Rodney G. Downey, Bart Kastermans, Steffen Lempp: On computable self-embeddings of computable linear orderings. J. Symb. Log. 74(4): 1352-1366 (2009)
	2008
125		Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, Moshe Y. Vardi: Algorithmic-Logical Theory of Infinite Structures, 28.10. - 02.11.2007 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008
124		Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin: On Problems without Polynomial Kernels (Extended Abstract). ICALP (1) 2008: 563-574
123		Rod Downey, Noam Greenberg, Joseph S. Miller: The upward closure of a perfect thin class. Ann. Pure Appl. Logic 156(1): 51-58 (2008)
122		Peter Cholak, Rodney G. Downey, Leo Harrington: The Complexity of Orbits of Computably Enumerable Sets. Bulletin of Symbolic Logic 14(1): 69-87 (2008)
121		Rodney G. Downey, Michael R. Fellows, Michael A. Langston: The Computer Journal Special Issue on Parameterized Complexity: Foreword by the Guest Editors. Comput. J. 51(1): 1-6 (2008)
120		Rod Downey, Noam Greenberg: Turing degrees of reals of positive effective packing dimension. Inf. Process. Lett. 108(5): 298-303 (2008)
119		Rodney G. Downey, Michael R. Fellows, Catherine McCartin, Frances A. Rosamond: Parameterized approximation of dominating set problems. Inf. Process. Lett. 109(1): 68-70 (2008)
	2007
118		Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, Moshe Y. Vardi: 07441 Abstracts Collection -- Algorithmic-Logical Theory of Infinite Structures. Algorithmic-Logical Theory of Infinite Structures 2007
117		Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, Moshe Y. Vardi: 07441 Summary -- Algorithmic-Logical Theory of Infinite Structures. Algorithmic-Logical Theory of Infinite Structures 2007
116		Rod Downey, Jörg Flum, Martin Grohe, Mark Weyer: Bounded fixed-parameter tractability and reducibility. Ann. Pure Appl. Logic 148(1-3): 1-19 (2007)
115		Rodney G. Downey, Catherine McCartin: Online promise problems with online width metrics. J. Comput. Syst. Sci. 73(1): 57-72 (2007)
114		Rodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte: Undecidability of the structure of the Solovay degrees of c.e. reals. J. Comput. Syst. Sci. 73(5): 769-787 (2007)
113		Rodney G. Downey, Jan Reimann: Algorithmic randomness. Scholarpedia 2(10): 2574 (2007)
112		Rod Downey: Foreword. Theory Comput. Syst. 41(3): 397 (2007)
	2006
111		Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger: Exact Algorithms and Fixed-Parameter Tractability, 24.-27. July 2005 Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006
110		Rodney G. Downey, Michael R. Fellows, Catherine McCartin: Parameterized Approximation Problems. IWPEC 2006: 121-129
109		Rod Downey, Noam Greenberg: Totally < ωω Computably Enumerable and m-topped Degrees. TAMC 2006: 46-60
108		Rodney G. Downey, Robert Goldblatt: Foreword. Ann. Pure Appl. Logic 138(1-3): 1- (2006)
107		Rodney G. Downey, Carl G. Jockusch Jr., Joseph S. Miller: On self-embeddings of computable linear orderings. Ann. Pure Appl. Logic 138(1-3): 52-76 (2006)
106		Rod Downey, Liang Yu: Arithmetical Sacks Forcing. Arch. Math. Log. 45(6): 715-720 (2006)
105		Rodney G. Downey, Denis R. Hirschfeldt, André Nies, Sebastiaan Terwijn: Calibrating Randomness. Bulletin of Symbolic Logic 12(3): 411-491 (2006)
104		Rod Downey, André Nies, Rebecca Weber, Liang Yu: Lowness and Pi20 nullsets. J. Symb. Log. 71(3): 1044-1052 (2006)
103		Barbara F. Csima, Rod Downey, Noam Greenberg, Denis R. Hirschfeldt, Joseph S. Miller: Every 1-generic computes a properly 1-generic. J. Symb. Log. 71(4): 1385-1393 (2006)
102		Rodney G. Downey, Wolfgang Merkle, Jan Reimann: Schnorr dimension. Mathematical Structures in Computer Science 16(5): 789-811 (2006)
101		Rod Downey, Michael A. Langston, Rolf Niedermeier: Editorial. Theor. Comput. Sci. 351(3): 295 (2006)
	2005
100		Rodney G. Downey, Catherine McCartin: Bounded Persistence Pathwidth. CATS 2005: 51-56
99		Rodney G. Downey, Wolfgang Merkle, Jan Reimann: Schnorr Dimension. CiE 2005: 96-105
98		Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger: 05301 Abstracts Collection - Exact Algorithms and Fixed-Parameter Tractability. Exact Algorithms and Fixed-Parameter Tractability 2005
97		Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger: 05301 Summary - Exact Algorithms and Fixed-Parameter Tractability. Exact Algorithms and Fixed-Parameter Tractability 2005
96		Richard Coles, Rodney G. Downey, Carl G. Jockusch Jr., Geoffrey LaForte: Completing pseudojump operators. Ann. Pure Appl. Logic 136(3): 297-333 (2005)
	2004
95		Rodney G. Downey, Michael R. Fellows, Frank K. H. A. Dehne: Parameterized and Exact Computation, First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings Springer 2004
94		Rodney G. Downey, Catherine McCartin: Some New Directions and Questions in Parameterized Complexity. Developments in Language Theory 2004: 12-26
93		Rodney G. Downey, Catherine McCartin: Online Problems, Pathwidth, and Persistence. IWPEC 2004: 13-24
92		Rodney G. Downey: Some Recent Progress in Algorithmic Randomness. MFCS 2004: 42-83
91		Rod Downey, Angsheng Li, Guohua Wu: Complementing cappable degrees in the difference hierarchy. Ann. Pure Appl. Logic 125(1-3): 101-118 (2004)
90		Liang Yu, Decheng Ding, Rodney G. Downey: The Kolmogorov complexity of random reals. Ann. Pure Appl. Logic 129(1-3): 163-180 (2004)
89		Rodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte: Randomness and reducibility. J. Comput. Syst. Sci. 68(1): 96-114 (2004)
88		Rodney G. Downey, Evan J. Griffiths: Schnorr randomness. J. Symb. Log. 69(2): 533-554 (2004)
87		Rod Downey, Guohua Wu, Xizhong Zheng: Degrees of d. c. e. reals. Math. Log. Q. 50(4-5): 345-350 (2004)
86		Rod Downey, Evan J. Griffiths, Geoffrey LaForte: On Schnorr and computable randomness, martingales, and machines. Math. Log. Q. 50(6): 613-627 (2004)
85		Rod Downey, Liang Yu: There Are No Maximal Low D.C.E. Degrees. Notre Dame Journal of Formal Logic 45(3): 147-159 (2004)
84		Rodney G. Downey, Evan J. Griffiths, Stephanie Reid: On Kurtz randomness. Theor. Comput. Sci. 321(2-3): 249-270 (2004)
	2003
83		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. Electr. Notes Theor. Comput. Sci. 78: 209-222 (2003)
82		Rodney G. Downey, Geoffrey LaForte, Richard A. Shore: Decomposition and infima in the computably enumerable degrees. J. Symb. Log. 68(2): 551-579 (2003)
81		Rodney G. Downey, Lance Fortnow: Uniformly hard languages. Theor. Comput. Sci. 2(298): 303-315 (2003)
	2002
80		Rodney G. Downey, Evan J. Griffiths: Schnorr Randomness. Electr. Notes Theor. Comput. Sci. 66(1): 25-35 (2002)
79		Rodney G. Downey, Denis R. Hirschfeldt, André Nies, Frank Stephan: Trivial Reals. Electr. Notes Theor. Comput. Sci. 66(1): 36-52 (2002)
78		Peter Cholak, Rodney G. Downey, Stephen Walk: Maximal Contiguous Degrees. J. Symb. Log. 67(1): 409-437 (2002)
77		Rodney G. Downey, Steffen Lempp: Contiguity and Distributivity in The Enumerable Turing Degrees - Corrigendum. J. Symb. Log. 67(4): 1579-1580 (2002)
76		Rodney G. Downey, Sebastiaan Terwijn: Computably Enumerable Reals and Uniformly Presentable Ideals. Math. Log. Q. 48(S1): 29-40 (2002)
75		Rodney G. Downey, Denis R. Hirschfeldt, André Nies: Randomness, Computability, and Density. SIAM J. Comput. 31(4): 1169-1183 (2002)
74		Rodney G. Downey: Roman Murawski, Recursive Functions and Metamathematics. Studia Logica 70(2): 297-299 (2002)
73		Rodney G. Downey, Geoffrey LaForte: Presentations of computably enumerable reals. Theor. Comput. Sci. 284(2): 539-555 (2002)
	2001
72		Rodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte: Randomness and Reducibility. MFCS 2001: 316-327
71		Rodney G. Downey, Denis R. Hirschfeldt, André Nies: Randomness, Computability, and Density. STACS 2001: 195-205
70		Peter Cholak, Rodney G. Downey, Eberhard Herrmann: Some orbits for E. Ann. Pure Appl. Logic 107(1-3): 193-226 (2001)
69		Rodney G. Downey, Michael R. Fellows: Index sets and parametric reductions. Arch. Math. Log. 40(5): 329-348 (2001)
68		Rodney G. Downey, Denis R. Hirschfeldt, Steffen Lempp, Reed Solomon: A delta02 Set with No Infinite Low Subset in Either It or Its Complement. J. Symb. Log. 66(3): 1371-1381 (2001)
67		Amy Gale, Rodney G. Downey: On Genericity and Ershov's Hierarchy. Math. Log. Q. 47(2): 161-182 (2001)
	2000
66		Rodney G. Downey, Michael R. Fellows, Venkatesh Raman: The complexity of irredundant sets parameterized by size. Discrete Applied Mathematics 100(3): 155-167 (2000)
65		Rodney G. Downey, André Nies: Undecidability Results for Low Complexity Time Classes. J. Comput. Syst. Sci. 60(2): 465-479 (2000)
64		Kevin Cattell, Michael J. Dinneen, Rodney G. Downey, Michael R. Fellows, Michael A. Langston: On computing graph minor obstruction sets. Theor. Comput. Sci. 233(1-2): 107-127 (2000)
	1999
63		Rodney G. Downey, Michael R. Fellows, Ulrike Stege: Computational Tractability: The View From Mars. Bulletin of the EATCS 69: 73-97 (1999)
62		Rodney G. Downey, Carl G. Jockusch Jr.: Effective Presentability of Boolean Algebras of Cantor-Bendixson Rank 1. J. Symb. Log. 64(1): 45-52 (1999)
61		Rodney G. Downey, Geoffrey LaForte, Steffen Lempp: A Delta02 Set With Barely Sigma02 Degree. J. Symb. Log. 64(4): 1700-1718 (1999)
60		Rodney G. Downey, Michael R. Fellows, Alexander Vardy, Geoff Whittle: The Parametrized Complexity of Some Fundamental Problems in Coding Theory. SIAM J. Comput. 29(2): 545-570 (1999)
	1998
59		Rodney G. Downey, Lance Fortnow: Uniformly Hard Languages. IEEE Conference on Computational Complexity 1998: 228-
58		Rodney G. Downey, Zoltán Füredi, Carl G. Jockusch Jr., Lee A. Rubel: Difference Sets and Computability Theory. Ann. Pure Appl. Logic 93(1-3): 63-72 (1998)
57		Rodney G. Downey, Richard A. Shore: Splitting Theorems and the Jump Operator. Ann. Pure Appl. Logic 94(1-3): 45-52 (1998)
56		Rodney G. Downey, Geoffrey LaForte, André Nies: Computably Enumerable Sets and Quasi-Reducibility. Ann. Pure Appl. Logic 95(1-3): 1-35 (1998)
55		Rodney G. Downey, Michael R. Fellows, Kenneth W. Regan: Parameterized Circuit Complexity and the W Hierarchy. Theor. Comput. Sci. 191(1-2): 97-115 (1998)
54		Rodney G. Downey, Michael R. Fellows: Threshold Dominating Sets and an Improved Characterization of W[2]. Theor. Comput. Sci. 209(1-2): 123-140 (1998)
	1997
53		Rodney G. Downey, André Nies: Undecidability Results for Low Complexity Degree Structures. IEEE Conference on Computational Complexity 1997: 128-132
52		Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows: Advice Classes of Parameterized Tractability. Ann. Pure Appl. Logic 84(1): 119-138 (1997)
51		Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows: On the parameterized complexity of short computation and factorization. Arch. Math. Log. 36(4-5): 321-337 (1997)
50		Rodney G. Downey, Steffen Lempp: Contiguity and Distributivity in the Enumerable Turing Degrees. J. Symb. Log. 62(4): 1215-1240 (1997)
49		Bruno Courcelle, Rodney G. Downey, Michael R. Fellows: A Note on the Computability of Graph Minor Obstruction Sets for Monadic Second Order Ideals. J. UCS 3(11): 1194-1198 (1997)
48		Rodney G. Downey: On the Universal Splitting Property. Math. Log. Q. 43: 311-320 (1997)
47		Rich Blaylock, Rodney G. Downey, Steffen Lempp: Infima in the Recursively Enumerable Weak Truth Table Degrees. Notre Dame Journal of Formal Logic 38(3): 406-418 (1997)
	1996
46		Rodney G. Downey, Leo Harrington: There is No Fat Orbit. Ann. Pure Appl. Logic 80(3): 277-289 (1996)
	1995
45		Karl R. Abrahamson, Rodney G. Downey, Michael R. Fellows: Fixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogues. Ann. Pure Appl. Logic 73(3): 235-276 (1995)
44		Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Michael T. Hallett, Harold T. Wareham: Parameterized complexity analysis in computational biology. Computer Applications in the Biosciences 11(1): 49-57 (1995)
43		Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows: On the Structure of Parameterized Problems in NP. Inf. Comput. 123(1): 38-49 (1995)
42		Rodney G. Downey, Richard A. Shore: Degree Theoretic Definitions of the low2 Recursively Enumerable Sets. J. Symb. Log. 60(3): 727-756 (1995)
41		Rodney G. Downey, Michael R. Fellows: Fixed-Parameter Tractability and Completeness I: Basic Results. SIAM J. Comput. 24(4): 873-921 (1995)
40		Rodney G. Downey, Michael R. Fellows: Fixed-Parameter Tractability and Completeness II: On Completeness for W[1]. Theor. Comput. Sci. 141(1&2): 109-131 (1995)
39		Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham: The Parameterized Complexity of Sequence Alignment and Consensus. Theor. Comput. Sci. 147(1&2): 31-54 (1995)
	1994
38		Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham: The Parameterized Complexity of Sequence Alignment and Consensus. CPM 1994: 15-30
37		Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows: On the Structure of Parameterized Problems in NP (Extended Abstract). STACS 1994: 509-520
36		Rodney G. Downey, Yang Yue: A Rank one Cohesive Set. Ann. Pure Appl. Logic 68(2): 161-171 (1994)
35		Rodney G. Downey, William I. Gasarch, Michael Moses: The Structure of the Honest Polynomial m-Degrees. Ann. Pure Appl. Logic 70(2): 113-139 (1994)
34		Rodney G. Downey, Christine Ann Haught: Embedding Lattices into the wtt-Degrees below 0'. J. Symb. Log. 59(4): 1360-1382 (1994)
	1993
33		Rodney G. Downey, Patricia A. Evans, Michael R. Fellows: Parameterized Learning Complexity. COLT 1993: 51-57
32		Karl R. Abrahamson, Rodney G. Downey, Michael R. Fellows: Fixed-Parameter Intractability II (Extended Abstract). STACS 1993: 374-385
31		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)
30		Rodney G. Downey, Michael Stob: Friedberg Splittings of Recursively Enumerable Sets. Ann. Pure Appl. Logic 59(3): 175-199 (1993)
29		Rodney G. Downey: Every Recursive Boolean Algebra is Isomorphic to One with Incomplete Atoms. Ann. Pure Appl. Logic 60(3): 193-206 (1993)
28		Peter Cholak, Rodney G. Downey: Lattice Nonembeddings and Intervals of the Recursively Enumerable Degrees. Ann. Pure Appl. Logic 61(3): 195-221 (1993)
27		Rodney G. Downey, Michael Stob: Splitting Theorems in Recursion Theory. Ann. Pure Appl. Logic 65(1): 1-106 (1993)
26		Peter Cholak, Rodney G. Downey: On the Cantor-Bendixon Rank of Recursively Enumerable Sets. J. Symb. Log. 58(2): 629-640 (1993)
25		Steffen Lempp, Rodney G. Downey, Richard A. Shore: Highness and Bounding Minimal Pairs. Math. Log. Q. 39: 475-491 (1993)
	1992
24		Peter Cholak, Efim B. Kinber, Rodney G. Downey, Martin Kummer, Lance Fortnow, Stuart A. Kurtz, William I. Gasarch, Theodore A. Slaman: Degrees of Inferability. COLT 1992: 180-192
23		Rodney G. Downey, Michael R. Fellows: Fixed Parameter Tractability and Completeness. Complexity Theory: Current Research 1992: 191-225
22		Rodney G. Downey, Michael R. Fellows: Fixed-Parameter Intractability. Structure in Complexity Theory Conference 1992: 36-49
21		Colin Bailey, Rodney G. Downey: Tabular Degrees in alpha-Recursion Theory. Ann. Pure Appl. Logic 55(3): 205-236 (1992)
20		Rodney G. Downey, Theodore A. Slaman: On co-Simple Isols and Their Intersection Types. Ann. Pure Appl. Logic 56(1-3): 221-237 (1992)
19		Rodney G. Downey: Nondiamond Theorems for Polynomial Time Reducibility. J. Comput. Syst. Sci. 45(3): 385-395 (1992)
	1991
18		Rodney G. Downey: On Pi10 Classes and their Ranked Points. Notre Dame Journal of Formal Logic 32(4): 499-512 (1991)
17		Rodney G. Downey: On Computational Complexity and Honest Polynomial Degrees. Theor. Comput. Sci. 78(2): 305-317 (1991)
	1990
16		Chi Tat Chong, Rodney G. Downey: Minimal Degrees Recursive in 1-Generic Degrees. Ann. Pure Appl. Logic 48(3): 215-225 (1990)
15		Rodney G. Downey: Corrigendum: Correction to ``Undecidability of L(Finfty) and Other Lattices of r.e. Substructures''. Ann. Pure Appl. Logic 48(3): 299-301 (1990)
14		Rodney G. Downey: Lattice Nonembeddings and Initial Segments of the Recursively Enumerable Degrees. Ann. Pure Appl. Logic 49(2): 97-119 (1990)
	1989
13		Rodney G. Downey, Steven Homer, William I. Gasarch, Michael Moses: On Honest Polynomial Reductions, Relativizations, and P=NP. Structure in Complexity Theory Conference 1989: 196-207
12		Rodney G. Downey: Intervals and Sublattices of the r.e. Weak Truth Table Degrees, Part I: Density. Ann. Pure Appl. Logic 41(1): 1-26 (1989)
11		Rodney G. Downey, Theodore A. Slaman: Completely Mitotic r.e. Degrees. Ann. Pure Appl. Logic 41(2): 119-152 (1989)
10		Rodney G. Downey, Jeffrey B. Remmel: Classification of Degree Classes Associated with r.e. Subspaces. Ann. Pure Appl. Logic 42(2): 105-124 (1989)
9		Rodney G. Downey: Intervals and Sublattices of the r.e. Weak Truth Table Degrees, Part II: Nonbounding. Ann. Pure Appl. Logic 44(3): 153-172 (1989)
8		Rodney G. Downey: Recursively Enumerable m- and tt-Degrees. I: The Quantity of m- Degrees. J. Symb. Log. 54(2): 553-567 (1989)
7		Rodney G. Downey: On Hyper-Torre Isols. J. Symb. Log. 54(4): 1160-1166 (1989)
	1986
6		Rodney G. Downey, L. V. Welch: Splitting Properties of R. E. Sets and Degrees. J. Symb. Log. 51(1): 88-109 (1986)
	1985
5		Rodney G. Downey, Geoffrey R. Hird: Automorphisms of Supermaximal Subspaces. J. Symb. Log. 50(1): 1-9 (1985)
	1984
4		Rodney G. Downey: Co-Immune Subspaces and Complementation in V. J. Symb. Log. 49(2): 528-538 (1984)
3		Rodney G. Downey, Jeffrey B. Remmel: The Universal Complementation Property. J. Symb. Log. 49(4): 1125-1136 (1984)
2		Christopher J. Ash, Rodney G. Downey: Decidable Subspaces and Recursively Enumerable Subspaces. J. Symb. Log. 49(4): 1137-1145 (1984)
1		Rodney G. Downey: Bases of Supermaximal Subspaces and Steinitz Systems. I. J. Symb. Log. 49(4): 1146-1159 (1984)

Coauthor Index

1	Karl R. Abrahamson	[32] [45]
2	Christopher J. Ash	[2]
3	Colin Bailey	[21]
4	George Barmpalias	[136]
5	Verónica Becher	[140]
6	Laurent Bienvenu	[128] [130] [140]
7	Rich Blaylock	[47]
8	Hans L. Bodlaender	[38] [39] [44] [124] [127]
9	Paul Brodhead	[142]
10	Liming Cai	[37] [43] [51] [52]
11	Kevin Cattell	[64]
12	Douglas A. Cenzer (Douglas Cenzer)	[31] [129]
13	Jianer Chen	[37] [43] [51] [52]
14	Peter Cholak	[24] [26] [28] [70] [78] [122]
15	Chi Tat Chong	[16]
16	Richard Coles	[96]
17	Bruno Courcelle	[49]
18	Barbara F. Csima	[103] [135]
19	Frank K. H. A. Dehne (Frank Dehne)	[95]
20	Decheng Ding	[90]
21	Michael J. Dinneen	[64]
22	Vladimir Estivill-Castro	[83]
23	Patricia A. Evans	[33]
24	Michael R. Fellows (Mike Fellows)	[22] [23] [32] [33] [37] [38] [39] [40] [41] [43] [44] [45] [49] [51] [52] [54] [55] [60] [63] [64] [66] [69] [83] [95] [110] [119] [121] [124] [127]
25	Jörg Flum	[116]
26	Lance Fortnow	[24] [59] [81]
27	Zoltán Füredi	[58]
28	Amy Gale	[67]
29	William I. Gasarch	[13] [24] [35]
30	Robert Goldblatt	[108]
31	Sergei S. Goncharov	[133]
32	Noam Greenberg	[103] [109] [120] [123] [138]
33	Evan J. Griffiths	[80] [84] [86] [88]
34	Martin Grohe	[97] [98] [111] [116]
35	Michael T. Hallett	[44]
36	Leo Harrington	[46] [122]
37	Christine Ann Haught	[34]
38	Danny Hermelin	[124] [127]
39	Eberhard Herrmann	[70]
40	Geoffrey R. Hird	[5]
41	Denis R. Hirschfeldt	[68] [71] [72] [75] [79] [89] [103] [105] [114]
42	Steven Homer	[13]
43	Carl G. Jockusch Jr.	[31] [58] [62] [96] [107] [138]
44	Asher M. Kach	[133] [134]
45	Bart Kastermans	[126]
46	Bakhadyr Khoussainov	[117] [118] [125]
47	Efim B. Kinber	[24]
48	Julia F. Knight	[133]
49	Oleg V. Kudinov	[133]
50	Martin Kummer	[24]
51	Stuart A. Kurtz	[24]
52	Dietrich Kuske	[117] [118] [125]
53	Geoffrey LaForte	[56] [61] [72] [73] [82] [86] [89] [96] [114]
54	Michael A. Langston	[64] [101] [121]
55	Steffen Lempp	[25] [47] [50] [61] [68] [77] [126]
56	Angsheng Li	[91]
57	Markus Lohrey	[117] [118] [125]
58	Elvira Mayordomo	[140]
59	Catherine McCartin	[93] [94] [100] [110] [115] [119]
60	Alexander G. Melnikov	[133]
61	Wolfgang Merkle	[99] [102]
62	Kevin G. Milans	[138]
63	Joseph S. Miller	[103] [107] [123]
64	Michael Moses	[13] [35]
65	Keng Meng Ng	[131] [132] [135] [136] [142]
66	Rolf Niedermeier	[101]
67	André Nies	[53] [56] [65] [71] [75] [79] [104] [105]
68	Elena Prieto	[83]
69	Venkatesh Raman	[66]
70	Kenneth W. Regan	[55]
71	Stephanie Reid	[84]
72	Jan Reimann	[99] [102] [113]
73	Jeffrey B. Remmel	[3] [10] [129]
74	Frances A. Rosamond	[83] [119]
75	Lee A. Rubel	[58]
76	Richard A. Shore	[25] [31] [42] [57] [82]
77	Theodore A. Slaman	[11] [20] [24]
78	Reed Solomon	[68]
79	Ulrike Stege	[63]
80	Frank Stephan	[79]
81	Michael Stob	[27] [30]
82	Sebastiaan Terwijn (Sebastiaan A. Terwijn)	[76] [105]
83	Dimitrios M. Thilikos	[137] [139]
84	Daniel Turetsky	[133]
85	Zia Uddin	[129]
86	Moshe Y. Vardi	[117] [118] [125]
87	Alexander Vardy	[60]
88	Stephen Walk	[78]
89	Todd Wareham (Harold T. Wareham)	[38] [39] [44]
90	Rebecca Weber	[104]
91	L. V. Welch	[6]
92	Mark Weyer	[116]
93	Geoff Whittle (Geoffrey P. Whittle)	[60]
94	Gerhard J. Woeginger	[97] [98] [111]
95	Guohua Wu	[87] [91]
96	Liang Yu	[85] [90] [104] [106]
97	Yang Yue	[36]
98	Xizhong Zheng	[87]

Colors in the list of coauthors

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