default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoseph S. Miller
Person information
- affiliation: University of Wisconsin-Madison, Wisconsin, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j41]Noam Greenberg, Matthew Harrison-Trainor, Joseph S. Miller, Dan Turetsky:
Enumerations of families closed under finite differences. Comput. 13(1): 89-104 (2024)- 2023
- [j40]Uri Andrews, Julia F. Knight, Rutger Kuyper, Joseph S. Miller
, Mariya Ivanova Soskova:
Expanding the Reals by continuous Functions Adds no Computational Power. J. Symb. Log. 88(3): 1083-1102 (2023) - [j39]Steffen Lempp, Joseph S. Miller, André Nies, Mariya Ivanova Soskova:
Maximal Towers and Ultrafilter Bases in Computability Theory. J. Symb. Log. 88(3): 1170-1190 (2023) - [j38]Jun Le Goh, Iskander Sh. Kalimullin, Joseph S. Miller, Mariya Ivanova Soskova:
Pa Relative to an Enumeration Oracle. J. Symb. Log. 88(4): 1497-1525 (2023) - [i4]Steffen Lempp, Joseph S. Miller, Arno Pauly, Mariya Ivanova Soskova, Manlio Valenti:
Minimal covers in the Weihrauch degrees. CoRR abs/2311.12676 (2023) - 2022
- [j37]Uri Andrews, Peter M. Gerdes, Steffen Lempp, Joseph S. Miller, Noah David Schweber:
Computability and the Symmetric Difference Operator. Log. J. IGPL 30(3): 499-518 (2022) - [j36]Hristo Aleksndrov Ganchev, Iskander Sh. Kalimullin, Joseph S. Miller, Mariya Ivanova Soskova:
A Structural Dichotomy in the Enumeration Degrees. J. Symb. Log. 87(2): 527-544 (2022) - 2020
- [j35]Noam Greenberg, Joseph S. Miller, André Nies:
Computing from projections of random points. J. Math. Log. 20(1): 1950014 (2020) - [j34]Rupert Hölzl, Wolfgang Merkle, Joseph S. Miller, Frank Stephan, Liang Yu:
Chaitin's ω as a continuous function. J. Symb. Log. 85(1): 486-510 (2020)
2010 – 2019
- 2019
- [j33]Vasco Brattka, Stéphane Le Roux, Joseph S. Miller, Arno Pauly:
Connected choice and the Brouwer fixed point theorem. J. Math. Log. 19(1): 1950004:1-1950004:46 (2019) - 2018
- [j32]Joseph S. Miller, Mariya Ivanova Soskova:
Corrigendum to "Advice classes of parameterized tractability" [Ann. Pure Appl. Logic 84 (1) (1997) 119-138]. Ann. Pure Appl. Log. 169(5): 450-462 (2018) - [j31]Noam Greenberg, Joseph S. Miller, Benoit Monin, Daniel Turetsky:
Two More Characterizations of K-Triviality. Notre Dame J. Formal Log. 59(2): 189-195 (2018) - [j30]Noam Greenberg, Joseph S. Miller, Alexander Shen, Linda Brown Westrick:
Dimension 1 sequences are close to randoms. Theor. Comput. Sci. 705: 99-112 (2018) - 2017
- [j29]Rutger Kuyper, Joseph S. Miller:
Nullifying randomness and genericity using symmetric difference. Ann. Pure Appl. Log. 168(9): 1692-1699 (2017) - [j28]Mushfeq Khan, Joseph S. Miller:
Forcing with Bushy Trees. Bull. Symb. Log. 23(2): 160-180 (2017) - [c7]Joseph S. Miller:
On Work of Barmpalias and Lewis-Pye: A Derivation on the D.C.E. Reals. Computability and Complexity 2017: 644-659 - [i3]Noam Greenberg, Joseph S. Miller, Alexander Shen, Linda Brown Westrick:
Dimension 1 sequences are close to randoms. CoRR abs/1709.05266 (2017) - 2016
- [j27]Mingzhong Cai, Steffen Lempp, Joseph S. Miller, Mariya Ivanova Soskova:
On Kalimullin pairs. Comput. 5(2): 111-126 (2016) - [j26]Uri Andrews, Mingzhong Cai, Iskander Sh. Kalimullin, Steffen Lempp, Joseph S. Miller, Antonio Montalbán:
The complements of Lower cones of Degrees and the degree spectra of Structures. J. Symb. Log. 81(3): 997-1006 (2016) - [c6]Vasco Brattka, Stéphane Le Roux, Joseph S. Miller, Arno Pauly:
The Brouwer Fixed Point Theorem Revisited. CiE 2016: 58-67 - 2015
- [j25]Santiago Figueira, Denis R. Hirschfeldt, Joseph S. Miller, Keng Meng Ng, André Nies:
Counting the changes of random Δ20 sets. J. Log. Comput. 25(4): 1073-1089 (2015) - [i2]Joseph S. Miller, Jason Rute:
Energy randomness. CoRR abs/1509.00524 (2015) - 2014
- [j24]Uri Andrews, Peter M. Gerdes, Joseph S. Miller:
The degrees of bi-hyperhyperimmune sets. Ann. Pure Appl. Log. 165(3): 803-811 (2014) - [j23]Laurent Bienvenu, Adam R. Day, Noam Greenberg, Antonín Kucera, Joseph S. Miller, André Nies, Dan Turetsky:
Computing k-Trivial Sets by Incomplete Random Sets. Bull. Symb. Log. 20(1): 80-90 (2014) - [j22]Mingzhong Cai, Rodney G. Downey, Rachel Epstein, Steffen Lempp, Joseph S. Miller:
Random strings and tt-degrees of Turing complete C.E. sets. Log. Methods Comput. Sci. 10(3) (2014) - [j21]Laurent Bienvenu, Rupert Hölzl, Joseph S. Miller, André Nies:
Denjoy, Demuth and density. J. Math. Log. 14(1): 1450004 (2014) - [j20]Steffen Lempp, Joseph S. Miller, Keng Meng Ng, Daniel D. Turetsky, Rebecca Weber:
Lowness for effective Hausdorff dimension. J. Math. Log. 14(2): 1450011 (2014) - [j19]Uri Andrews, Steffen Lempp, Joseph S. Miller, Keng Meng Ng, Luca San Mauro, Andrea Sorbi:
Universal computably Enumerable Equivalence Relations. J. Symb. Log. 79(1): 60-88 (2014) - 2013
- [j18]Laurent Bienvenu, Noam Greenberg, Antonín Kucera, Joseph S. Miller, André Nies, Daniel Turetsky:
Joining non-low C.E. sets with diagonally non-computable functions. J. Log. Comput. 23(6): 1183-1194 (2013) - 2012
- [j17]Laurent Bienvenu, Joseph S. Miller:
Randomness and lowness notions via open covers. Ann. Pure Appl. Log. 163(5): 506-518 (2012) - [j16]Bjørn Kjos-Hanssen, Joseph S. Miller, Reed Solomon:
Lowness notions, measure and domination. J. Lond. Math. Soc. 85(3): 869-888 (2012) - [c5]Laurent Bienvenu, Rupert Hölzl, Joseph S. Miller, André Nies:
The Denjoy alternative for computable functions. STACS 2012: 543-554 - 2011
- [i1]Vasco Brattka, Joseph S. Miller, André Nies:
Randomness and Differentiability. CoRR abs/1104.4465 (2011) - 2010
- [c4]Santiago Figueira, Denis R. Hirschfeldt, Joseph S. Miller, Keng Meng Ng, André Nies:
Counting the Changes of Random D02 Sets. CiE 2010: 162-171
2000 – 2009
- 2009
- [j15]Noam Greenberg, Joseph S. Miller:
Lowness for Kurtz randomness. J. Symb. Log. 74(2): 665-678 (2009) - [j14]Santiago Figueira, Joseph S. Miller, André Nies:
Indifferent Sets. J. Log. Comput. 19(2): 425-443 (2009) - [j13]Joseph S. Miller:
The K-Degrees, Low for K Degrees, and Weakly Low for K Sets. Notre Dame J. Formal Log. 50(4): 381-391 (2009) - 2008
- [j12]Rod Downey, Noam Greenberg, Joseph S. Miller:
The upward closure of a perfect thin class. Ann. Pure Appl. Log. 156(1): 51-58 (2008) - 2006
- [j11]Rodney G. Downey, Carl G. Jockusch Jr., Joseph S. Miller:
On self-embeddings of computable linear orderings. Ann. Pure Appl. Log. 138(1-3): 52-76 (2006) - [j10]Wolfgang Merkle, Joseph S. Miller, André Nies, Jan Reimann, Frank Stephan:
Kolmogorov-Loveland randomness and stochasticity. Ann. Pure Appl. Log. 138(1-3): 183-210 (2006) - [j9]Joseph S. Miller, André Nies:
Randomness and Computability: Open Questions. Bull. Symb. Log. 12(3): 390-410 (2006) - [j8]Peter Cholak, Noam Greenberg, Joseph S. Miller:
Uniform almost everywhere domination. J. Symb. Log. 71(3): 1057-1072 (2006) - [j7]Barbara F. Csima, Rod Downey, Noam Greenberg, Denis R. Hirschfeldt, Joseph S. Miller:
Every 1-generic computes a properly 1-generic. J. Symb. Log. 71(4): 1385-1393 (2006) - [j6]Verónica Becher, Santiago Figueira, Serge Grigorieff, Joseph S. Miller:
Randomness and halting probabilities. J. Symb. Log. 71(4): 1411-1430 (2006) - 2005
- [j5]Rod Downey, Denis R. Hirschfeldt, Joseph S. Miller, André Nies:
Relativizing Chaitin's Halting Probability. J. Math. Log. 5(2) (2005) - [j4]Joseph S. Miller, Lawrence S. Moss:
The Undecidability of Iterated Modal Relativization. Stud Logica 79(3): 373-407 (2005) - [c3]Wolfgang Merkle, Joseph S. Miller, André Nies, Jan Reimann, Frank Stephan:
Kolmogorov-Loveland Randomness and Stochasticity. STACS 2005: 422-433 - 2004
- [j3]Joseph S. Miller, Reed Solomon:
Effectiveness for infinite variable words and the Dual Ramsey Theorem. Arch. Math. Log. 43(4): 543-556 (2004) - [j2]Joseph S. Miller:
Degrees of unsolvability of continuous functions. J. Symb. Log. 69(2): 555-584 (2004) - [j1]Joseph S. Miller:
Every 2-random real is Kolmogorov random. J. Symb. Log. 69(3): 907-913 (2004) - 2002
- [c2]Joseph S. Miller:
Effectiveness for Embedded Spheres and Balls. CCA 2002: 127-138 - 2000
- [c1]Joseph S. Miller:
Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata. HSCC 2000: 296-309
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-30 00:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
