default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID12. CiE 2016: Paris, France
- Arnold Beckmann, Laurent Bienvenu, Natasa Jonoska:
Pursuit of the Universal - 12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, 2016, Proceedings. Lecture Notes in Computer Science 9709, Springer 2016, ISBN 978-3-319-40188-1
Invited Papers
- Natasha Alechina
, Brian Logan:
Verifying Systems of Resource-Bounded Agents. 3-12 - Valérie Berthé, Thomas Fernique, Mathieu Sablik:
Effective S-adic Symbolic Dynamical Systems. 13-23 - Daniela Besozzi:
Reaction-Based Models of Biochemical Networks. 24-34 - Priscila Biller, Carole Knibbe, Guillaume Beslon, Eric Tannier:
Comparative Genomics on Artificial Life. 35-44 - Vasco Brattka:
Computability and Analysis, a Historical Approach. 45-57 - Vasco Brattka, Stéphane Le Roux, Joseph S. Miller, Arno Pauly:
The Brouwer Fixed Point Theorem Revisited. 58-67 - Ignacio Cascudo:
Secret Sharing Schemes with Algebraic Properties and Applications. 68-77 - Walter Dean:
Squeezing Feasibility. 78-88 - Oriol Farràs:
Recent Advances in Non-perfect Secret Sharing Schemes. 89-98 - Aleksander Galicki, André Nies:
A Computational Approach to the Borwein-Ditor Theorem. 99-104 - Danilo Gligoroski, Simona Samardjiska:
Semantic Security and Key-Privacy with Random Split of St-Gen Codes. 105-114 - Mathieu Hoyrup:
The Typical Constructible Object. 115-123 - Emmanuel Jeandel:
Computability in Symbolic Dynamics. 124-131 - Delaram Kahrobaei, Vladimir Shpilrain:
Using Semidirect Product of (Semi)groups in Public Key Cryptography. 132-141 - Akitoshi Kawamura, Florian Steinberg, Martin Ziegler:
Towards Computational Complexity Theory on Advanced Function Spaces in Analysis. 142-152 - Irène Marcovici:
Ergodicity of Noisy Cellular Automata: The Coupling Method and Beyond. 153-163 - Simone Martini:
Types in Programming Languages, Between Modelling, Abstraction, and Correctness - Extended Abstract. 164-169 - Pierre-Éric Mounier-Kuhn, Maël Pégny:
AFCAL and the Emergence of Computer Science in France: 1957-1967. 170-181 - Reed Solomon:
Computable Reductions and Reverse Mathematics. 182-191
Contributed Papers
- Mikhail Andreev:
Busy Beavers and Kolmogorov Complexity. 195-204 - Sebastián Barbieri, Mathieu Sablik:
The Domino Problem for Self-similar Structures. 205-214 - Olivier Bournez, Nachum Dershowitz, Pierre Néron:
Axiomatizing Analog Algorithms. 215-224 - Merlin Carl:
Generalized Effective Reducibility. 225-233 - Gemma Carotenuto, André Nies:
Lightface Π30-Completeness of Density Sets Under Effective Wadge Reducibility. 234-239 - John Case, James S. Royer:
Program Size Complexity of Correction Grammars in the Ershov Hierarchy. 240-250 - Rumen D. Dimitrov, Valentina S. Harizanov, Andrei S. Morozov:
Automorphism Groups of Substructure Lattices of Vector Spaces in Computable Algebra. 251-260 - Riccardo Dondi, Florian Sikora:
Parameterized Complexity and Approximation Issues for the Colorful Components Problems. 261-270 - Lorenzo Galeotti:
A Candidate for the Generalised Real Line. 271-281 - Sanjay Jain, Bakhadyr Khoussainov, Frank Stephan:
Finitely Generated Semiautomatic Groups. 282-291 - Anton Konovalov, Victor L. Selivanov:
The Boolean Algebra of Piecewise Testable Languages. 292-301 - Oleg V. Kudinov, Victor L. Selivanov:
On the Lattices of Effectively Open Sets. 302-311 - Bas Luttik, Fei Yang:
On the Executability of Interactive Computation. 312-322 - Christian Glaßer, Peter Jonsson, Barnaby Martin:
Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic. 323-332 - Barnaby Martin, András Pongrácz, Michal Wrona:
The Complexity of Counting Quantifiers on Equality Languages. 333-342 - Russell Miller:
Baire Category Theory and Hilbert's Tenth Problem Inside \mathbb Q Q. 343-352 - Ludovic Patey:
Partial Orders and Immunity in Reverse Mathematics. 353-363 - Iosif Petrakis:
A Direct Constructive Proof of a Stone-Weierstrass Theorem for Metric Spaces. 364-374
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-16 20:18 CEST 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:
