Search the dblp DataBase

Publications of Author

1. Joseph S. Miller
   Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata. [Citation Graph (0, 0)][DBLP]
   HSCC, 2000, pp:296-309 [Conf]
   
2. Wolfgang Merkle, Joseph S. Miller, André Nies, Jan Reimann, Frank Stephan
   Kolmogorov-Loveland Randomness and Stochasticity. [Citation Graph (0, 0)][DBLP]
   STACS, 2005, pp:422-433 [Conf]
   
3. Joseph S. Miller, Reed Solomon
   Effectiveness for infinite variable words and the Dual Ramsey Theorem. [Citation Graph (0, 0)][DBLP]
   Arch. Math. Log., 2004, v:43, n:4, pp:543-556 [Journal]
   
4. Rodney G. Downey, Carl G. Jockusch Jr., Joseph S. Miller
   On self-embeddings of computable linear orderings. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2006, v:138, n:1-3, pp:52-76 [Journal]
   
5. Wolfgang Merkle, Joseph S. Miller, André Nies, Jan Reimann, Frank Stephan
   Kolmogorov-Loveland randomness and stochasticity. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2006, v:138, n:1-3, pp:183-210 [Journal]
   
6. Joseph S. Miller
   Effectiveness for Embedded Spheres and Balls. [Citation Graph (0, 0)][DBLP]
   Electr. Notes Theor. Comput. Sci., 2002, v:66, n:1, pp:- [Journal]
   
7. Joseph S. Miller, Lawrence S. Moss
   The Undecidability of Iterated Modal Relativization. [Citation Graph (0, 0)][DBLP]
   Studia Logica, 2005, v:79, n:3, pp:373-407 [Journal]
   
8. 
   Counting the Changes of Random D⁰₂{\Delta^0_2} Sets. [Citation Graph (, )][DBLP]
   
   
9. 
   The upward closure of a perfect thin class. [Citation Graph (, )][DBLP]
   
   
10. 
    Randomness and Computability: Open Questions. [Citation Graph (, )][DBLP]