default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 186 matches
- 2024
- Klaus Ambos-Spies, Rod Downey, Martin Monath:
Lowness properties for strong reducibilities and the computational power of maximal sets. Comput. 13(1): 1-56 (2024) - Ivan Georgiev:
Interplay between insertion of zeros and the complexity of Dedekind cuts. Comput. 13(2): 135-159 (2024) - Noam Greenberg, Matthew Harrison-Trainor, Joseph S. Miller, Dan Turetsky:
Enumerations of families closed under finite differences. Comput. 13(1): 89-104 (2024) - Peter Hertling, Philip Janicki:
Nearly computable real numbers. Comput. 13(1): 57-88 (2024) - Jack H. Lutz, Renrui Qi, Liang Yu:
The Point-to-Set Principle and the dimensions of Hamel bases. Comput. 13(2): 105-112 (2024) - Dag Normann:
Computability and non-monotone induction. Comput. 13(2): 161-196 (2024) - Sam Sanders:
Exploring the abyss in Kleene's computability theory. Comput. 13(2): 113-134 (2024) - 2023
- Pavel Alaev:
Inversion operations in algebraic structures. Comput. 12(4): 315-322 (2023) - Eric Allender, Nikhil Balaji, Samir Datta, Rameshwar Pratap:
On the complexity of algebraic numbers, and the bit-complexity of straight-line programs. Comput. 12(2): 145-173 (2023) - Djamel Eddine Amir, Mathieu Hoyrup:
Strong computable type. Comput. 12(3): 227-269 (2023) - Uri Andrews, Mingzhong Cai, David Diamondstone, Noah Schweber:
Limit computability and ultrafilters. Comput. 12(2): 101-115 (2023) - Nikolay Bazhenov, Takayuki Kihara, Svetlana Selivanova:
Preface. Comput. 12(4): 299 (2023) - Nikolay Bazhenov, Takayuki Kihara, Svetlana Selivanova, Dieter Spreen:
On the main scientific achievements of Victor Selivanov. Comput. 12(4): 301-314 (2023) - Douglas Cenzer, Christopher P. Porter:
Randomness extraction in computability theory. Comput. 12(1): 1-21 (2023) - Marina Dorzhieva, Alexander G. Melnikov:
Punctually presented structures I: Closure theorems. Comput. 12(4): 323-337 (2023) - Marat Kh. Faizrahmanov:
Numberings, c.e. oracles, and fixed points. Comput. 12(3): 271-282 (2023) - Marat Kh. Faizrahmanov, Zlata Shchedrikova:
Effectively infinite classes of numberings and computable families of reals. Comput. 12(4): 339-350 (2023) - Riccardo Gozzi, Daniel Graça:
Characterizing time computational complexity classes with polynomial differential equations. Comput. 12(1): 23-57 (2023) - Daniel Silva Graça, Ning Zhong:
Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines. Comput. 12(2): 117-144 (2023) - Jeffry L. Hirst, Carl Mummert:
Banach's theorem in higher-order reverse mathematics. Comput. 12(3): 203-225 (2023) - Mathieu Hoyrup:
Notes on overt choice. Comput. 12(4): 351-369 (2023) - Ruslan Ishkuvatov, Daniil Musatov, Alexander Shen:
Approximating Kolmogorov complexity. Comput. 12(3): 283-297 (2023) - Clara Löh, Matthias Uschold:
L2-Betti numbers and computability of reals. Comput. 12(2): 175-201 (2023) - Victor L. Selivanov, Svetlana Selivanova:
Primitive recursive ordered fields and some applications. Comput. 12(1): 71-99 (2023) - Dieter Spreen:
How much partiality is needed for a theory of computability? Comput. 12(4): 371-426 (2023) - James Walsh:
Evitable iterates of the consistency operator. Comput. 12(1): 59-69 (2023) - 2022
- Bruno Bauwens, Péter Gács, Andrei E. Romashchenko, Alexander Shen:
Inequalities for space-bounded Kolmogorov complexity. Comput. 11(3-4): 165-185 (2022) - Nikolay Bazhenov, Keng Meng Ng, Luca San Mauro, Andrea Sorbi:
Primitive recursive equivalence relations and their primitive recursive complexity. Comput. 11(3-4): 187-221 (2022) - Vasco Brattka, Noam Greenberg, Iskander Sh. Kalimullin, Mariya Ivanova Soskova:
Preface of the Special Issue for the Oberwolfach Workshop on Computability Theory 2021. Comput. 11(3-4): 163 (2022) - Wesley Calvert, Douglas Cenzer, Valentina S. Harizanov:
Generically and coarsely computable isomorphisms. Comput. 11(3-4): 223-239 (2022)
skipping 156 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-10-24 15:36 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint