
Author

Title

 Grazyna Zwozniak 
Induced matchings in graphs of maximum degree three 
 Keita Yokoyama 
Reverse Mathematics for Fourier Expansion 
 Guohua Wu and Jiang Liu 
Joining to High Degrees 
 Joost Winter 
Space Complexity in Ordinal Turing Machines 
 Michael Weiss and Gregory Lafitte 
Simulations Between Tilings 
 Daniel Ventura, Mauricio AyalaRincon and Fairouz Kamareddine 
Principal Typings for Explicit Substitutions Calculi 
 Alina Vasilieva 
Quantum Query Algorithms for AND and OR Boolean Functions 
 Guillaume Theyssier and Mathieu Sablik 
Topological Dynamics of 2D Cellular Automata 
 Hayato Takahashi and Kazuyuki Aihara 
Probabilistic machines vs. relativized computation 
 Ákos Tajti and Benedek Nagy 
Solving Tripartite Matching by Intervalvalued Computation in Polynomial Time 
 Kohtaro Tadaki 
A statistical mechanical interpretation of algorithmic information theory 
 Mariya Ivanova Soskova 
Cupping Classes of Sigma 2 Enumeration Degrees 
 Alexandra Soskova 
Omega Degree Spectra 
 Michael Soltys and Craig Wilson 
On the complexity of computing winning strategies for finite poset games 
 Boris Solon 
Almost partial mreducibility 
 Victor Selivanov and Klaus W. Wagner 
Complexity of aperiodicity for topological properties of regular $\omega$languages 
 Zenon Sadowski 
Optimal proof systems and complete languages 
 Krishna S, Lakshmi Manasa G and Kumar Nagaraj 
Updatable Timed Automata with Additive and Diagonal Constraints 
 Krishna S and Gabriel Ciobanu 
On the Computational Power of Enhanced Mobile Membranes 
 Vladimir Rybakov and Sergei Babyonyshev 
Decidability of Hybrid Logic with Local Common Knowledge based on Linear Temporal Logic LTL 
 Alexandra Revenko 
Autostability of Automatic Linear Orders 
 Daowen Qiu 
Simulations of Quantum Turing Machines by Quantum MultiCounter Machines 
 Mihai Prunescu 
Polynomial iterations over finite fields 
 Petrus H. Potgieter 
Computable counterexamples to the Brouwer fixedpoint theorem 
 Sergei Podzorov 
Upper Semilattices in ManyOne Degrees 
 Yongri Piao, Seoktae Kim and SungJin Cho 
TwoDimensional Cellular Automata Transforms for a Novel Edge Detection 
 Florian Pelupessy and Andreas Weiermann 
Classifying the phase transition threshold for unordered regressive Ramsey numbers 
 Nicolas Ollinger 
Twobytwo Substitution Systems and the Undecidability of the Domino Problem 
 Vivek Nigam 
Using Tables to Construct NonRedundant Proofs 
 Takako Nemoto 
Complete Determinacy and Subsystems of Second Order Arithmetic 
 Marcin Mostowski 
Limiting recursion, FMrepressentability, and hypercomputations 
 Russell Miller and Dustin Mulcahey 
Perfect Local Computability and Computable Simulations 
 Barnaby Martin 
FirstOrder Model Checking Problems Parameterized by the Model 
 Angelos Manousaridis, Michalis Papakyriakou and Nikolaos Papaspyrou 
From Program Verification to Certified Binaries 
 Johann Makowsky 
From Hilbert's Program to a Logic Toolbox 
 Iris Loeb 
Factoring out Intuitionistic Theorems: Continuity Principles and the Uniform Continuity Theorem 
 ChungChih Li 
QueryOptimal Oracle Turing Machines for Type2 Computations 
 Maikel Leon, Isis Bonet and Zenaida Garcia 
Combining Concept Maps and Petri Nets to Generate Intelligent Tutoring Systems 
 Stephane Le Roux 
Discrete Non Determinism and Nash Equilibria for StrategyBased Games 
 James Lathrop, Jack H. Lutz, Matthew J. Patitz and Scott M. Summers 
Computability and Complexity in SelfAssembly 
 Sunil Kothari and James Caldwell 
On Extending Wand's Type Reconstruction Algorithm to Handle Polymorphic Let 
 Margarita Korovina and Nicolai Vorobjov 
Safety Properties Verification for Pfaffian Dynamics 
 Peter Koepke and Russell Miller 
An Enhanced Theory of Infinite Time Register Machines 
 Bakhadyr Khoussainov, Michael Brough and Peter Nelson 
Sequential Automatic Algebras 
 Basil A. Karadais 
A Plotkin Definability Theorem for AtomicCoherent Information Systems 
 Temesghen Kahsai and Marino Miculan 
Implementing Spi Calculus using Nominal techniques 
 Reinhard Kahle 
Towards Reverse ProofsasPrograms 
 Herman Ruge Jervell 
Ordering finite labeled trees 
 ilyes jenhani, Zied Elouedi and Salem Benferhat 
The Use of Information Affinity in Possibilistic Decision Tree Learning and Evaluation 
 Maurice Jansen 
A NonLinear Lower Bound for Syntactically Multilinear Algebraic Branching Programs 
 Sanjay Jain, Frank Stephan and Nan Ye 
Prescribed Learning of Indexed Families 
 Gabriel Istrate, Madhav Marathe and S. S. Ravi 
Adversarial Scheduling Analysis of GameTheoretic Models of Norm Diffusion 
 Bernhard Irrgang and Benjamin Seyfferth 
Multitape Ordinal Machines and Primitive Recursion 
 YoonHee Hwang, SungJin Cho, UnSook Choi and HanDoo Kim 
Modelling Linear Cellular Automata with the minimum stage corresponding to CCSG based on LFSR 
 Yoshihiro Horihata and Keita Yokoyama 
Singularities of Holomorphic Functions in Subsystems of Second Order Arithmetic 
 MirceaDan Hernest and Paulo Oliva 
Hybrid Functional Interpretations 
 Emmanuel Hainry 
Reachability in linear dynamical systems 
 Xiaoyang Gu and Jack H. Lutz 
Effective Dimensions and Relative Frequencies 
 Rica Gonen 
On the Hardness of Truthful Online Auctions with Multidimensional Constraints 
 Christian Glaßer, Christian Reitwießner and Victor Selivanov 
The Shrinking Property for NP and coNP 
 Alexander Gavryushkin 
Computable Models Spectras of Ehrenfeucht Theories 
 Christine Gaßner 
Computation over Groups 
 André Luiz Galdino and Mauricio AyalaRincon 
Verification of Newman's and Yokouchi's Lemmas in PVS 
 willem fouche 
Subrecursive complexity of identifying the Ramsey structure of posets 
 Ekaterina Fokina 
Algorithmic Properties of Structures for Languages with Two Unary Functional Symbols 
 Pantelis Eleftheriou, Costas Koutras and Christos Nomikos 
Notions of Bisimulation for HeytingValued Modal Languages 
 Jérôme DurandLose 
Abstract geometrical computation: beyond the Blum, Shub and Smale model with accumulation 
 Jacques Duparc and Alessandro Facchini 
Describing the Wadge Hierarchy for the Alternation Free Fragment of $\mu$Calculus (I): The Levels Below $\omega_{1}$ 
 Giovanni Di Crescenzo and Helger Lipmaa 
Succinct NP Proofs from an ExtractableAlgorithm Assumption 
 Michiel De Smet and Andreas Weiermann 
Phase transitions for weakly increasing sequences, the ErdösSzekeres theorem and the Dilworth theorem 
 Liesbeth De Mol and Maarten Bullynck 
A weekend off. The first extensive numbertheoretical computation on the ENIAC. 
 Gregorio de Miguel Casado, Juan Manuel GarcíaChamizo and Higinio Mora Mora 
Onlinedivision with Periodic Rational Numbers 
 Barbara Csima, Jiamou Liu and Bakhadyr Khoussainov 
Computable Categoricity of Graphs with Finite Components 
 Antonio Carlos Costa and Graçaliz Dimuro 
Introducing Service Schemes and Systems Organization in the Theory of Interactive Computation 
 Charalampos Cornaros 
Pell equations and weak regularity priciples 
 SungJin Cho, UnSook Choi, HanDoo Kim, YoonHee Hwang and JinGyoung Kim 
Phase shifts of LFSM as pseudorandom number generators for BIST for VLSI 
 Luca Chiarabini 
Extraction of Efficient Programs from Correct Proofs: The Case of Structural Induction over Natural Numbers 
 William Calhoun 
Triviality and Minimality in the Degrees of Monotone Complexity 
 Jérémie Cabessa and Jacques Duparc 
The Algebraic Counterpart of the Wagner Hierarchy 
 Amir BenAmram, Lars Kristiansen and Neil Jones 
Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time 
 Edwin Beggs and Annelies Gerber 
Algorithms for Analytic Functions and Applications to Toeplitz Operators 
 Mathias Barra 
Pure iteration and periodicity 
 George Metcalfe and Matthias Baaz 
Herbrand Theorems and Skolemization for Prenex Fuzzy Logics 
 Tiago Azevedo, Mario Benevides, Fabio Protti and Marcelo Sihman 
On detecting deadlock in the PiCalculus 
 Argimiro Arratia and Iain Stewart 
Program schemes with deep pushdown storage 
 Luis Antunes and André Souto 
Sophisticated Infinite Sequences 
 Bogdan Aman and Gabriel Ciobanu 
Decidability Results for Mobile Membranes derived from Mobile Ambients 
 Marco Almeida, Nelma Moreira and Rogério Reis 
On the performance of automata minimization algorithms 