Conferences in DBLP

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

1. 
   Avoiding Simplicity Is Complex. [Citation Graph (, )][DBLP]
   
   
2. 
   Higher-Order Containers. [Citation Graph (, )][DBLP]
   
   
3. 
   On the Completeness of Quantum Computation Models. [Citation Graph (, )][DBLP]
   
   
4. 
   The Ordinal of Skolem + Tetration Is tau₀. [Citation Graph (, )][DBLP]
   
   
5. 
   Proofs, Programs, Processes. [Citation Graph (, )][DBLP]
   
   
6. 
   Ergodic-Type Characterizations of Algorithmic Randomness. [Citation Graph (, )][DBLP]
   
   
7. 
   How Powerful Are Integer-Valued Martingales? [Citation Graph (, )][DBLP]
   
   
8. 
   A Faster Algorithm for Finding Minimum Tucker Submatrices. [Citation Graph (, )][DBLP]
   
   
9. 
   Processes in Space. [Citation Graph (, )][DBLP]
   
   
10. 
    Computability of Countable Subshifts. [Citation Graph (, )][DBLP]
    
    
11. 
    The Limits of Tractability in Resolution-Based Propositional Proof Systems. [Citation Graph (, )][DBLP]
    
    
12. 
    Haskell before Haskell: Curry's Contribution to Programming (1946-1950). [Citation Graph (, )][DBLP]
    
    
13. 
    A Miniaturisation of Ramsey's Theorem. [Citation Graph (, )][DBLP]
    
    
14. 
    Graph Structures and Algorithms for Query-Log Analysis. [Citation Graph (, )][DBLP]
    
    
15. 
    On the Complexity of Local Search for Weighted Standard Set Problems. [Citation Graph (, )][DBLP]
    
    
16. 
    Computational Interpretations of Analysis via Products of Selection Functions. [Citation Graph (, )][DBLP]
    
    
17. 
    The Peirce Translation and the Double Negation Shift. [Citation Graph (, )][DBLP]
    
    
18. 
    Counting the Changes of Random D⁰₂{\Delta^0_2} Sets. [Citation Graph (, )][DBLP]
    
    
19. 
    Boole: From Calculating Numbers to Calculating Thoughts. [Citation Graph (, )][DBLP]
    
    
20. 
    Approximability and Hardness in Multi-objective Optimization. [Citation Graph (, )][DBLP]
    
    
21. 
    P_w{\cal P}_w Is Not a Heyting Algebra. [Citation Graph (, )][DBLP]
    
    
22. 
    Lower Bounds for Reducibility to the Kolmogorov Random Strings. [Citation Graph (, )][DBLP]
    
    
23. 
    Spatial Models for Virtual Networks. [Citation Graph (, )][DBLP]
    
    
24. 
    DNA Rearrangements through Spatial Graphs. [Citation Graph (, )][DBLP]
    
    
25. 
    On Index Sets of Some Properties of Computable Algebras. [Citation Graph (, )][DBLP]
    
    
26. 
    The Strength of the Besicovitch-Davies Theorem. [Citation Graph (, )][DBLP]
    
    
27. 
    Circuit Complexity and Multiplicative Complexity of Boolean Functions. [Citation Graph (, )][DBLP]
    
    
28. 
    Definability in the Subword Order. [Citation Graph (, )][DBLP]
    
    
29. 
    Undecidability in Weihrauch Degrees. [Citation Graph (, )][DBLP]
    
    
30. 
    Degrees with Almost Universal Cupping Property. [Citation Graph (, )][DBLP]
    
    
31. 
    Incomputability in Physics. [Citation Graph (, )][DBLP]
    
    
32. 
    Approximate Self-assembly of the Sierpinski Triangle. [Citation Graph (, )][DBLP]
    
    
33. 
    Hairpin Lengthening. [Citation Graph (, )][DBLP]
    
    
34. 
    Infinities in Quantum Field Theory and in Classical Computing: Renormalization Program. [Citation Graph (, )][DBLP]
    
    
35. 
    Computational Complexity Aspects in Membrane Computing. [Citation Graph (, )][DBLP]
    
    
36. 
    Computable Ordered Abelian Groups and Fields. [Citation Graph (, )][DBLP]
    
    
37. 
    Focusing in Asynchronous Games. [Citation Graph (, )][DBLP]
    
    
38. 
    A Note on the Least Informative Model of a Theory. [Citation Graph (, )][DBLP]
    
    
39. 
    Three Roots for Leibniz's Contribution to the Computational Conception of Reason. [Citation Graph (, )][DBLP]
    
    
40. 
    Development of a Bacteria Computer: From in silico Finite Automata to in vitro and in vivo. [Citation Graph (, )][DBLP]
    
    
41. 
    The Complexity of Explicit Constructions. [Citation Graph (, )][DBLP]
    
    
42. 
    Kolmogorov Complexity Cores. [Citation Graph (, )][DBLP]
    
    
43. 
    Every D⁰₂\Delta^0_2-Set Is Natural, Up to Turing Equivalence. [Citation Graph (, )][DBLP]
    
    
44. 
    Computable Fields and Weak Truth-Table Reducibility. [Citation Graph (, )][DBLP]
    
    
45. 
    What Is the Problem with Proof Nets for Classical Logic? [Citation Graph (, )][DBLP]
    
    
46. 
    Quasi-linear Dialectica Extraction. [Citation Graph (, )][DBLP]
    
    
47. 
    Computing with Concepts, Computing with Numbers: Llull, Leibniz, and Boole. [Citation Graph (, )][DBLP]
    
    
48. 
    Inference Concerning Physical Systems. [Citation Graph (, )][DBLP]