Skip to content

Computability in Europe: Logic and Theory of Algorithms

CiE

C

CORE rank

CORE rank (raw)

C

Fields of research

Theory of Computation

Papers indexed

987

2005–2026

Papers per year

200586 peak2026

CiE papers

987 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
2012Foundational Analyses of Computation.Yuri Gurevich
2012Densities and Entropies in Cellular Automata.Pierre Guillon, Charalampos Zinoviadis
2012On Mathematicians Who Liked Logic - The Case of Max Newman.Ivor Grattan-Guinness
2012On the Foundations and Philosophy of Info-metrics.Amos Golan
2012Substitutions and Strongly Deterministic Tilesets.Bastien Le Gloannec, Nicolas Ollinger
2012Sets of Signals, Information Flow, and Folktales.Mark Alan Finlayson
2012A Short Note on Spector's Proof of Consistency of Analysis.Fernando Ferreira
2012Highness and Local Noncappability.Chengling Fang, Shenling Wang, Guohua Wu
2012Confluence in Data Reduction: Bridging Graph Transformation and Kernelization.Hartmut Ehrig, Claudia Ermel, Falk Hffner, Rolf Niedermeier, Olga Runge
2012Learning, Social Intelligence and the Turing Test - Why an "Out-of-the-Box" Turing Machine Will Not Pass the Turing Test.Bruce Edmonds, Carlos Gershenson
2012Turing Progressions and Their Well-Orders.David Fernndez-Duque, Joost J. Joosten
2012Randomness, Computation and Mathematics.Rod Downey
2012Connecting Partial Words and Regular Languages.Jrgen Dassow, Florin Manea, Robert Mercas
2012Complexity of Deep Inference via Atomic Flows.Anupam Das
2012Local Induction and Provably Total Computable Functions: A Case Study.Andrs Cordn-Franco, Francisco Flix Lara Martn
2012On Mathias Generic Sets.Peter Cholak, Damir D. Dzhafarov, Jeffry L. Hirst
2012Hard Instances of Algorithms and Proof Systems.Yijia Chen, Jrg Flum, Moritz Mller
2012An Undecidable Nested Recurrence Relation.Marcel Celaya, Frank Ruskey
2012Automatic Functions, Linear Time and Learning.John Case, Sanjay Jain, Samuel Seah, Frank Stephan
2012A Note on Ramsey Theorems and Turing Jumps.Lorenzo Carlucci, Konrad Zdanowski
2012The Mate-in-n Problem of Infinite Chess Is Decidable.Dan Brumleve, Joel David Hamkins, Philipp Schlicht
2012Square Roots and Powers in Constructive Banach Algebra Theory.Douglas S. Bridges, Robin Havea
2012On the Computational Content of the Brouwer Fixed Point Theorem.Vasco Brattka, Stphane Le Roux, Arno Pauly
2012Logic of Ruler and Compass Constructions.Michael Beeson
2012Turing's Normal Numbers: Towards Randomness.Vernica Becher
551575 of 987← PreviousNext →

Comparable venues

Other A*/A conferences filed under the same field of research.