Search results for "CiE"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Dimiter Skordev, Ivan Georgiev	On a Relative Computability Notion for Real Functions.	CiE	2011	DBLP DOI BibTeX RDF
1	Xiaoyang Gu, Jack H. Lutz, Satyadev Nandakumar, James S. Royer	Axiomatizing Resource Bounds for Measure.	CiE	2011	DBLP DOI BibTeX RDF
1	James I. Lathrop, Jack H. Lutz, Brian Patterson	Multi-Resolution Cellular Automata for Real Computation.	CiE	2011	DBLP DOI BibTeX RDF
1	Stoyan Mihov, Klaus U. Schulz	Computation of Similarity - Similarity Search as Computation.	CiE	2011	DBLP DOI BibTeX RDF
1	Peter Hertling, Victor L. Selivanov	Complexity Issues for Preorders on Finite Labeled Forests.	CiE	2011	DBLP DOI BibTeX RDF
1	Antoine Taveneaux	Towards an Axiomatic System for Kolmogorov Complexity.	CiE	2011	DBLP DOI BibTeX RDF
1	Florin Manea	Deciding According to the Shortest Computations.	CiE	2011	DBLP DOI BibTeX RDF
1	Shengling Wang 0002, Guohua Wu	On a Hierarchy of Plus-Cupping Degrees.	CiE	2011	DBLP DOI BibTeX RDF
1	Imran Khaliq, Bakhadyr Khoussainov, Jiamou Liu	Extracting Winning Strategies in Update Games.	CiE	2011	DBLP DOI BibTeX RDF
1	Chengling Fang, Jiang Liu 0002, Guohua Wu	Cupping and Diamond Embeddings: A Unifying Approach.	CiE	2011	DBLP DOI BibTeX RDF
1	Shankara Narayanan Krishna, Gabriel Ciobanu	Computability Power of Mobility in Enhanced Mobile Membranes.	CiE	2011	DBLP DOI BibTeX RDF
1	Yijia Chen, Jörg Flum, Moritz Müller	Consistency and Optimality.	CiE	2011	DBLP DOI BibTeX RDF
1	Merlin Carl	A Computational Approach to an Alternative Working Environment for the Constructible Universe.	CiE	2011	DBLP DOI BibTeX RDF
1	Douglas Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel	Effective Categoricity of Injection Structures.	CiE	2011	DBLP DOI BibTeX RDF
1	Juan Castellanos, Victor Mitrana, Eugenio Santos	Splicing Systems: Accepting Versus Generating.	CiE	2011	DBLP DOI BibTeX RDF
1	Russell Miller 0001, Alexey Ovchinnikov	Adapting Rabin's Theorem for Differential Fields.	CiE	2011	DBLP DOI BibTeX RDF
1	Hiroshi Umeo, Kinuo Nishide, Takuya Yamawaki	A New Optimum-Time Firing Squad Synchronization Algorithm for Two-Dimensional Rectangle Arrays: One-Sided Recursive Halving Based.	CiE	2011	DBLP DOI BibTeX RDF
1	Victor L. Selivanov	A Fine Hierarchy of ω-Regular k-Partitions.	CiE	2011	DBLP DOI BibTeX RDF
1	John Case, Sanjay Jain 0001, Yuh Shin Ong, Pavel Semukhin, Frank Stephan 0001	Automatic Learners with Feedback Queries.	CiE	2011	DBLP DOI BibTeX RDF
1	Rebecca M. Steiner	Computable Fields and Weak Truth-Table Reducibility.	CiE	2010	DBLP DOI BibTeX RDF
1	Sara L. Uckelman	Computing with Concepts, Computing with Numbers: Llull, Leibniz, and Boole.	CiE	2010	DBLP DOI BibTeX RDF
1	Kojiro Higuchi	Pw{\cal P}_w Is Not a Heyting Algebra.	CiE	2010	DBLP DOI BibTeX RDF
1	Lutz Straßburger	What Is the Problem with Proof Nets for Classical Logic?	CiE	2010	DBLP DOI BibTeX RDF
1	Oleg V. Kudinov, Victor L. Selivanov, Lyudmila V. Yartseva	Definability in the Subword Order.	CiE	2010	DBLP DOI BibTeX RDF
1	Giancarlo Mauri, Alberto Leporati, Antonio E. Porreca, Claudio Zandron	Computational Complexity Aspects in Membrane Computing.	CiE	2010	DBLP DOI BibTeX RDF
1	Debora Donato	Graph Structures and Algorithms for Query-Log Analysis.	CiE	2010	DBLP DOI BibTeX RDF
1	Bakhadyr Khoussainov, Andrei S. Morozov	On Index Sets of Some Properties of Computable Algebras.	CiE	2010	DBLP DOI BibTeX RDF
1	Jeff B. Paris, Soroush R. Rad	A Note on the Least Informative Model of a Theory.	CiE	2010	DBLP DOI BibTeX RDF
1	Mathias Barra, Philipp Gerhardy	The Ordinal of Skolem + Tetration Is tau0.	CiE	2010	DBLP DOI BibTeX RDF
1	Santiago Figueira, Denis R. Hirschfeldt, Joseph S. Miller, Keng Meng Ng, André Nies	Counting the Changes of Random D02 Sets.	CiE	2010	DBLP DOI BibTeX RDF
1	Pablo Arrighi, Gilles Dowek	On the Completeness of Quantum Computation Models.	CiE	2010	DBLP DOI BibTeX RDF
1	Bjørn Kjos-Hanssen, Jan Reimann 0001	The Strength of the Besicovitch-Davies Theorem.	CiE	2010	DBLP DOI BibTeX RDF
1	Jiang Liu 0002, Guohua Wu	Degrees with Almost Universal Cupping Property.	CiE	2010	DBLP DOI BibTeX RDF
1	David H. Wolpert	Inference Concerning Physical Systems.	CiE	2010	DBLP DOI BibTeX RDF
1	Jeannette C. M. Janssen	Spatial Models for Virtual Networks.	CiE	2010	DBLP DOI BibTeX RDF
1	Michiel De Smet, Andreas Weiermann	A Miniaturisation of Ramsey's Theorem.	CiE	2010	DBLP DOI BibTeX RDF
1	Oleg V. Kudinov, Victor L. Selivanov, Anton V. Zhukov	Undecidability in Weihrauch Degrees.	CiE	2010	DBLP DOI BibTeX RDF
1	Thorsten Altenkirch, Paul Blain Levy, Sam Staton	Higher-Order Containers.	CiE	2010	DBLP DOI BibTeX RDF
1	Dominic Dumrauf, Tim Süß	On the Complexity of Local Search for Weighted Standard Set Problems.	CiE	2010	DBLP DOI BibTeX RDF
1	Luca Cardelli, Philippa Gardner	Processes in Space.	CiE	2010	DBLP DOI BibTeX RDF
1	Michèle Friend	Boole: From Calculating Numbers to Calculating Thoughts.	CiE	2010	DBLP DOI BibTeX RDF
1	Martín Hötzel Escardó, Paulo Oliva	Computational Interpretations of Analysis via Products of Selection Functions.	CiE	2010	DBLP DOI BibTeX RDF
1	Ulrich Berger 0001, Monika Seisenberger	Proofs, Programs, Processes.	CiE	2010	DBLP DOI BibTeX RDF
1	Dieter Spreen	Every D02\Delta^0_2-Set Is Natural, Up to Turing Equivalence.	CiE	2010	DBLP DOI BibTeX RDF
1	Arist Kojevnikov, Alexander S. Kulikov	Circuit Complexity and Multiplicative Complexity of Boolean Functions.	CiE	2010	DBLP DOI BibTeX RDF
1	Martín Hötzel Escardó, Paulo Oliva	The Peirce Translation and the Double Negation Shift.	CiE	2010	DBLP DOI BibTeX RDF
1	John M. Hitchcock	Lower Bounds for Reducibility to the Kolmogorov Random Strings.	CiE	2010	DBLP DOI BibTeX RDF
1	Douglas A. Cenzer, S. Ali Dashti, Ferit Toska, Sebastian Wyman	Computability of Countable Subshifts.	CiE	2010	DBLP DOI BibTeX RDF
1	Alexander G. Melnikov	Computable Ordered Abelian Groups and Fields.	CiE	2010	DBLP DOI BibTeX RDF
1	Samuel Mimram	Focusing in Asynchronous Games.	CiE	2010	DBLP DOI BibTeX RDF
1	Trifon Trifonov	Quasi-linear Dialectica Extraction.	CiE	2010	DBLP DOI BibTeX RDF
1	Christian Glaßer, Christian Reitwießner, Heinz Schmitz, Maximilian Witek	Approximability and Hardness in Multi-objective Optimization.	CiE	2010	DBLP DOI BibTeX RDF
1	Laurent Bienvenu, Frank Stephan 0001, Jason Teutsch	How Powerful Are Integer-Valued Martingales?	CiE	2010	DBLP DOI BibTeX RDF
1	Natasa Jonoska, Masahico Saito	DNA Rearrangements through Spatial Graphs.	CiE	2010	DBLP DOI BibTeX RDF
1	Giuseppe Longo	Incomputability in Physics.	CiE	2010	DBLP DOI BibTeX RDF
1	Laurent Bienvenu, Adam R. Day, Ilya Mezhirov, Alexander Shen	Ergodic-Type Characterizations of Algorithmic Randomness.	CiE	2010	DBLP DOI BibTeX RDF
1	Guillaume Blin, Romeo Rizzi, Stéphane Vialette	A Faster Algorithm for Finding Minimum Tucker Submatrices.	CiE	2010	DBLP DOI BibTeX RDF
1	Stefan S. Dantchev, Barnaby Martin	The Limits of Tractability in Resolution-Based Propositional Proof Systems.	CiE	2010	DBLP DOI BibTeX RDF
1	Andre Souto	Kolmogorov Complexity Cores.	CiE	2010	DBLP DOI BibTeX RDF
1	Eric Allender	Avoiding Simplicity Is Complex.	CiE	2010	DBLP DOI BibTeX RDF
1	Florin Manea, Carlos Martín-Vide, Victor Mitrana	Hairpin Lengthening.	CiE	2010	DBLP DOI BibTeX RDF
1	Jack H. Lutz, Brad Shutters	Approximate Self-assembly of the Sierpinski Triangle.	CiE	2010	DBLP DOI BibTeX RDF
1	Rahul Santhanam	The Complexity of Explicit Constructions.	CiE	2010	DBLP DOI BibTeX RDF
1	Olga Pombo	Three Roots for Leibniz's Contribution to the Computational Conception of Reason.	CiE	2010	DBLP DOI BibTeX RDF
1	Fernando Ferreira 0001, Benedikt Löwe, Elvira Mayordomo, Luís Mendes Gomes (eds.)	Programs, Proofs, Processes, 6th Conference on Computability in Europe, CiE 2010, Ponta Delgada, Azores, Portugal, June 30 - July 4, 2010. Proceedings	CiE	2010	DBLP DOI BibTeX RDF
1	Yasubumi Sakakibara	Development of a Bacteria Computer: From in silico Finite Automata to in vitro and in vivo.	CiE	2010	DBLP DOI BibTeX RDF
1	Yuri I. Manin	Infinities in Quantum Field Theory and in Classical Computing: Renormalization Program.	CiE	2010	DBLP DOI BibTeX RDF
1	Liesbeth De Mol, Maarten Bullynck, Martin Carlé	Haskell before Haskell: Curry's Contribution to Programming (1946-1950).	CiE	2010	DBLP DOI BibTeX RDF
1	Martín Hötzel Escardó	Computability of Continuous Solutions of Higher-Type Equations.	CiE	2009	DBLP DOI BibTeX RDF	Higher-type computability, Kleene-Kreisel spaces of continuous functionals, exhaustible set
1	Alexander G. Melnikov	0"-Categorical Completely Decomposable Torsion-Free Abelian Groups.	CiE	2009	DBLP DOI BibTeX RDF	torsion-free abelian groups, computable categoricity, Computable model theory
1	Trifon Trifonov	Dialectica Interpretation with Fine Computational Control.	CiE	2009	DBLP DOI BibTeX RDF
1	Cameron E. Freer, Daniel M. Roy 0001	Computable Exchangeable Sequences Have Computable de Finetti Measures.	CiE	2009	DBLP DOI BibTeX RDF	de Finetti, computable probability theory, probabilistic programming languages, mutation, exchangeability
1	Manuel Bodirsky, Miki Hermann, Florian Richoux	Complexity of Existential Positive First-Order Logic.	CiE	2009	DBLP DOI BibTeX RDF	Existential Positive First-Order Logic, Computational Complexity, Constraint Satisfaction Problems
1	Oleg V. Kudinov, Victor L. Selivanov	A Gandy Theorem for Abstract Structures and Applications to First-Order Definability.	CiE	2009	DBLP DOI BibTeX RDF	Gandy theorem, least fixed point, biinterpretability, labeled forest, h-quasiorder, definability
1	Francisco José Romero-Campero, Natalio Krasnogor	An Approach to the Engineering of Cellular Models Based on P Systems.	CiE	2009	DBLP DOI BibTeX RDF
1	Paul Brodhead, Bjørn Kjos-Hanssen	The Strength of the Grätzer-Schmidt Theorem.	CiE	2009	DBLP DOI BibTeX RDF	computability theory, lattice theory
1	Jeff B. Paris, Alena Vencovská	A General Representation Theorem for Probability Functions Satisfying Spectrum Exchangeability.	CiE	2009	DBLP DOI BibTeX RDF	Polyadic Inductive Logic, Spectrum Exchangeability, Language Invariance
1	David R. Bélanger	Structures of Some Strong Reducibilities.	CiE	2009	DBLP DOI BibTeX RDF
1	Grégory Lafitte, Michael Weiss	Constructing New Aperiodic Self-simulating Tile Sets.	CiE	2009	DBLP DOI BibTeX RDF
1	David Diamondstone, Bjørn Kjos-Hanssen	Members of Random Closed Sets.	CiE	2009	DBLP DOI BibTeX RDF	random closed sets, computability theory
1	Ekaterina B. Fokina, Sy-David Friedman	Equivalence Relations on Classes of Computable Structures.	CiE	2009	DBLP DOI BibTeX RDF
1	Peter Koepke	Ordinal Computability.	CiE	2009	DBLP DOI BibTeX RDF	Ordinal machines, Infinite Time Register Machines, Constructible sets
1	Hristo Ganchev	Definability in the Local Theory of the omega-Enumeration Degrees.	CiE	2009	DBLP DOI BibTeX RDF
1	Yijia Chen, Jörg Flum, Moritz Müller	Lower Bounds for Kernelizations and Other Preprocessing Procedures.	CiE	2009	DBLP DOI BibTeX RDF	kernelization, preprocessing, Parameterized complexity
1	Harald Räcke	Survey on Oblivious Routing Strategies.	CiE	2009	DBLP DOI BibTeX RDF
1	Ross Duncan, Simon Perdrix	Graph States and the Necessity of Euler Decomposition.	CiE	2009	DBLP DOI BibTeX RDF	graphical calculi, quantum computation, monoidal categories
1	Klaus Ambos-Spies, Benedikt Löwe, Wolfgang Merkle (eds.)	Mathematical Theory and Computational Practice, 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009. Proceedings	CiE	2009	DBLP DOI BibTeX RDF
1	Mathias Barra, Philipp Gerhardy	Skolem + Tetration Is Well-Ordered.	CiE	2009	DBLP DOI BibTeX RDF
1	Rod Downey, Keng Meng Ng	Lowness for Demuth Randomness.	CiE	2009	DBLP DOI BibTeX RDF
1	Kohtaro Tadaki	Chaitin Omega Numbers and Halting Problems.	CiE	2009	DBLP DOI BibTeX RDF	algorithmic information theory, Chaitin ? number, program-size complexity, algorithmic randomness, Turing reduction, halting problem
1	Soumya Paul, Ramaswamy Ramanujam, Sunil Easaw Simon	Stability under Strategy Switching.	CiE	2009	DBLP DOI BibTeX RDF	strategy specifications, strategy switching, Graphical games
1	Jean Cardinal, Samuel Fiorini, Gwenaël Joret	Minimum Entropy Combinatorial Optimization Problems.	CiE	2009	DBLP DOI BibTeX RDF
1	Willem L. Fouché	Fractals Generated by Algorithmically Random Brownian Motion.	CiE	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 03D20, 68Q30, 60J65, 60G05, 60G17
1	Alla Sirokofskich	Decidability of Sub-theories of Polynomials over a Finite Field.	CiE	2009	DBLP DOI BibTeX RDF
1	Tim Button	Hyperloops Do Not Threaten the Notion of an Effective Procedure.	CiE	2009	DBLP DOI BibTeX RDF
1	Thomas Anberrée	First-Order Universality for Real Programs.	CiE	2009	DBLP DOI BibTeX RDF	real number computation, simply typed lambda-calculus, computability, denotational semantics
1	Gyesik Lee	Relationship between Kanamori-McAloon Principle and Paris-Harrington Theorem.	CiE	2009	DBLP DOI BibTeX RDF	Kanamori-McAloon principle, Paris-Harrington theorem, Peano Arithmetic, independence
1	Andrew E. M. Lewis, André Nies, Andrea Sorbi	The First Order Theories of the Medvedev and Muchnik Lattices.	CiE	2009	DBLP DOI BibTeX RDF
1	Philip M. R. Tedder, James R. Bradford, Chris J. Needham, Glenn A. McConkey, Andrew J. Bulpitt, David R. Westhead	Bayesian Data Integration and Enrichment Analysis for Predicting Gene Function in Malaria.	CiE	2009	DBLP DOI BibTeX RDF	Plasmodium falciparum, gene function prediction, machine learning, heterogeneous data sources, Bayes classifier, malaria
1	Ian Pratt-Hartmann, Ivo Düntsch	Functions Definable by Arithmetic Circuits.	CiE	2009	DBLP DOI BibTeX RDF	integer expression, complex algebra, Arithmetic circuit, expressive power

Publications at "CiE"( http://dblp.L3S.de/Venues/CiE )