Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata. - Joseph S. Miller (HSCC, 2000)

Effectiveness for Embedded Spheres and Balls. - Joseph S. Miller (CCA, 2002)

Effectiveness for infinite variable words and the Dual Ramsey Theorem. - Joseph S. Miller; Reed Solomon (Arch. Math. Log., 2004)

Degrees of unsolvability of continuous functions. - Joseph S. Miller (J. Symb. Log., 2004)

Every 2-random real is Kolmogorov random. - Joseph S. Miller (J. Symb. Log., 2004)

Relativizing Chaitin's Halting Probability. - Rod Downey; Denis R. Hirschfeldt; Joseph S. Miller; André Nies (J. Math. Log., 2005)

The Undecidability of Iterated Modal Relativization. - Joseph S. Miller; Lawrence S. Moss (Stud Logica, 2005)

On self-embeddings of computable linear orderings. - Rodney G. Downey; Carl G. Jockusch Jr.; Joseph S. Miller (Ann. Pure Appl. Log., 2006)

Kolmogorov-Loveland randomness and stochasticity. - Wolfgang Merkle; Joseph S. Miller; André Nies; Jan Reimann 001; Frank Stephan 001 (Ann. Pure Appl. Log., 2006)

Randomness and Computability: Open Questions. - Joseph S. Miller; André Nies (Bull. Symb. Log., 2006)

Randomness and halting probabilities. - Verónica Becher; Santiago Figueira; Serge Grigorieff; Joseph S. Miller (J. Symb. Log., 2006)

Uniform almost everywhere domination. - Peter Cholak; Noam Greenberg; Joseph S. Miller (J. Symb. Log., 2006)

Every 1-generic computes a properly 1-generic. - Barbara F. Csima; Rod Downey; Noam Greenberg; Denis R. Hirschfeldt; Joseph S. Miller (J. Symb. Log., 2006)

The upward closure of a perfect thin class. - Rod Downey; Noam Greenberg; Joseph S. Miller (Ann. Pure Appl. Log., 2008)

Lowness for Kurtz randomness. - Noam Greenberg; Joseph S. Miller (J. Symb. Log., 2009)

Indifferent Sets. - Santiago Figueira; Joseph S. Miller; André Nies (J. Log. Comput., 2009)

The K-Degrees, Low for K Degrees, and Weakly Low for K Sets. - Joseph S. Miller (Notre Dame J. Formal Log., 2009)

Counting the Changes of Random D02 Sets. - Santiago Figueira; Denis R. Hirschfeldt; Joseph S. Miller; Keng Meng Ng; André Nies (CiE, 2010)

Randomness and Differentiability. - Vasco Brattka; Joseph S. Miller; André Nies (CoRR, 2011)

The Denjoy alternative for computable functions. - Laurent Bienvenu; Rupert Hölzl 001; Joseph S. Miller; André Nies (STACS, 2012)

Randomness and lowness notions via open covers. - Laurent Bienvenu; Joseph S. Miller (Ann. Pure Appl. Log., 2012)

Lowness notions, measure and domination. - Bjørn Kjos-Hanssen; Joseph S. Miller; Reed Solomon (J. Lond. Math. Soc., 2012)

Joining non-low C.E. sets with diagonally non-computable functions. - Laurent Bienvenu; Noam Greenberg; Antonín Kucera 002; Joseph S. Miller; André Nies; Daniel Turetsky (J. Log. Comput., 2013)

The degrees of bi-hyperhyperimmune sets. - Uri Andrews; Peter M. Gerdes; Joseph S. Miller (Ann. Pure Appl. Log., 2014)

Computing k-Trivial Sets by Incomplete Random Sets. - Laurent Bienvenu; Adam R. Day; Noam Greenberg; Antonín Kucera 002; Joseph S. Miller; André Nies; Dan Turetsky (Bull. Symb. Log., 2014)

Random strings and tt-degrees of Turing complete C.E. sets. - Mingzhong Cai; Rodney G. Downey; Rachel Epstein; Steffen Lempp; Joseph S. Miller (Log. Methods Comput. Sci., 2014)

Denjoy, Demuth and density. - Laurent Bienvenu; Rupert Hölzl 001; Joseph S. Miller; André Nies (J. Math. Log., 2014)

