default search action
10. CiE 2014: Budapest, Hungary
- Arnold Beckmann, Erzsébet Csuhaj-Varjú, Klaus Meer:
Language, Life, Limits - 10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014. Proceedings. Lecture Notes in Computer Science 8493, Springer 2014, ISBN 978-3-319-08018-5 - Francis Adams, Douglas Cenzer:
Computability and Categoricity of Ultrahomogeneous Structures. 1-10 - Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora:
Parameterized Inapproximability of Target Set Selection and Generalizations. 11-20 - Leonor Becerra-Bonache:
How can Grammatical Inference Contribute to Computational Linguistics? 21-31 - Marco Benini, Federico Gobbo
:
Algorithms and Their Explanations. 32-41 - Stefano Beretta
Gene Tree Correction by Leaf Removal and Modification: Tractability and Approximability. 42-52 - Ulrich Berger
Uniform Schemata for Proof Rules. 53-62 - Robert Brijder
Graph Polynomials Motivated by Gene Rearrangements in Ciliates. 63-72 - Sabine Broda
On the Equivalence of Automata for KAT-expressions. 73-83 - Merlin Carl:
Algorithmic Randomness for Infinite Time Register Machines. 84-92 - Henning Christiansen
Constraint Logic Programming for Resolution of Relative Time Expressions. 93-102 - Zoltán Erno Csajbók, Tamás Mihálydeák
Maximal Parallelism in Membrane Systems with Generated Membrane Boundaries. 103-112 - Marek Czarnecki, Michal Tomasz Godziszewski, Dariusz Kalocinski:
Learnability Thesis Does Not Entail Church's Thesis. 113-122 - Michiel De Smet, Andreas Weiermann
Phase Transitions Related to the Pigeonhole Principle. 123-132 - Nachum Dershowitz, Evgenia Falkovich:
Generic Parallel Algorithms. 133-142 - Rumen D. Dimitrov, Valentina S. Harizanov, Russell G. Miller, K. J. Mourad:
Isomorphisms of Non-Standard Fields and Ash's Conjecture. 143-152 - Gordana Dodig-Crnkovic
Modeling Life as Cognitive Info-computation. 153-162 - Alessandro Facchini
Deciding the Borel Complexity of Regular Tree Languages. 163-172 - Harold Fellermann, Natalio Krasnogor:
Chemical Production and Molecular Computing in Addressable Reaction Compartments. 173-182 - Maribel Fernández, Hélène Kirchner
Visual Modelling of Complex Systems: Towards an Abstract Machine for PORGY. 183-193 - Enrico Formenti
Fixed Points and Attractors of Reaction Systems. 194-203 - Cristian Gratie
Fit-Preserving Data Refinement of Mass-Action Reaction Networks. 204-213 - Charles M. Harris:
On Maximal Block Functions of Computable η-like Linear Orderings. 214-223 - Oscar H. Ibarra, Cewei Cui, Zhe Dang, Thomas R. Fischer:
Lossiness of Communication Channels Modeled by Transducers. 224-233 - Christos A. Kapoutsis
Predicate Characterizations in the Polynomial-Size Hierarchy. 234-244 - Akitoshi Kawamura, Arno Pauly
Function Spaces for Second-Order Polynomial Time. 245-254 - Martin Kutrib
Complexity of Operation Problems. 255-264 - Katalin Anna Lázár:
A Computational Model of XACML-Based Access Control Management in Distributed Networks. 265-274 - Jacqueline Léon:
Early Machine Translation - Integration and Transfers between Computing and the Language Sciences. 275-282 - Jack H. Lutz, Neil Lutz:
Lines Missing Every Random Point. 283-292 - Simon McGregor:
Natural Descriptions and Anthropic Bias: Extant Problems In Solomonoff Induction. 293-302 - Ludovic Mignot
An Efficient Algorithm for the Equation Tree Automaton via the k-C-Continuations. 303-313 - Russell G. Miller, Reed Solomon, Rebecca M. Steiner:
On the Effectiveness of Symmetry Breaking. 314-323 - Shota Murakami, Takeshi Yamazaki, Keita Yokoyama
On the Ramseyan Factorization Theorem. 324-332 - Ludovic Patey
The Complexity of Satisfaction Problems in Reverse Mathematics. 333-342 - James F. Power
An Early Completion Algorithm: Thue's 1914 Paper on the Transformation of Symbol Sequences. 343-346 - Przemyslaw Prusinkiewicz, Brendan Lane, Adam Runions
Metric-Driven Grammars and Morphogenesis (Extended Abstract). 347-351 - Matthias Schröder
Hyperprojective Hierarchy of qcb0-Spaces. 352-361 - Jirí Sgall
Online Bin Packing: Old Algorithms and New Results. 362-372 - G. Graham White:
Pluralism Ignored: The Church-Turing Thesis and Philosophical Practice. 373-382 - Lars Wienbrandt
The FPGA-Based High-Performance Computer RIVYERA for Applications in Bioinformatics. 383-392 - Claudio Zandron:
Exploiting Membrane Features to Compute. 393-402 - Marius Zimand:
Short Lists with Short Programs in Short Time - A Short Proof. 403-408
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-12-18 18:16 CET 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: