Abstract is missing.
- Computability and Categoricity of Ultrahomogeneous StructuresFrancis Adams, Douglas Cenzer. 1-10 [doi]
- Parameterized Inapproximability of Target Set Selection and GeneralizationsCristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora. 11-20 [doi]
- How can Grammatical Inference Contribute to Computational Linguistics?Leonor Becerra-Bonache. 21-31 [doi]
- Algorithms and Their ExplanationsMarco Benini, Federico Gobbo. 32-41 [doi]
- Gene Tree Correction by Leaf Removal and Modification: Tractability and ApproximabilityStefano Beretta, Riccardo Dondi. 42-52 [doi]
- Uniform Schemata for Proof RulesUlrich Berger, Tie Hou. 53-62 [doi]
- Graph Polynomials Motivated by Gene Rearrangements in CiliatesRobert Brijder, Hendrik Jan Hoogeboom. 63-72 [doi]
- On the Equivalence of Automata for KAT-expressionsSabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis. 73-83 [doi]
- Algorithmic Randomness for Infinite Time Register MachinesMerlin Carl. 84-92 [doi]
- Constraint Logic Programming for Resolution of Relative Time ExpressionsHenning Christiansen. 93-102 [doi]
- Maximal Parallelism in Membrane Systems with Generated Membrane BoundariesZoltán Erno Csajbók, Tamás Mihálydeák. 103-112 [doi]
- Learnability Thesis Does Not Entail Church's ThesisMarek Czarnecki, Michal Tomasz Godziszewski, Dariusz Kalocinski. 113-122 [doi]
- Phase Transitions Related to the Pigeonhole PrincipleMichiel De Smet, Andreas Weiermann. 123-132 [doi]
- Generic Parallel AlgorithmsNachum Dershowitz, Evgenia Falkovich. 133-142 [doi]
- Isomorphisms of Non-Standard Fields and Ash's ConjectureRumen D. Dimitrov, Valentina S. Harizanov, Russell Miller, K. J. Mourad. 143-152 [doi]
- Modeling Life as Cognitive Info-computationGordana Dodig-Crnkovic. 153-162 [doi]
- Deciding the Borel Complexity of Regular Tree LanguagesAlessandro Facchini, Henryk Michalewski. 163-172 [doi]
- Chemical Production and Molecular Computing in Addressable Reaction CompartmentsHarold Fellermann, Natalio Krasnogor. 173-182 [doi]
- Visual Modelling of Complex Systems: Towards an Abstract Machine for PORGYMaribel Fernández, Hélène Kirchner, Ian Mackie, Bruno Pinaud. 183-193 [doi]
- Fixed Points and Attractors of Reaction SystemsEnrico Formenti, Luca Manzoni, Antonio E. Porreca. 194-203 [doi]
- Fit-Preserving Data Refinement of Mass-Action Reaction NetworksCristian Gratie, Ion Petre. 204-213 [doi]
- On Maximal Block Functions of Computable η-like Linear OrderingsCharles M. Harris. 214-223 [doi]
- Lossiness of Communication Channels Modeled by TransducersOscar H. Ibarra, Cewei Cui, Zhe Dang, Thomas R. Fischer. 224-233 [doi]
- Predicate Characterizations in the Polynomial-Size HierarchyChristos A. Kapoutsis. 234-244 [doi]
- Function Spaces for Second-Order Polynomial TimeAkitoshi Kawamura, Arno Pauly. 245-254 [doi]
- Complexity of Operation ProblemsMartin Kutrib. 255-264 [doi]
- A Computational Model of XACML-Based Access Control Management in Distributed NetworksKatalin Anna Lázár. 265-274 [doi]
- Early Machine Translation - Integration and Transfers between Computing and the Language SciencesJacqueline Léon. 275-282 [doi]
- Lines Missing Every Random PointJack H. Lutz, Neil Lutz. 283-292 [doi]
- Natural Descriptions and Anthropic Bias: Extant Problems In Solomonoff InductionSimon McGregor. 293-302 [doi]
- An Efficient Algorithm for the Equation Tree Automaton via the k-C-ContinuationsLudovic Mignot, Nadia Ouali Sebti, Djelloul Ziadi. 303-313 [doi]
- On the Effectiveness of Symmetry BreakingRussell Miller, Reed Solomon, Rebecca M. Steiner. 314-323 [doi]
- On the Ramseyan Factorization TheoremShota Murakami, Takeshi Yamazaki, Keita Yokoyama. 324-332 [doi]
- The Complexity of Satisfaction Problems in Reverse MathematicsLudovic Patey. 333-342 [doi]
- An Early Completion Algorithm: Thue's 1914 Paper on the Transformation of Symbol SequencesJames F. Power. 343-346 [doi]
- Metric-Driven Grammars and Morphogenesis (Extended Abstract)Przemyslaw Prusinkiewicz, Brendan Lane, Adam Runions. 347-351 [doi]
- Hyperprojective Hierarchy of qcb0-SpacesMatthias Schröder, Victor Selivanov. 352-361 [doi]
- Online Bin Packing: Old Algorithms and New ResultsJirí Sgall. 362-372 [doi]
- Pluralism Ignored: The Church-Turing Thesis and Philosophical PracticeG. Graham White. 373-382 [doi]
- The FPGA-Based High-Performance Computer RIVYERA for Applications in BioinformaticsLars Wienbrandt. 383-392 [doi]
- Exploiting Membrane Features to ComputeClaudio Zandron. 393-402 [doi]
- Short Lists with Short Programs in Short Time - A Short ProofMarius Zimand. 403-408 [doi]