Enumerations in computable structure theory S Goncharov, V Harizanov, J Knight, C McCoy, R Miller, R Solomon Annals of Pure and Applied logic 136 (3), 219-246, 2005 | 137 | 2005 |

Degrees of categoricity of computable structures EB Fokina, I Kalimullin, R Miller Archive for Mathematical Logic 49 (1), 51, 2010 | 106 | 2010 |

The-spectrum of a linear order R Miller The Journal of Symbolic Logic 66 (2), 470-486, 2001 | 60 | 2001 |

A computable functor from graphs to fields R Miller, B Poonen, H Schoutens, A Shlapentokh The Journal of Symbolic Logic 83 (1), 326-348, 2018 | 57 | 2018 |

Computable functors and effective interpretability M Harrison-Trainor, A Melnikov, R Miller, A Montalbán The Journal of Symbolic Logic 82 (1), 77-97, 2017 | 52 | 2017 |

Computable categoricity of trees of finite height S Lempp, C McCoy, R Miller, R Solomon The Journal of Symbolic Logic 70 (1), 151-215, 2005 | 52 | 2005 |

d-Computable categoricity for algebraic fields R Miller The Journal of Symbolic Logic 74 (4), 1325-1351, 2009 | 40 | 2009 |

The hierarchy of equivalence relations on the natural numbers under computable reducibility S Coskey, JD Hamkins, R Miller Computability 1 (1), 15-38, 2012 | 38 | 2012 |

Degree spectra of highn and nonlown degrees A Frolov, V Harizanov, I Kalimullin, O Kudinov, R Miller Journal of Logic and Computation, 2010 | 36 | 2010 |

An enhanced theory of infinite time register machines P Koepke, R Miller Conference on Computability in Europe, 306-315, 2008 | 35 | 2008 |

Computable fields and Galois theory R Miller NOTICES-AMERICAN MATHEMATICAL SOCIETY 55 (7), 798, 2008 | 33 | 2008 |

Computable categoricity for algebraic fields with splitting algorithms R Miller, A Shlapentokh Transactions of the American Mathematical Society 367 (6), 3955-3980, 2015 | 32 | 2015 |

The basic theory of infinite time register machines M Carl, T Fischbach, P Koepke, R Miller, M Nasfi, G Weckbecker Archive for Mathematical Logic 49 (2), 249-273, 2010 | 31 | 2010 |

Spectra of structures and relations VS Harizanov, RG Miller The Journal of Symbolic Logic 72 (1), 324-348, 2007 | 29 | 2007 |

The computable dimension of trees of infinite height R Miller The Journal of Symbolic Logic 70 (1), 111-141, 2005 | 29 | 2005 |

Complexity of equivalence relations and preorders from computability theory E Ianovski, R Miller, KM Ng, A Nies The Journal of Symbolic Logic 79 (3), 859-881, 2014 | 25 | 2014 |

Computability of Fraďssé limits BF Csima, VS Harizanov, R Miller, A Montalbán The Journal of Symbolic Logic 76 (1), 66-93, 2011 | 24 | 2011 |

Computably categorical fields via Fermat’s Last Theorem R Miller, H Schoutens Computability 2 (1), 51-65, 2013 | 23 | 2013 |

Locally computable structures RG Miller Conference on Computability in Europe, 575-584, 2007 | 21 | 2007 |

An introduction to infinite time computable model theory JD Hamkins, R Miller, D Seabold, S Warner New Computational Paradigms, eds. SB Cooper, B. Löwe, & A. Sorbi (Springer …, 0 | 18* | |