Search the dblp DataBase
Joseph S. Miller :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] Counting the Changes of Random D^{0} _{2} {\Delta^0_2} Sets. [Citation Graph (, )][DBLP ] The upward closure of a perfect thin class. [Citation Graph (, )][DBLP ] Randomness and Computability: Open Questions. [Citation Graph (, )][DBLP ] Search in 0.002secs, Finished in 0.003secs