default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID5. CiE 2009: Heidelberg, Germany
- Klaus Ambos-Spies, Benedikt Löwe, Wolfgang Merkle:
Mathematical Theory and Computational Practice, 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009. Proceedings. Lecture Notes in Computer Science 5635, Springer 2009, ISBN 978-3-642-03072-7 - Thomas Anberrée:
First-Order Universality for Real Programs. 1-10 - Mathias Barra, Philipp Gerhardy:
Skolem + Tetration Is Well-Ordered. 11-20 - David R. Bélanger:
Structures of Some Strong Reducibilities. 21-30 - Manuel Bodirsky, Miki Hermann, Florian Richoux:
Complexity of Existential Positive First-Order Logic. 31-36 - Luca Bortolussi
, Alberto Policriti:
Stochastic Programs and Hybrid Automata for (Biological) Modeling. 37-48 - Paul Brodhead, Bjørn Kjos-Hanssen:
Numberings and Randomness. 49-58 - Paul Brodhead, Bjørn Kjos-Hanssen:
The Strength of the Grätzer-Schmidt Theorem. 59-67 - Tim Button:
Hyperloops Do Not Threaten the Notion of an Effective Procedure. 68-78 - Jean Cardinal, Samuel Fiorini, Gwenaël Joret:
Minimum Entropy Combinatorial Optimization Problems. 79-88 - John Case, Samuel E. Moelius:
Program Self-reference in Constructive Scott Subdomains. 89-98 - Douglas A. Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel:
S01 and P01 Equivalence Structures. 99-108 - Douglas Cenzer, Rebecca Weber, Guohua Wu:
Immunity for Closed Sets. 109-117 - Yijia Chen, Jörg Flum, Moritz Müller:
Lower Bounds for Kernelizations and Other Preprocessing Procedures. 118-128 - Samuel Coskey:
Infinite-Time Turing Machines and Borel Reducibility. 129-133 - Stefan S. Dantchev, Barnaby Martin:
Cutting Planes and the Parameter Cutwidth. 134-143 - David Diamondstone, Bjørn Kjos-Hanssen:
Members of Random Closed Sets. 144-153 - Rod Downey, Keng Meng Ng:
Lowness for Demuth Randomness. 154-166 - Ross Duncan, Simon Perdrix:
Graph States and the Necessity of Euler Decomposition. 167-177 - Ömer Egecioglu, Oscar H. Ibarra:
On Stateless Multicounter Machines. 178-187 - Martín Hötzel Escardó:
Computability of Continuous Solutions of Higher-Type Equations. 188-197 - Ekaterina B. Fokina, Sy-David Friedman:
Equivalence Relations on Classes of Computable Structures. 198-207 - Willem L. Fouché:
Fractals Generated by Algorithmically Random Brownian Motion. 208-217 - Cameron E. Freer, Daniel M. Roy:
Computable Exchangeable Sequences Have Computable de Finetti Measures. 218-231 - Andrey N. Frolov, Iskander Sh. Kalimullin, Russell G. Miller:
Spectra of Algebraic Fields and Subfields. 232-241 - Hristo Ganchev:
Definability in the Local Theory of the omega-Enumeration Degrees. 242-249 - Tobias Gärtner, Günter Hotz:
Computability of Analytic Functions with Analytic Machines. 250-259 - Mathieu Hoyrup, Cristobal Rojas:
An Application of Martin-Löf Randomness to Effective Probability Theory. 260-269 - Sanjay Jain, Frank Stephan, Jason Teutsch:
Index Sets and Universal Numberings. 270-279 - Peter Koepke:
Ordinal Computability. 280-289 - Oleg V. Kudinov, Victor L. Selivanov:
A Gandy Theorem for Abstract Structures and Applications to First-Order Definability. 290-299 - Grégory Lafitte, Michael Weiss:
Constructing New Aperiodic Self-simulating Tile Sets. 300-309 - Gyesik Lee:
Relationship between Kanamori-McAloon Principle and Paris-Harrington Theorem. 310-323 - Andrew E. M. Lewis, André Nies, Andrea Sorbi:
The First Order Theories of the Medvedev and Muchnik Lattices. 324-331 - Jiang Liu, Shengling Wang, Guohua Wu:
Infima of d.r.e. Degrees. 332-341 - Jack H. Lutz:
A Divergence Formula for Randomness and Dimension. 342-351 - Klaus Meer:
On Ladner's Result for a Class of Real Machines with Restricted Use of Constants. 352-361 - Alexander G. Melnikov:
0"-Categorical Completely Decomposable Torsion-Free Abelian Groups. 362-371 - Antonio Montalbán:
Notes on the Jump of a Structure. 372-378 - Jeff B. Paris, Alena Vencovská:
A General Representation Theorem for Probability Functions Satisfying Spectrum Exchangeability. 379-388 - Soumya Paul, Ramaswamy Ramanujam, Sunil Easaw Simon:
Stability under Strategy Switching. 389-398 - Ion Petre, Andrzej Mizera, Ralph-Johan Back:
Computational Heuristics for Simplifying a Biological Model. 399-408 - Ian Pratt-Hartmann, Ivo Düntsch:
Functions Definable by Arithmetic Circuits. 409-418 - Harald Räcke:
Survey on Oblivious Routing Strategies. 419-429 - Francisco José Romero-Campero, Natalio Krasnogor:
An Approach to the Engineering of Cellular Models Based on P Systems. 430-436 - Alla Sirokofskich:
Decidability of Sub-theories of Polynomials over a Finite Field. 437-446 - Kohtaro Tadaki:
Chaitin Omega Numbers and Halting Problems. 447-456 - Philip M. R. Tedder, James R. Bradford, Chris J. Needham, Glenn A. McConkey, Andrew J. Bulpitt, David R. Westhead:
Bayesian Data Integration and Enrichment Analysis for Predicting Gene Function in Malaria. 457-466 - Trifon Trifonov:
Dialectica Interpretation with Fine Computational Control. 467-477 - Nikolay K. Vereshchagin:
Algorithmic Minimal Sufficient Statistic Revisited. 478-487 - Andreas Weiermann:
A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets. 488-498 - Marius Zimand:
On Generating Independent Random Strings. 499-508
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 2026-01-27 23:59 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:
