Full Text Documents Search Links IFIP website IFIP TC6 Open DL

Table of Contents Theoretical Computer Science Josep Diaz, Ivan Lanese, Davide Sangiorgi (Eds.) Front Matter Track A: Algorithms, Complexity and Models of Computation Zero-Suppressed Binary Decision Diagrams Resilient to Index Faults Anna Bernasconi, Valentina Ciriani 1-12 On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs Bugra Caskurlu, Vahan Mkrtchyan, Ojas Parekh, K. Subramani 13-26 Perfect Pipelining for Streaming Large File in Peer-to-Peer Networks Fei Chen, Xiaowei Wu 27-38 The Shortest Path Game: Complexity and Algorithms Andreas Darmann, Ulrich Pferschy, Joachim Schauer 39-53 Online Scheduling of Unit Length Jobs with Commitment and Penalties Stanley Fung 54-65 The Lazy Matroid Problem Laurent Gourvès, Jérôme Monnot, Aris Pagourtzis 66-77 Treewidth Computation and Kernelization in the Parallel External Memory Model Riko Jacob, Tobias Lieber, Matthias Mnich 78-89 Capturing Bisimulation-Invariant Complexity Classes with Higher-Order Modal Fixpoint Logic Martin Lange, Etienne Lozes 90-103 Sensitivity, Block Sensitivity, and Certificate Complexity of Unate Functions and Read-Once Functions Hiroki Morizumi 104-110 Subshifts, MSO Logic, and Collapsing Hierarchies Ilkka Törmä 111-122 Fast Nondeterministic Matrix Multiplication via Derandomization of Freivalds’ Algorithm Jiří Wiedermann 123-135 Not All Multi-Valued Partial CFL Functions Are Refined by Single-Valued Functions (Extended Abstract) Tomoyuki Yamakami 136-150 Track B: Logic, Semantics, Specification and Verification Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus Patrick Baillot, Erika Benedetti, Simona Ronchi Della Rocca 151-163 A Hoare-Like Calculus Using the SROIQσ Logic on Transformations of Graphs Jon Brenas, Rachid Echahed, Martin Strecker 164-178 Termination Analysis for Graph Transformation Systems H. Bruggink, Barbara König, Hans Zantema 179-194 Tropical Two-Way Automata Vincent Carnino, Sylvain Lombardy 195-206 Parametric LTL on Markov Chains Souymodip Chakraborty, Joost-Pieter Katoen 207-221 Specifying and Verifying Properties of Space Vincenzo Ciancia, Diego Latella, Michele Loreti, Mieke Massink 222-235 Primal Infon Logic with Conjunctions as Sets Carlos Cotrini, Yuri Gurevich, Ori Lahav, Artem Melentyev 236-249 From Display Calculi to Deep Nested Sequent Calculi: Formalised for Full Intuitionistic Linear Logic Jeremy Dawson, Ranald Clouston, Rajeev Goré, Alwen Tiu 250-264 Towards a Coalgebraic Chomsky Hierarchy Sergey Goncharov, Stefan Milius, Alexandra Silva 265-280 Strong Completeness for Iteration-Free Coalgebraic Dynamic Logics Helle Hansen, Clemens Kupke, Raul Leal 281-295 Quantitative Types for the Linear Substitution Calculus Delia Kesner, Daniel Ventura 296-310 Generic Partition Refinement Algorithms for Coalgebras and an Instantiation to Weighted Automata Barbara König, Sebastian Küpper 311-325 Looking at Separation Algebras with Boolean BI-eyes Dominique Larchey-Wendling and Didier Galmiche 326-340 The Inhabitation Problem for Non-idempotent Intersection Types Antonio Bucciarelli, Delia Kesner, Simona Ronchi Della Rocca 341-354

Designed by Inria-IES Team :     Hosted by HAL :