Conference Programme (Download )

Invited Talk (Chair: Josep Diaz)

Giuseppe Italiano: Strong Bridges and Strong Articulation Points of Directed Graphs

AUTOMATA AND ALGEBRAS (TCS-B) (Chair: TBA)

• Sergey Goncharov, Stefan Milius and Alexandra Silva. Towards a Coalgebraic Chomsky Hierarchy
• Dominique Larchey-Wendling and Didier Galmiche. Looking at Separation Algebras with Boolean BI-eyes
• Helle Hvid Hansen, Clemens Kupke and Raul Leal. Strong completeness of iteration-free coalgebraic dynamic logics
• Sebastian Küpper and Barbara König. Generic Partition Refinement Algorithms for Coalgebras and an Instantiation to Weighted Automata

(TCS-A) (Chair: Pino Italiano)

• Jiri Wiedermann. Fast nondeterministic matrix multiplication via derandomization of Freivald's algorithm
• Andreas Darmann, Ulrich Pferschy and Joachim Schauer. The Shortest Path Game. Complexity and Algorithms
• Laurent Gourves, Jerome Monnot and Aris Pagourtzis. The Lazy Matroid Problem
• Stanley Fung. Online Scheduling of Unit Length Jobs with Commitment and Penalties

ANALYSIS TECHNIQUES (TCS-B) (Chair: TBA)

• Souymodip Chakraborty and Joost-Pieter Katoen. Parametric LTL on Markov Chains
• H.J. Sander Bruggink, Barbara König and Hans Zantema. Termination Analysis for Graph Transformation Systems
• Vincenzo Ciancia, Diego Latella, Michele Loreti and Mieke Massink. Specifying and Verifying Properties of Space
• Jon Hael Brenas, Rachid Echahed and Martin Strecker. A Hoare-like calculus using SROIQ-sigma logic on transformations of graphs

Invited Talk - joint with CONCUR (Chair: D. Sangiorgi) (Aula del Chiostro)

Jane Hillston. The Benefits of Sometimes Not Being Discrete

(TCS-A) (Chair: Jacques Sakarovich)

• Tomoyuki Yamakami. Not All Multi-Valued Partial CFL Functions Are Refined by Single-Valued Functions
• Anna Bernasconi and Valentina Ciriani. Zero-Suppressed Binary Decision Diagrams Resilient to Index
• Ilkka Törmä. Subshifts, MSO Logic, and Collapsing Hierarchies
• Hiroki Morizumi. Sensitivity, Block Sensitivity, and Certificate Complexity of Unate Functions and Read-Once Functions

• Simona Ronchi Della Rocca, Antonio Bucciarelli and Delia Kesner. The inhabitation problem for non-idempotent intersection types
• Delia Kesner and Daniel Ventura. Quantitative Types for the Linear Substitution Calculus
• Jeremy E. Dawson, Ranald Clouston, Rajeev Gore and Alwen Tiu. From Display Calculi to Deep Nested Sequent Calculi: Formalised for Full Intuitionistic Linear Logic
• Patrick Baillot, Erika De Benedetti and Simona Ronchi Della Rocca. Characterizing polynomial and exponential complexity classes in elementary lambda-calculus

(TCS-A) (Chair: Giorgio Ausiello)

• Bugra Caskurlu, Vahan Mkrtchyan, Ojas Parekh and K. Subramani. On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs
• Martin Lange and Etienne Lozes. Capturing Bisimulation Invariant Complexity Classes with Higher Order Modal Logics
• Riko Jacob, Tobias Lieber and Matthias Mnich. Treewidth Computation and Kernelization in the Parallel External Memory Model
• Fei Chen and Xiaowei Wu. Perfect Pipelining for Streaming Large File in Peer-to-peer Net

DECIDABILITY (TCS-B) (Chair: TBA)

• Carlos Cotrini Jimenez, Yuri Gurevich, Ori Lahav and Artem Melentyev. Primal Infon Logic with Conjunctions as Sets
• Vincent Carnino and Sylvain Lombardy. Tropical two-way automata

SESSION ON TC1 WORKING GROUPS

• WG 1.2 Descriptional Complexity, Speaker:  Giovanni Pighizzini, WG 1.2 Chair

• WG 1.5 Cellular Automata, Speaker: Jarkko Kari, WG 1.5 Chair

• WG 1.8 Concurrency Theory, Speakers:  Ilaria Castellani, WG 1.8 Chair, and Marco Bernardo. Title: Recent Trends in Concurrency Theory: Report from a WG 1.8 co-sponsored Event in Bertinoro