Conferences in DBLP

Conference on Computability in Europe (CiE) (cie)
2009 (conf/cie/2009)

1. 
   First-Order Universality for Real Programs. [Citation Graph (, )][DBLP]
   
   
2. 
   Skolem + Tetration Is Well-Ordered. [Citation Graph (, )][DBLP]
   
   
3. 
   Structures of Some Strong Reducibilities. [Citation Graph (, )][DBLP]
   
   
4. 
   Complexity of Existential Positive First-Order Logic. [Citation Graph (, )][DBLP]
   
   
5. 
   Stochastic Programs and Hybrid Automata for (Biological) Modeling. [Citation Graph (, )][DBLP]
   
   
6. 
   Numberings and Randomness. [Citation Graph (, )][DBLP]
   
   
7. 
   The Strength of the Grätzer-Schmidt Theorem. [Citation Graph (, )][DBLP]
   
   
8. 
   Hyperloops Do Not Threaten the Notion of an Effective Procedure. [Citation Graph (, )][DBLP]
   
   
9. 
   Minimum Entropy Combinatorial Optimization Problems. [Citation Graph (, )][DBLP]
   
   
10. 
    Program Self-reference in Constructive Scott Subdomains. [Citation Graph (, )][DBLP]
    
    
11. 
    S⁰₁ and P⁰₁ Equivalence Structures. [Citation Graph (, )][DBLP]
    
    
12. 
    Immunity for Closed Sets. [Citation Graph (, )][DBLP]
    
    
13. 
    Lower Bounds for Kernelizations and Other Preprocessing Procedures. [Citation Graph (, )][DBLP]
    
    
14. 
    Infinite-Time Turing Machines and Borel Reducibility. [Citation Graph (, )][DBLP]
    
    
15. 
    Cutting Planes and the Parameter Cutwidth. [Citation Graph (, )][DBLP]
    
    
16. 
    Members of Random Closed Sets. [Citation Graph (, )][DBLP]
    
    
17. 
    Lowness for Demuth Randomness. [Citation Graph (, )][DBLP]
    
    
18. 
    Graph States and the Necessity of Euler Decomposition. [Citation Graph (, )][DBLP]
    
    
19. 
    On Stateless Multicounter Machines. [Citation Graph (, )][DBLP]
    
    
20. 
    Computability of Continuous Solutions of Higher-Type Equations. [Citation Graph (, )][DBLP]
    
    
21. 
    Equivalence Relations on Classes of Computable Structures. [Citation Graph (, )][DBLP]
    
    
22. 
    Fractals Generated by Algorithmically Random Brownian Motion. [Citation Graph (, )][DBLP]
    
    
23. 
    Computable Exchangeable Sequences Have Computable de Finetti Measures. [Citation Graph (, )][DBLP]
    
    
24. 
    Spectra of Algebraic Fields and Subfields. [Citation Graph (, )][DBLP]
    
    
25. 
    Definability in the Local Theory of the omega-Enumeration Degrees. [Citation Graph (, )][DBLP]
    
    
26. 
    Computability of Analytic Functions with Analytic Machines. [Citation Graph (, )][DBLP]
    
    
27. 
    An Application of Martin-Löf Randomness to Effective Probability Theory. [Citation Graph (, )][DBLP]
    
    
28. 
    Index Sets and Universal Numberings. [Citation Graph (, )][DBLP]
    
    
29. 
    Ordinal Computability. [Citation Graph (, )][DBLP]
    
    
30. 
    A Gandy Theorem for Abstract Structures and Applications to First-Order Definability. [Citation Graph (, )][DBLP]
    
    
31. 
    Constructing New Aperiodic Self-simulating Tile Sets. [Citation Graph (, )][DBLP]
    
    
32. 
    Relationship between Kanamori-McAloon Principle and Paris-Harrington Theorem. [Citation Graph (, )][DBLP]
    
    
33. 
    The First Order Theories of the Medvedev and Muchnik Lattices. [Citation Graph (, )][DBLP]
    
    
34. 
    Infima of d.r.e. Degrees. [Citation Graph (, )][DBLP]
    
    
35. 
    A Divergence Formula for Randomness and Dimension. [Citation Graph (, )][DBLP]
    
    
36. 
    On Ladner's Result for a Class of Real Machines with Restricted Use of Constants. [Citation Graph (, )][DBLP]
    
    
37. 
    0^"-Categorical Completely Decomposable Torsion-Free Abelian Groups. [Citation Graph (, )][DBLP]
    
    
38. 
    Notes on the Jump of a Structure. [Citation Graph (, )][DBLP]
    
    
39. 
    A General Representation Theorem for Probability Functions Satisfying Spectrum Exchangeability. [Citation Graph (, )][DBLP]
    
    
40. 
    Stability under Strategy Switching. [Citation Graph (, )][DBLP]
    
    
41. 
    Computational Heuristics for Simplifying a Biological Model. [Citation Graph (, )][DBLP]
    
    
42. 
    Functions Definable by Arithmetic Circuits. [Citation Graph (, )][DBLP]
    
    
43. 
    Survey on Oblivious Routing Strategies. [Citation Graph (, )][DBLP]
    
    
44. 
    An Approach to the Engineering of Cellular Models Based on P Systems. [Citation Graph (, )][DBLP]
    
    
45. 
    Decidability of Sub-theories of Polynomials over a Finite Field. [Citation Graph (, )][DBLP]
    
    
46. 
    Chaitin Omega Numbers and Halting Problems. [Citation Graph (, )][DBLP]
    
    
47. 
    Bayesian Data Integration and Enrichment Analysis for Predicting Gene Function in Malaria. [Citation Graph (, )][DBLP]
    
    
48. 
    Dialectica Interpretation with Fine Computational Control. [Citation Graph (, )][DBLP]
    
    
49. 
    Algorithmic Minimal Sufficient Statistic Revisited. [Citation Graph (, )][DBLP]
    
    
50. 
    A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets. [Citation Graph (, )][DBLP]
    
    
51. 
    On Generating Independent Random Strings. [Citation Graph (, )][DBLP]