default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID9. CiE 2013: Milan, Italy
- Paola Bonizzoni, Vasco Brattka, Benedikt Löwe:
The Nature of Computation. Logic, Algorithms, Applications - 9th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013. Proceedings. Lecture Notes in Computer Science 7921, Springer 2013, ISBN 978-3-642-39052-4 - Klaus Ambos-Spies, Ulrike Brandt, Martin Ziegler:
Real Benefit of Promises and Advice. 1-11 - Olivier Bournez, Daniel Silva Graça
, Amaury Pouly, Ning Zhong:
Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems. 12-21 - Marília D. V. Braga:
An Overview of Genomic Distances Modeled with Indels. 22-31 - Mark Braverman:
Noise versus Computational Intractability in Dynamics. 32 - Sebastian Böcker, Jan Baumbach:
Cluster Editing. 33-44 - John Case, Michael Ralston:
Beyond Rogers' Non-constructively Computable Function. 45-54 - Julien Cervelle:
Constructing Continuous Systems from Discrete Cellular Automata. 55-64 - Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Ugo Vaccaro:
Latency-Bounded Target Set Selection in Social Networks. 65-77 - Graham Cormode:
Summary Data Structures for Massive Data. 78-86 - Nicolas de Rugy-Altherre:
Determinant versus Permanent: Salvation via Generalization? 87-96 - Riccardo Dondi, Nadia El-Mabrouk:
Aligning and Labeling Genomes under the Duplication-Loss Model. 97-107 - Jérôme Durand-Lose:
Irrationality Is Needed to Compute with Signal Machines with Only Three Speeds. 108-119 - Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Processes Inspired by the Functioning of Living Cells: Natural Computing Approach. 120-122 - Ulle Endriss:
Recent Developments in Collective Decision Making in Combinatorial Domains. 123 - Irene Finocchi:
Software Streams: Big Data Challenges in Dynamic Program Analysis. 124-134 - Tim Fischbach, Benjamin Seyfferth:
On λ-Definable Functions on Ordinals. 135-146 - Lance Fortnow:
A Personal View of the P versus NP Problem. 147-148 - Giuditta Franco, Alessio Milanese:
An Investigation on Genomic Repeats. 149-160 - Johanna N. Y. Franklin, Asher M. Kach, Russell G. Miller, Reed Solomon:
Local Computability for Ordinals. 161-170 - Makoto Fujiwara, Keita Yokoyama:
A Note on the Sequential Version of Statements. 171-180 - Ziyuan Gao, Sanjay Jain, Frank Stephan:
On Conservative Learning of Recursively Enumerable Languages. 181-190 - Anthony Gasperin:
Topology of Asymptotic Cones and Non-deterministic Polynomial Time Computations. 191-199 - Alexander Gavruskin, Bakhadyr Khoussainov:
On Decidable and Computable Models of Theories. 200-209 - Pawel Gawrychowski, Florin Manea, Dirk Nowotka:
Discovering Hidden Repetitions in Words. 210-219 - Daniela Genova:
Language Forbidding-Enforcing Systems Defining DNA Codewords. 220-229 - Noam Greenberg:
Computing K-Trivial Sets by Incomplete Random Sets. 230 - Miha E. Habic:
Cardinal-Recognizing Infinite Time Turing Machines. 231-240 - Thomas Haigh:
'Stored Program Concept' Considered Harmful: History and Historiography. 241-251 - Thomas Dueholm Hansen, Rasmus Ibsen-Jensen:
The Complexity of Interior Point Methods for Solving Discounted Turn-Based Stochastic Games. 252-262 - Ulf Hashagen:
The Computation of Nature, Or: Does the Computer Drive Science and Technology? 263-270 - Lila Kari:
Negative Glues and Non-determinism in Nanocomputations by Self-assembly. 271-272 - Alexander Kartzow, Philipp Schlicht:
Structures without Scattered-Automatic Presentation. 273-283 - Shankara Narayanan Krishna, Marian Gheorghe, Ciprian Dragomir:
Some Classes of Generalised Communicating P Systems and Simple Kernel P Systems. 284-293 - Stéphane Le Roux, Arno Pauly:
Closed Choice for Finite and for Convex Sets. 294-305 - Robert S. Lubarsky, Michael Rathjen:
Realizability Models Separating Various Fan Theorems. 306-315 - Andrew McGregor:
Towards a Theory of Homomorphic Compression. 316-319 - Alexander G. Melnikov, André Nies:
The Classification Problem for Compact Computable Metric Spaces. 320-328 - Andrea Pagnani:
Exploiting Co-evolution across Protein Families for Predicting Native Contacts and Protein-Protein Interaction Surfaces. 329 - Giovanni Pardini, Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo Milazzo, Simone Tini:
A Compositional Semantics of Reaction Systems with Restriction. 330-339 - Laxmi Parida:
Using Random Graphs in Population Genomics. 340-341 - Mikhail G. Peretyat'kin:
The Tarski-Lindenbaum Algebra of the Class of All Strongly Constructivizable Countable Saturated Models. 342-352 - Giovanna Rosone, Marinella Sciortino:
The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words. 353-364 - Ivan N. Soskov:
A Note on ω-Jump Inversion of Degree Spectra of Structures. 365-370 - Mariya Ivanova Soskova:
The Turing Universe in the Context of Enumeration Reducibility. 371-382 - Darko Stefanovic, Milan N. Stojanovic:
Computing Game Strategies. 383-392 - Alexey Stukachev:
On Processes and Structures. 393-402 - Endre Szemerédi:
Various Regularity Lemmas in Graphs and Hypergraphs. 403 - Matti Tedre:
Three Debates about Computing. 404-413 - Stefan V. Vatev:
Another Jump Inversion Theorem for Structures. 414-423 - Nikolay K. Vereshchagin:
On Algorithmic Strong Sufficient Statistics. 424-433 - Chee Yap, Michael Sagraloff, Vikram Sharma:
Analytic Root Clustering: A Complete Algorithm Using Soft Zero Tests. 434-444
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 2025-01-18 01:14 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:
