dblp.uni-trier.dewww.uni-trier.de

Rodney G. Downey Vis

Rod Downey

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
124EERod Downey, Keng Meng Ng: Lowness for Demuth Randomness. CiE 2009: 154-166
123EELaurent Bienvenu, Rod Downey: Kolmogorov Complexity and Solovay Functions. STACS 2009: 147-158
122EELaurent Bienvenu, Rod Downey: Kolmogorov Complexity and Solovay Functions CoRR abs/0902.1041: (2009)
2008
121 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
120EEHans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin: On Problems without Polynomial Kernels (Extended Abstract). ICALP (1) 2008: 563-574
119EERod Downey, Noam Greenberg, Joseph S. Miller: The upward closure of a perfect thin class. Ann. Pure Appl. Logic 156(1): 51-58 (2008)
118EEPeter Cholak, Rodney G. Downey, Leo Harrington: The Complexity of Orbits of Computably Enumerable Sets. Bulletin of Symbolic Logic 14(1): 69-87 (2008)
117EERodney 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)
116EERod Downey, Noam Greenberg: Turing degrees of reals of positive effective packing dimension. Inf. Process. Lett. 108(5): 298-303 (2008)
115EERodney 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
114EERod 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
113EERod 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
112EERod Downey, Jörg Flum, Martin Grohe, Mark Weyer: Bounded fixed-parameter tractability and reducibility. Ann. Pure Appl. Logic 148(1-3): 1-19 (2007)
111EERodney G. Downey, Catherine McCartin: Online promise problems with online width metrics. J. Comput. Syst. Sci. 73(1): 57-72 (2007)
110EERodney 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)
109EERodney G. Downey, Jan Reimann: Algorithmic randomness. Scholarpedia 2(10): 2574 (2007)
108EERod Downey: Foreword. Theory Comput. Syst. 41(3): 397 (2007)
2006
107 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
106EERodney G. Downey, Michael R. Fellows, Catherine McCartin: Parameterized Approximation Problems. IWPEC 2006: 121-129
105EERod Downey, Noam Greenberg: Totally < omegaomega Computably Enumerable and m-topped Degrees. TAMC 2006: 46-60
104EERodney G. Downey, Robert Goldblatt: Foreword. Ann. Pure Appl. Logic 138(1-3): 1- (2006)
103EERodney 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)
102EERod Downey, Liang Yu: Arithmetical Sacks Forcing. Arch. Math. Log. 45(6): 715-720 (2006)
101EERodney G. Downey, Denis R. Hirschfeldt, André Nies, Sebastiaan Terwijn: Calibrating Randomness. Bulletin of Symbolic Logic 12(3): 411-491 (2006)
100EERodney G. Downey, Wolfgang Merkle, Jan Reimann: Schnorr dimension. Mathematical Structures in Computer Science 16(5): 789-811 (2006)
99EERod Downey, Michael A. Langston, Rolf Niedermeier: Editorial. Theor. Comput. Sci. 351(3): 295 (2006)
2005
98EERodney G. Downey, Catherine McCartin: Bounded Persistence Pathwidth. CATS 2005: 51-56
97EERodney G. Downey, Wolfgang Merkle, Jan Reimann: Schnorr Dimension. CiE 2005: 96-105
96EERodney G. Downey, Martin Grohe, Gerhard J. Woeginger: 05301 Abstracts Collection - Exact Algorithms and Fixed-Parameter Tractability. Exact Algorithms and Fixed-Parameter Tractability 2005
95EERodney G. Downey, Martin Grohe, Gerhard J. Woeginger: 05301 Summary - Exact Algorithms and Fixed-Parameter Tractability. Exact Algorithms and Fixed-Parameter Tractability 2005
94EERichard Coles, Rodney G. Downey, Carl G. Jockusch Jr., Geoffrey LaForte: Completing pseudojump operators. Ann. Pure Appl. Logic 136(3): 297-333 (2005)
2004
93 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
92EERodney G. Downey, Catherine McCartin: Some New Directions and Questions in Parameterized Complexity. Developments in Language Theory 2004: 12-26
91EERodney G. Downey, Catherine McCartin: Online Problems, Pathwidth, and Persistence. IWPEC 2004: 13-24
90EERodney G. Downey: Some Recent Progress in Algorithmic Randomness. MFCS 2004: 42-83
89EERod Downey, Angsheng Li, Guohua Wu: Complementing cappable degrees in the difference hierarchy. Ann. Pure Appl. Logic 125(1-3): 101-118 (2004)
88EELiang Yu, Decheng Ding, Rodney G. Downey: The Kolmogorov complexity of random reals. Ann. Pure Appl. Logic 129(1-3): 163-180 (2004)
87EERodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte: Randomness and reducibility. J. Comput. Syst. Sci. 68(1): 96-114 (2004)
86EERod Downey, Guohua Wu, Xizhong Zheng: Degrees of d. c. e. reals. Math. Log. Q. 50(4-5): 345-350 (2004)
85EERod Downey, Evan J. Griffiths, Geoffrey LaForte: On Schnorr and computable randomness, martingales, and machines. Math. Log. Q. 50(6): 613-627 (2004)
84EERodney G. Downey, Evan J. Griffiths, Stephanie Reid: On Kurtz randomness. Theor. Comput. Sci. 321(2-3): 249-270 (2004)
2003
83EERodney 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: (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)
81EERodney G. Downey, Lance Fortnow: Uniformly hard languages. Theor. Comput. Sci. 2(298): 303-315 (2003)
2002
80EERodney G. Downey, Evan J. Griffiths: Schnorr Randomness. Electr. Notes Theor. Comput. Sci. 66(1): (2002)
79EERodney G. Downey, Denis R. Hirschfeldt, André Nies, Frank Stephan: Trivial Reals. Electr. Notes Theor. Comput. Sci. 66(1): (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)
76EERodney G. Downey, Sebastiaan Terwijn: Computably Enumerable Reals and Uniformly Presentable Ideals. Math. Log. Q. 48(S1): 29-40 (2002)
75EERodney 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)
73EERodney G. Downey, Geoffrey LaForte: Presentations of computably enumerable reals. Theor. Comput. Sci. 284(2): 539-555 (2002)
2001
72EERodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte: Randomness and Reducibility. MFCS 2001: 316-327
71EERodney 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)
69EERodney 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)
67EEAmy 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)
64EEKevin 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
59EERodney 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)
55EERodney G. Downey, Michael R. Fellows, Kenneth W. Regan: Parameterized Circuit Complexity and the W Hierarchy. Theor. Comput. Sci. 191(1-2): 97-115 (1998)
54EERodney 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
53EERodney 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)
51EELiming 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)
49EEBruno 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)
40EERodney 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)
39EEHans 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
37EELiming 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
33EERodney G. Downey, Patricia A. Evans, Michael R. Fellows: Parameterized Learning Complexity. COLT 1993: 51-57
32EEKarl 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
24EEPeter 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

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

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)