CiE C

37 papers

YearTitle / Authors
2017A Deterministic Algorithm for Testing the Equivalence of Read-Once Branching Programs with Small Discrepancy.
Stefan Arnold, Jacobo Torán
2017A Guided Tour to Computational Haplotyping.
Gunnar W. Klau, Tobias Marschall
2017A One-Dimensional Physically Universal Cellular Automaton.
Ville Salo, Ilkka Törmä
2017A Universal Oracle for Signal Machines.
Thierry Monteil
2017Admissibles in Gaps.
Merlin Carl, Bruno Durand, Grégory Lafitte, Sabrina Ouazzani
2017Character-Based Phylogeny Construction and Its Application to Tumor Evolution.
Gianluca Della Vedova, Murray Patterson, Raffaella Rizzi, Mauricio Soto Gomez
2017Compressibility and Probabilistic Proofs.
Alexander Shen
2017Computable Transformations of Structures.
Russell G. Miller
2017Counting Substrate Cycles in Topologically Restricted Metabolic Networks.
Robert D. Barish, Akira Suyama
2017Degrees of Categoricity of Rigid Structures.
Nikolay Bazhenov, Mars M. Yamaleev
2017Delayed-Input Cryptographic Protocols.
Ivan Visconti
2017Dimension Spectra of Lines.
Neil Lutz, Donald M. Stull
2017Eliminating Unbounded Search in Computable Algebra.
Alexander G. Melnikov
2017Extending Wadge Theory to k-Partitions.
Victor L. Selivanov
2017Finite Language Forbidding-Enforcing Systems.
Daniela Genova, Hendrik Jan Hoogeboom
2017Flexible Indexing of Repetitive Collections.
Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot
2017Formalizing a Fragment of Combinatorics on Words.
Stepan Holub, Robert Veroff
2017Formulas with Reversal.
Narad Rampersad
2017Game Characterizations and Lower Cones in the Weihrauch Degrees.
Hugo Nobrega, Arno Pauly
2017Gödel's Reception of Turing's Model of Computability: The "Shift of Perception" in 1934.
Juliette Kennedy
2017Infinite Time Busy Beavers.
Oscar Defrain, Bruno Durand, Grégory Lafitte
2017Is there any Real Substance to the Claims for a 'New Computationalism'?
Alberto Hernández-Espinosa, Francisco Hernández Quiroz, Héctor Zenil
2017Koepke Machines and Satisfiability for Infinitary Propositional Languages.
Merlin Carl, Benedikt Löwe, Benjamin G. Rin
2017McShane-Whitney Pairs.
Iosif Petrakis
2017New Bounds on the Strength of Some Restrictions of Hindman's Theorem.
Lorenzo Carlucci, Leszek Aleksander Kolodziejczyk, Francesco Lepore, Konrad Zdanowski
2017On Higher Effective Descriptive Set Theory.
Margarita V. Korovina, Oleg V. Kudinov
2017Outline of Partial Computability in Computable Topology.
Margarita V. Korovina, Oleg V. Kudinov
2017Permutive One-Way Cellular Automata and the Finiteness Problem for Automaton Groups.
Martin Delacourt, Nicolas Ollinger
2017Randomness Deficiencies.
Gleb Novikov
2017Surjective H-Colouring: New Hardness Results.
Petr A. Golovach, Matthew Johnson, Barnaby Martin, Daniël Paulusma, Anthony Stewart
2017The Recognizability Strength of Infinite Time Turing Machines with Ordinal Parameters.
Merlin Carl, Philipp Schlicht
2017Total Nondeterministic Turing Machines and a p-optimal Proof System for SAT.
Zenon Sadowski
2017Towards Computable Analysis on the Generalised Real Line.
Lorenzo Galeotti, Hugo Nobrega
2017Turing Computable Embeddings, Computable Infinitary Equivalence, and Linear Orders.
Nikolay Bazhenov
2017Turing's 1949 Paper in Context.
Cliff B. Jones
2017Unveiling Dynamics and Complexity - 13th Conference on Computability in Europe, CiE 2017, Turku, Finland, June 12-16, 2017, Proceedings
Jarkko Kari, Florin Manea, Ion Petre
2017
Karoliina Lehtinen, Sandra Quickert