default search action
Adam R. Day
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j11]Adam R. Day
, Andrew S. Marks
Jump Operations for Borel graphs. J. Symb. Log. 83(1): 13-28 (2018) - 2017
- [e1]Adam R. Day, Michael R. Fellows, Noam Greenberg, Bakhadyr Khoussainov, Alexander G. Melnikov
Computability and Complexity - Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 10010, Springer 2017, ISBN 978-3-319-50061-4 [contents] - 2016
- [j10]Adam R. Day:
On the strength of two Recurrence theorems. J. Symb. Log. 81(4): 1357-1374 (2016) - 2014
- [j9]Laurent Bienvenu, Adam R. Day
Computing k-Trivial Sets by Incomplete Random Sets. Bull. Symb. Log. 20(1): 80-90 (2014) - [j8]Adam R. Day, Jan Reimann
Independence, Relative Randomness, and PA Degrees. Notre Dame J. Formal Log. 55(1): 1-10 (2014) - 2013
- [j7]Adam R. Day:
Indifferent sets for genericity. J. Symb. Log. 78(1): 113-138 (2013) - [j6]Laurent Bienvenu, Adam R. Day, Rupert Hölzl:
From bi-immunity to absolute undecidability. J. Symb. Log. 78(4): 1218-1228 (2013) - 2012
- [j5]Laurent Bienvenu, Adam R. Day, Mathieu Hoyrup, Ilya Mezhirov, Alexander Shen
A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points. Inf. Comput. 210: 21-30 (2012) - [j4]Adam R. Day:
Process and truth-table characterisations of randomness. Theor. Comput. Sci. 452: 47-55 (2012) - 2010
- [j3]Adam R. Day:
The computable Lipschitz degrees of computably enumerable sets are not dense. Ann. Pure Appl. Log. 161(12): 1588-1602 (2010) - [j2]Adam R. Day:
On Process Complexity. Chic. J. Theor. Comput. Sci. 2010 (2010) - [c3]Laurent Bienvenu, Adam R. Day, Ilya Mezhirov, Alexander Shen
Ergodic-Type Characterizations of Algorithmic Randomness. CiE 2010: 49-58 - [i1]Laurent Bienvenu, Adam R. Day, Mathieu Hoyrup, Ilya Mezhirov, Alexander Shen:
A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points. CoRR abs/1007.5249 (2010)
2000 – 2009
- 2009
- [j1]Adam R. Day:
On the computational power of random strings. Ann. Pure Appl. Log. 160(2): 214-228 (2009) - [c2]Adam R. Day:
On Process Complexity. CATS 2009: 29-34 - [c1]Adam R. Day:
Increasing the Gap between Descriptional Complexity and Algorithmic Probability. CCC 2009: 263-273
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-04-25 05:54 CEST 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: