default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputability, Volume 3
Volume 3, Number 1, 2014
- Keng Meng Ng
, André Nies, Frank Stephan:
The Complexity of Recursive Splittings of Random Sets. 1-8 - John V. Tucker, Jeffery I. Zucker:
Computability of Operators on Continuous and Discrete Time Streams. 9-44 - Cameron E. Freer, Bjørn Kjos-Hanssen, André Nies, Frank Stephan:
Algorithmic Aspects of Lipschitz Functions. 45-61 - Stela Nikolova:
Shared thoughts on Ivan Soskov (1954-2013). 63-72
Volume 3, Number 2, 2014
- Johanna N. Y. Franklin, Reed Solomon:
Degrees that Are Low for Isomorphism. 73-89 - Ryan C. Harkins, John M. Hitchcock, Aduri Pavan:
Strong Reductions and Isomorphism of Complete Sets. 91-104 - Wesley Calvert, Valentina S. Harizanov, Alexandra Shlapentokh:
Turing Degrees of Isomorphism Types of Geometric Objects. 105-134 - Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora:
Parameterized Inapproximability of Target Set Selection and Generalizations. 135-145
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.
last updated on 2024-10-31 20:18 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:
