Abstract is missing.
- Real Benefit of Promises and AdviceKlaus Ambos-Spies, Ulrike Brandt, Martin Ziegler. 1-11 [doi]
- Computability and Computational Complexity of the Evolution of Nonlinear Dynamical SystemsOlivier Bournez, Daniel S. Graça, Amaury Pouly, Ning Zhong. 12-21 [doi]
- An Overview of Genomic Distances Modeled with IndelsMarília D. V. Braga. 22-31 [doi]
- Noise versus Computational Intractability in DynamicsMark Braverman. 32 [doi]
- Cluster EditingSebastian Böcker, Jan Baumbach. 33-44 [doi]
- Beyond Rogers' Non-constructively Computable FunctionJohn Case, Michael Ralston. 45-54 [doi]
- Constructing Continuous Systems from Discrete Cellular AutomataJulien Cervelle. 55-64 [doi]
- Latency-Bounded Target Set Selection in Social NetworksFerdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Ugo Vaccaro. 65-77 [doi]
- Summary Data Structures for Massive DataGraham Cormode. 78-86 [doi]
- Determinant versus Permanent: Salvation via Generalization?Nicolas de Rugy-Altherre. 87-96 [doi]
- Aligning and Labeling Genomes under the Duplication-Loss ModelRiccardo Dondi, Nadia El-Mabrouk. 97-107 [doi]
- Irrationality Is Needed to Compute with Signal Machines with Only Three SpeedsJérôme Durand-Lose. 108-119 [doi]
- Processes Inspired by the Functioning of Living Cells: Natural Computing ApproachAndrzej Ehrenfeucht, Grzegorz Rozenberg. 120-122 [doi]
- Recent Developments in Collective Decision Making in Combinatorial DomainsUlle Endriss. 123 [doi]
- Software Streams: Big Data Challenges in Dynamic Program AnalysisIrene Finocchi. 124-134 [doi]
- On λ-Definable Functions on OrdinalsTim Fischbach, Benjamin Seyfferth. 135-146 [doi]
- A Personal View of the P versus NP ProblemLance Fortnow. 147-148 [doi]
- An Investigation on Genomic RepeatsGiuditta Franco, Alessio Milanese. 149-160 [doi]
- Local Computability for OrdinalsJohanna N. Y. Franklin, Asher M. Kach, Russell Miller, Reed Solomon. 161-170 [doi]
- A Note on the Sequential Version of StatementsMakoto Fujiwara, Keita Yokoyama. 171-180 [doi]
- On Conservative Learning of Recursively Enumerable LanguagesZiyuan Gao, Sanjay Jain, Frank Stephan. 181-190 [doi]
- Topology of Asymptotic Cones and Non-deterministic Polynomial Time ComputationsAnthony Gasperin. 191-199 [doi]
- On Decidable and Computable Models of TheoriesAlexander Gavruskin, Bakhadyr Khoussainov. 200-209 [doi]
- Discovering Hidden Repetitions in WordsPawel Gawrychowski, Florin Manea, Dirk Nowotka. 210-219 [doi]
- Language Forbidding-Enforcing Systems Defining DNA CodewordsDaniela Genova. 220-229 [doi]
- Computing K-Trivial Sets by Incomplete Random SetsNoam Greenberg. 230 [doi]
- Cardinal-Recognizing Infinite Time Turing MachinesMiha E. Habic. 231-240 [doi]
- 'Stored Program Concept' Considered Harmful: History and HistoriographyThomas Haigh. 241-251 [doi]
- The Complexity of Interior Point Methods for Solving Discounted Turn-Based Stochastic GamesThomas Dueholm Hansen, Rasmus Ibsen-Jensen. 252-262 [doi]
- The Computation of Nature, Or: Does the Computer Drive Science and Technology?Ulf Hashagen. 263-270 [doi]
- Negative Glues and Non-determinism in Nanocomputations by Self-assemblyLila Kari. 271-272 [doi]
- Structures without Scattered-Automatic PresentationAlexander Kartzow, Philipp Schlicht. 273-283 [doi]
- Some Classes of Generalised Communicating P Systems and Simple Kernel P SystemsShankara Narayanan Krishna, Marian Gheorghe, Ciprian Dragomir. 284-293 [doi]
- Closed Choice for Finite and for Convex SetsStéphane Le Roux, Arno Pauly. 294-305 [doi]
- Realizability Models Separating Various Fan TheoremsRobert S. Lubarsky, Michael Rathjen. 306-315 [doi]
- Towards a Theory of Homomorphic CompressionAndrew McGregor. 316-319 [doi]
- The Classification Problem for Compact Computable Metric SpacesAlexander G. Melnikov, André Nies. 320-328 [doi]
- Exploiting Co-evolution across Protein Families for Predicting Native Contacts and Protein-Protein Interaction SurfacesAndrea Pagnani. 329 [doi]
- A Compositional Semantics of Reaction Systems with RestrictionGiovanni Pardini, Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo Milazzo, Simone Tini. 330-339 [doi]
- Using Random Graphs in Population GenomicsLaxmi Parida. 340-341 [doi]
- The Tarski-Lindenbaum Algebra of the Class of All Strongly Constructivizable Countable Saturated ModelsMikhail G. Peretyat'kin. 342-352 [doi]
- The Burrows-Wheeler Transform between Data Compression and Combinatorics on WordsGiovanna Rosone, Marinella Sciortino. 353-364 [doi]
- A Note on ω-Jump Inversion of Degree Spectra of StructuresIvan N. Soskov. 365-370 [doi]
- The Turing Universe in the Context of Enumeration ReducibilityMariya Ivanova Soskova. 371-382 [doi]
- Computing Game StrategiesDarko Stefanovic, Milan N. Stojanovic. 383-392 [doi]
- On Processes and StructuresAlexey Stukachev. 393-402 [doi]
- Various Regularity Lemmas in Graphs and HypergraphsEndre Szemerédi. 403 [doi]
- Three Debates about ComputingMatti Tedre. 404-413 [doi]
- Another Jump Inversion Theorem for StructuresStefan Vatev. 414-423 [doi]
- On Algorithmic Strong Sufficient StatisticsNikolay K. Vereshchagin. 424-433 [doi]
- Analytic Root Clustering: A Complete Algorithm Using Soft Zero TestsChee Yap, Michael Sagraloff, Vikram Sharma 0001. 434-444 [doi]