 | 2009 |
|---|
| 10 |       | Santiago Figueira,
Joseph S. Miller,
André Nies:
Indifferent Sets.
J. Log. Comput. 19(2): 425-443 (2009) |
| 2008 |
|---|
| 9 | | Rod Downey,
Noam Greenberg,
Joseph S. Miller:
The upward closure of a perfect thin class.
Ann. Pure Appl. Logic 156(1): 51-58 (2008) |
| 2006 |
|---|
| 8 | | Wolfgang Merkle,
Joseph S. Miller,
André Nies,
Jan Reimann,
Frank Stephan:
Kolmogorov-Loveland randomness and stochasticity.
Ann. Pure Appl. Logic 138(1-3): 183-210 (2006) |
| 7 | | 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) |
| 6 | | Joseph S. Miller,
André Nies:
Randomness and Computability: Open Questions.
Bulletin of Symbolic Logic 12(3): 390-410 (2006) |
| 2005 |
|---|
| 5 | | Wolfgang Merkle,
Joseph S. Miller,
André Nies,
Jan Reimann,
Frank Stephan:
Kolmogorov-Loveland Randomness and Stochasticity.
STACS 2005: 422-433 |
| 4 | | Joseph S. Miller,
Lawrence S. Moss:
The Undecidability of Iterated Modal Relativization.
Studia Logica 79(3): 373-407 (2005) |
| 2004 |
|---|
| 3 | | Joseph S. Miller,
Reed Solomon:
Effectiveness for infinite variable words and the Dual Ramsey Theorem.
Arch. Math. Log. 43(4): 543-556 (2004) |
| 2002 |
|---|
| 2 | | Joseph S. Miller:
Effectiveness for Embedded Spheres and Balls.
Electr. Notes Theor. Comput. Sci. 66(1): (2002) |
| 2000 |
|---|
| 1 | | Joseph S. Miller:
Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata.
HSCC 2000: 296-309 |
