Speaker

Title

Grazyna Zwozniak 
Induced matchings in graphs of maximum degree three 
Keita Yokoyama 
Reverse Mathematics for Fourier Expansion 
Joost Winter 
Space Complexity in Ordinal Turing Machines 
Michael Weiss and Gregory Lafitte 
Simulations Between Tilings 
Petros Wallden 
Anhomomorphic Logic: The Logic of Quantum Realism 
Daniel Ventura, Mauricio AyalaRincon and Fairouz Kamareddine 
Principal Typings for Explicit Substitutions Calculi 
Anastasia Veneti 
A Sequent Calculus for Intersection and Union Logic 
Alina Vasilieva 
Quantum Query Algorithms for AND and OR Boolean Functions 
Trifon Trifonov 
Exploring the computational contribution of a nonconstructive combinatorial principle 
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 
Ivan N. Soskov 
The almost zero omegaenumeration degrees 
Michael Soltys and Craig Wilson 
On the complexity of computing winning strategies for finite poset games 
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 
Sasha Rubin 
Quantifiers on automatic structures 
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 (talk cancelled) 
Petrus H. Potgieter 
Computable counterexamples to the Brouwer fixedpoint theorem 
Sergei Podzorov 
Upper Semilattices in ManyOne Degrees 
Katerina Petrova 
Almost partial mreducibility 
Florian Pelupessy 
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 
Miriam Nasfi 
Clockable Ordinals for Infinite Time Register Machines 
Marcin Mostowski 
Limiting recursion, FMrepressentability, and hypercomputations (talk cancelled) 
Yiannis Moschovakis 
The axiomatic derivation of absolute lower bounds 
Anthony Morphett 
Some Results on Local LRdegree Structures 
Russell Miller 
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 
Bruno Loff 
Monotonicity conditions over characterisations of PSPACE 
Iris Loeb 
Factoring out Intuitionistic Theorems: Continuity Principles and the Uniform Continuity Theorem 
Jiang Liu 
Joining to High Degrees 
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 
Graham Leigh 
A Classification of Axiomatic Theories of Truth 
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 
On Extending Wand's Type Reconstruction Algorithm to Handle Polymorphic Let 
Margarita Korovina and Nicolai Vorobjov 
Safety Properties Verification for Pfaffian Dynamics (talk cancelled) 
Nurlan Kogabaev 
The Computable Dimension of Free Projective Planes 
Petter Kristian Køber 
Inductive Definitions over Domain Representable Spaces 
Peter Koepke and Russell Miller 
An Enhanced Theory of Infinite Time Register Machines 
Seoktae Kim 
TwoDimensional Cellular Automata Transforms for a Novel Edge Detection 
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 (talk cancelled) 
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 (talk cancelled) 
Maurice Jansen 
Lower Bounds 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 
Gabriel Istrate 
qOverlaps in the Random Exact Cover Problem 
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 
Stefan Hetzl 
Proof Fragments and CutElimination 
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 (talk cancelled) 
Christian Glaßer 
The Shrinking Property for NP and coNP 
Stefan Gerdjikov 
Deterministic subsequential transducers with additional FIFOmemory 
Alexander Gavryushkin 
Computable Models Spectras of Ehrenfeucht Theories 
Hristo Ganchev 
Embedding the enumeration degrees in the omegaenumeration degrees 
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 (talk cancelled) 
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}$ 
Helger Lipmaa 
Succinct NP Proofs from an Extractability Assumption (talk cancelled) 
Michiel De Smet 
Phase transitions for weakly increasing sequences 
Gregorio de Miguel Casado, Juan Manuel GarcíaChamizo and Higinio Mora Mora 
Onlinedivision with Periodic Rational Numbers 
Barbara Csima, Bakhadyr Khoussainov and Jiamou Liu 
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 
Chris J. Conidis 
Comparing Notions of Fractal Dimension 
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 
Merlin Carl 
The Lost Melody Theorem for Infinite Time Register Machines 
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 
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 
Matthias Baaz and George Metcalfe 
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 
Program schemes with deep pushdown storage 
Luis Antunes and André Souto 
Sophisticated Infinite Sequences 
Timos Antonopoulos 
Expressive Power Of Graph Logic 
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 
Ruben Agadzanyan 
Query algorithms for detecting Hamming and ReedSolomon codes 
Bahareh Afshari 
Subsystems of Iterated Inductive Definitions 