Accepted Papers

(alphabetically ordered by author names)

1) Eric Allender and Ian Mertz. Complexity of Regular Functions
2) Kazuyuki Amano and Atsushi Saito. A nonuniform circuit class with multilayer of threshold gates having super quasi polynomial size lower bounds against NEXP
3) Marcella Anselmo, Dora Giammarresi and Maria Madonia. Structure and measure of a decidable class of two-dimensional codes
4) Parvaneh Babari and Manfred Droste. A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logics
5) Georg Bachmeier, Michael Luttenberger and Maximilian Schlund. Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity
6) Golnaz Badkobeh, Gabriele Fici and Zsuzsanna Liptak. On the Number of Closed Factors in a Word
7) Raphael Bailly, Guillaume Rabusseau and François Denis. Recognizable Series on Hypergraphs
8) Carl Barton, Costas Iliopoulos and Solon Pissis. Average-Case Optimal Approximate Circular String Matching
9) Ala Eddine Ben Salem. Single-pass Testing Automata for LTL Model Checking
10) Olaf Beyersdorff, Leroy Chew and Karteek Sreenivasaiah. A game characterisation of tree-like Q-Resolution size
11) Philip Bille, Inge Li Gørtz and Søren Vind. Compressed Data Structures for Range Searching
12) Stefano Bilotta, Elisa Pergola, Renzo Pinzani and Simone Rinaldi. Recurrence relations, succession rules and the positivity problem
13) Johanna Björklund, Frank Drewes and Niklas Zechner. An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring
14) Yohan Boichut, Pierre Rety and Jacques Chabin. Towards more Precise Rewriting Approximations
15) Adrien Boiret, Vincent Hugot, Joachim Niehren and Ralf Treinen. Logics for Unordered Trees with Data Constraints
16) Davide Bresolin, Dario Della Monica, Angelo Montanari, Pietro Sala and Guido Sciavicco. On the Complexity of Fragments of the Modal Logic of Allen's Relations over Dense Structures
17) Olivier Carton and Luc Boasson. Rational selecting relations and selectors
18) Bastien Cazaux, Thierry Lecroq and Eric Rivals. Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree
19) Dajung Cho, Yo-Sub Han and Hwee Kim. Frequent Pattern Mining with Non-overlapping Inversions
20) Michael Codish, Luís Cruz-Filipe and Peter Schneider-Kamp. Sorting Networks: the End Game
21) Conrad Cotton-Barratt, Andrzej Murawski and Luke Ong. Weak and Nested Class Memory Automata
22) Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive and Heribert Vollmer. Parameterized Enumeration for Modification Problems
23) Konrad Kazimierz Dabrowski, Shenwei Huang and Daniel Paulusma. Bounding Clique-Width via Perfect Graphs
24) H. K. Dai and Z. Wang. A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random Walk
25) Alberto Dennunzio, Enrico Formenti, Luca Manzoni and Antonio E. Porreca. Preimage Problems for Reaction Systems
26) Joey Eremondi, Oscar H. Ibarra and Ian McQuillan. Insertion Operations on Deterministic Reversal-Bounded Counter Machines
27) Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre and Elise Prieur-Gaston. Online Computation of Abelian Runs
28) Guilhem Gamard and Gwenaël Richomme. Coverability in two dimensions
29) Thibault Godin, Ines Klimann and Matthieu Picantin. On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata
30) François Gonze and Raphaël M. Jungers. On the Synchronizing Probability Function and the Triple Rendezvous Time: New Approaches to Cerny's Conjecture
31) Jana Hadravova and Štěpán Holub. Equation $x^iy^jx^k=u^iv^ju^k$ in words
32) Vesa Halava, Reino Niskanen and Igor Potapov. On Robot Games of Degree Two
33) Maciej Koutny, Jetty Kleijn, Ryszard Janicki and Lukasz Mikulski. Order Structures for Subclasses of Generalised Traces
34) Shankara Narayanan Krishna, Lakshmi Manasa and Ashutosh Trivedi. Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable
35) Peter Leupold and Norbert Hundeshagen. A Hierarchy of Transducing Observer Systems
36) Rui Li and Yiguang Hong. On observability of automata networks via computational algebra
37) L-M Lopez and Ph Narbel. Coding Non-Orientable Laminations
38) Martin Lück, Arne Meier and Irena Schindler. Parameterized Complexity of CTL: A Generalization of Courcelle's Theorem
39) Lukasz Mikulski, Marcin Piątkowski and Wojciech Rytter. Square-free words over partially commutative alphabets
40) Ananda Chandra Nayak and Kalpesh Kapoor. On the Language of Primitive Partial Words
41) Antoine Ndione, Aurélien Lemay and Joachim Niehren. Sublinear DTD Validity
42) Pavel Panteleev. Preset Distinguishing Sequences and Diameter of Transformation Semigroups
43) Nicolas Peltier. Reasoning on Schemas of Formulas: An Automata-Based Approach
44) Hernan Ponce-De-Leon and Andrey Mokhov. Building Bridges Between Sets of Partial Orders
45) Nicola Prezza, Alberto Policriti and Nicola Gigante. Average linear time and compressed space construction of the Burrows-Wheeler transform
46) Martin Sulzmann and Peter Thiemann. Derivatives for Regular Shuffle Expressions
47) Peter Thiemann and Martin Sulzmann. From Omega-Regular Expressions to Büchi Automata via Partial Derivatives
48) Jan Trávníček, Jan Janousek, Borivoj Melichar and Loek Cleophas. Backward Linearised Tree Pattern Matching
49) Vladimir Ulyantsev, Ilya Zakirzyanov and Anatoly Shalyto. BFS-based Symmetry Breaking Predicates for DFA Identification
50) Guillaume Verdier and Jean-Baptiste Raclet. Quotient of Acceptance Specifications under Reachability Constraints
51) Vojtěch Vorel and and Adam Roman. Complexity of Road Coloring with Prescribed Reset Words
52) Ryo Yoshinaka. Learning Conjunctive Grammars and Contextual Binary Feature Grammars
53) Charalampos Zinoviadis. Hierarchy and expansiveness in 2D subshifs of finite type

General Statistics

Acceptance rate0.47
External reviewers110
External reviews121


reviews for a papernumber of papers