Lowness for effective Hausdorff dimension. - Steffen Lempp; Joseph S. Miller; Keng Meng Ng; Daniel D. Turetsky; Rebecca Weber (J. Math. Log., 2014)

Universal computably Enumerable Equivalence Relations. - Uri Andrews; Steffen Lempp; Joseph S. Miller; Keng Meng Ng; Luca San Mauro; Andrea Sorbi (J. Symb. Log., 2014)

Energy randomness. - Joseph S. Miller; Jason Rute (CoRR, 2015)

Counting the changes of random Δ20 sets. - Santiago Figueira; Denis R. Hirschfeldt; Joseph S. Miller; Keng Meng Ng; André Nies (J. Log. Comput., 2015)

The Brouwer Fixed Point Theorem Revisited. - Vasco Brattka; Stéphane Le Roux 001; Joseph S. Miller; Arno Pauly (CiE, 2016)

On Kalimullin pairs. - Mingzhong Cai; Steffen Lempp; Joseph S. Miller; Mariya Ivanova Soskova (Comput., 2016)

The complements of Lower cones of Degrees and the degree spectra of Structures. - Uri Andrews; Mingzhong Cai; Iskander Sh. Kalimullin; Steffen Lempp; Joseph S. Miller; Antonio Montalbán (J. Symb. Log., 2016)

On Work of Barmpalias and Lewis-Pye: A Derivation on the D.C.E. Reals. - Joseph S. Miller (Computability and Complexity, 2017)

Nullifying randomness and genericity using symmetric difference. - Rutger Kuyper; Joseph S. Miller (Ann. Pure Appl. Log., 2017)

Forcing with Bushy Trees. - Mushfeq Khan; Joseph S. Miller (Bull. Symb. Log., 2017)

Corrigendum to "Advice classes of parameterized tractability" [Ann. Pure Appl. Logic 84 (1) (1997) 119-138]. - Joseph S. Miller; Mariya Ivanova Soskova (Ann. Pure Appl. Log., 2018)

Two More Characterizations of K-Triviality. - Noam Greenberg; Joseph S. Miller; Benoit Monin; Daniel Turetsky (Notre Dame J. Formal Log., 2018)

Dimension 1 sequences are close to randoms. - Noam Greenberg; Joseph S. Miller; Alexander Shen 001; Linda Brown Westrick (Theor. Comput. Sci., 2018)

Connected choice and the Brouwer fixed point theorem. - Vasco Brattka; Stéphane Le Roux 001; Joseph S. Miller; Arno Pauly (J. Math. Log., 2019)

Computing from projections of random points. - Noam Greenberg; Joseph S. Miller; André Nies (J. Math. Log., 2020)

Chaitin's ω as a continuous function. - Rupert Hölzl 001; Wolfgang Merkle; Joseph S. Miller; Frank Stephan 001; Liang Yu 004 (J. Symb. Log., 2020)

Computability and the Symmetric Difference Operator. - Uri Andrews; Peter M. Gerdes; Steffen Lempp; Joseph S. Miller; Noah David Schweber (Log. J. IGPL, 2022)

A Structural Dichotomy in the Enumeration Degrees. - Hristo Aleksndrov Ganchev; Iskander Sh. Kalimullin; Joseph S. Miller; Mariya Ivanova Soskova (J. Symb. Log., 2022)

Minimal covers in the Weihrauch degrees. - Steffen Lempp; Joseph S. Miller; Arno Pauly; Mariya Ivanova Soskova; Manlio Valenti (CoRR, 2023)

Expanding the Reals by continuous Functions Adds no Computational Power. - Uri Andrews; Julia F. Knight; Rutger Kuyper; Joseph S. Miller; Mariya Ivanova Soskova (J. Symb. Log., 2023)

Pa Relative to an Enumeration Oracle. - Jun Le Goh; Iskander Sh. Kalimullin; Joseph S. Miller; Mariya Ivanova Soskova (J. Symb. Log., 2023)

Maximal Towers and Ultrafilter Bases in Computability Theory. - Steffen Lempp; Joseph S. Miller; André Nies; Mariya Ivanova Soskova (J. Symb. Log., 2023)

Enumerations of families closed under finite differences. - Noam Greenberg; Matthew Harrison-Trainor; Joseph S. Miller; Dan Turetsky (Comput., 2024)