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 43 matches
- 2017
- Pilar Albert, Elvira Mayordomo, Philippe Moser:
Bounded Pushdown Dimension vs Lempel Ziv Information Density. Computability and Complexity 2017: 95-114 - Eric Allender:
The Complexity of Complexity. Computability and Complexity 2017: 79-94 - Klaus Ambos-Spies:
On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets. Computability and Complexity 2017: 563-598 - Uri Andrews, Serikzhan A. Badaev, Andrea Sorbi:
A Survey on Universal Computably Enumerable Equivalence Relations. Computability and Complexity 2017: 418-451 - Uri Andrews, Rutger Kuyper, Steffen Lempp, Mariya Ivanova Soskova, Mars M. Yamaleev:
Nondensity of Double Bubbles in the D.C.E. Degrees. Computability and Complexity 2017: 547-562 - Marat M. Arslanov, Iskander Sh. Kalimullin:
A Survey of Results on the d-c.e. and n-c.e. Degrees. Computability and Complexity 2017: 469-478 - George Barmpalias, Andrew Lewis-Pye:
A Note on the Differences of Computably Enumerable Reals. Computability and Complexity 2017: 623-632 - Achilles A. Beros, Mushfeq Khan, Bjørn Kjos-Hanssen:
Effective Bi-immunity and Randomness. Computability and Complexity 2017: 633-643 - Laurent Bienvenu, Rutger Kuyper:
Parallel and Serial Jumps of Weak Weak König's Lemma. Computability and Complexity 2017: 201-217 - Vasco Brattka, Guido Gherardi, Rupert Hölzl, Arno Pauly:
The Vitali Covering Theorem in the Weihrauch Lattice. Computability and Complexity 2017: 188-200 - Sam Buss, Douglas Cenzer, Mia Minnes, Jeffrey B. Remmel:
Injection Structures Specified by Finite State Transducers. Computability and Complexity 2017: 394-417 - Peter A. Cholak:
On Splits of Computably Enumerable Sets. Computability and Complexity 2017: 521-535 - C. T. Chong:
1-Generic Degrees Bounding Minimal Degrees Revisited. Computability and Complexity 2017: 536-546 - Rumen D. Dimitrov, Valentina S. Harizanov:
The Lattice of Computably Enumerable Vector Spaces. Computability and Complexity 2017: 366-393 - Damir D. Dzhafarov, Carl G. Jockusch Jr., Reed Solomon, Linda Brown Westrick:
Effectiveness of Hindman's Theorem for Bounded Sums. Computability and Complexity 2017: 134-142 - Leigh Evron, Joseph R. Mileti, Ethan Ratliff-Crain:
Irreducibles and Primes in Computable Integral Domains. Computability and Complexity 2017: 238-253 - Michael R. Fellows:
Surfing with Rod. Computability and Complexity 2017: 9-18 - Lance Fortnow:
Complexity with Rod. Computability and Complexity 2017: 115-121 - Johanna N. Y. Franklin:
Strength and Weakness in Computable Structure Theory. Computability and Complexity 2017: 302-323 - Christian Glaßer, Dung T. Nguyen, Alan L. Selman, Maximilian Witek:
Introduction to Autoreducibility and Mitoticity. Computability and Complexity 2017: 56-78 - Robert Goldblatt:
Cameo of a Consummate Computabilist. Computability and Complexity 2017: 3-8 - Leo Harrington, Richard A. Shore, Theodore A. Slaman:
Σ _11 in Every Real in a Σ _11 Class of Reals Is Σ _11. Computability and Complexity 2017: 455-466 - Denis R. Hirschfeldt:
Some Questions in Computable Mathematics. Computability and Complexity 2017: 22-55 - Jeffry L. Hirst, Carl Mummert:
Reverse Mathematics of Matroids. Computability and Complexity 2017: 143-159 - Rupert Hölzl, Dilip Raghavan, Frank Stephan, Jing Zhang:
Weakly Represented Families in Reverse Mathematics. Computability and Complexity 2017: 160-187 - Carl G. Jockusch Jr.:
Herrmann's Beautiful Theorem on Computable Partial Orderings. Computability and Complexity 2017: 127-133 - Carl G. Jockusch Jr., Paul E. Schupp:
Asymptotic Density and the Theory of Computability: A Partial Survey. Computability and Complexity 2017: 501-520 - Nazif G. Khisamiev, Ivan V. Latkin:
On Constructive Nilpotent Groups. Computability and Complexity 2017: 324-353 - Bjørn Kjos-Hanssen:
A Rigid Cone in the Truth-Table Degrees with Jump. Computability and Complexity 2017: 487-500 - Bjørn Kjos-Hanssen:
Permutations of the Integers Induce only the Trivial Automorphism of the Turing Degrees. Computability and Complexity 2017: 599-607
skipping 13 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-09-23 19:02 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