default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID60. Birthday: Rodney G. Downey 2017
- Adam R. Day, Michael R. Fellows, Noam Greenberg, Bakhadyr Khoussainov, Alexander G. Melnikov
, Frances A. Rosamond:
Computability and Complexity - Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 10010, Springer 2017, ISBN 978-3-319-50061-4
Memories, Complexity and Horizons
- Robert Goldblatt:
Cameo of a Consummate Computabilist. 3-8 - Michael R. Fellows:
Surfing with Rod. 9-18 - Anil Nerode:
Prequel to the Cornell Computer Science Department. 19-21 - Denis R. Hirschfeldt:
Some Questions in Computable Mathematics. 22-55 - Christian Glaßer, Dung T. Nguyen, Alan L. Selman, Maximilian Witek:
Introduction to Autoreducibility and Mitoticity. 56-78 - Eric Allender:
The Complexity of Complexity. 79-94 - Pilar Albert, Elvira Mayordomo, Philippe Moser:
Bounded Pushdown Dimension vs Lempel Ziv Information Density. 95-114 - Lance Fortnow:
Complexity with Rod. 115-121 - Keng Meng Ng:
On Being Rod's Graduate Student. 122-123
Computable Combinatorics, Reverse Mathematics
- Carl G. Jockusch Jr.:
Herrmann's Beautiful Theorem on Computable Partial Orderings. 127-133 - Damir D. Dzhafarov, Carl G. Jockusch Jr., Reed Solomon, Linda Brown Westrick:
Effectiveness of Hindman's Theorem for Bounded Sums. 134-142 - Jeffry L. Hirst, Carl Mummert:
Reverse Mathematics of Matroids. 143-159 - Rupert Hölzl, Dilip Raghavan, Frank Stephan, Jing Zhang:
Weakly Represented Families in Reverse Mathematics. 160-187 - Vasco Brattka, Guido Gherardi, Rupert Hölzl, Arno Pauly:
The Vitali Covering Theorem in the Weihrauch Lattice. 188-200 - Laurent Bienvenu, Rutger Kuyper:
Parallel and Serial Jumps of Weak Weak König's Lemma. 201-217
Computable Model Theory, Computable Algebra
- Antonio Montalbán:
Effectively Existentially-Atomic Structures. 221-237 - Leigh Evron, Joseph R. Mileti, Ethan Ratliff-Crain:
Irreducibles and Primes in Computable Integral Domains. 238-253 - Russell Miller:
Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey. 254-270 - Alexandra A. Soskova, Mariya Ivanova Soskova:
Enumeration Reducibility and Computable Structure Theory. 271-301 - Johanna N. Y. Franklin:
Strength and Weakness in Computable Structure Theory. 302-323 - Nazif G. Khisamiev, Ivan V. Latkin:
On Constructive Nilpotent Groups. 324-353 - Andrey S. Morozov:
Computable Model Theory over the Reals. 354-365 - Rumen D. Dimitrov, Valentina S. Harizanov:
The Lattice of Computably Enumerable Vector Spaces. 366-393 - Sam Buss, Douglas Cenzer, Mia Minnes, Jeffrey B. Remmel:
Injection Structures Specified by Finite State Transducers. 394-417 - Uri Andrews, Serikzhan A. Badaev, Andrea Sorbi:
A Survey on Universal Computably Enumerable Equivalence Relations. 418-451
Higher Computability
- Leo Harrington, Richard A. Shore, Theodore A. Slaman:
Σ _1^1 in Every Real in a Σ _1^1 Class of Reals Is Σ _1^1. 455-466
Turing Degree Theory, c.e. Sets
- Marat M. Arslanov, Iskander Sh. Kalimullin:
A Survey of Results on the d-c.e. and n-c.e. Degrees. 469-478 - Guohua Wu, Mars M. Yamaleev:
There Are No Maximal d.c.e. wtt-degrees. 479-486 - Bjørn Kjos-Hanssen:
A Rigid Cone in the Truth-Table Degrees with Jump. 487-500 - Carl G. Jockusch Jr., Paul E. Schupp:
Asymptotic Density and the Theory of Computability: A Partial Survey. 501-520 - Peter A. Cholak:
On Splits of Computably Enumerable Sets. 521-535 - C. T. Chong:
1-Generic Degrees Bounding Minimal Degrees Revisited. 536-546 - Uri Andrews, Rutger Kuyper, Steffen Lempp, Mariya Ivanova Soskova, Mars M. Yamaleev:
Nondensity of Double Bubbles in the D.C.E. Degrees. 547-562 - Klaus Ambos-Spies:
On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets. 563-598 - Bjørn Kjos-Hanssen:
Permutations of the Integers Induce only the Trivial Automorphism of the Turing Degrees. 599-607
Algorithmic Randomness
- Liang Yu, Yizheng Zhu:
On the Reals Which Cannot Be Random. 611-622 - George Barmpalias, Andrew Lewis-Pye:
A Note on the Differences of Computably Enumerable Reals. 623-632 - Achilles A. Beros, Mushfeq Khan, Bjørn Kjos-Hanssen:
Effective Bi-immunity and Randomness. 633-643 - Joseph S. Miller:
On Work of Barmpalias and Lewis-Pye: A Derivation on the D.C.E. Reals. 644-659 - Stephen G. Simpson:
Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions. 660-668 - Nikolay K. Vereshchagin, Alexander Shen:
Algorithmic Statistics: Forty Years Later. 669-737 - André Nies:
Lowness, Randomness, and Computable Analysis. 738-754
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-04 00:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
