Abstract is missing.
- Zero-Suppressed Binary Decision Diagrams Resilient to Index FaultsAnna Bernasconi, Valentina Ciriani. 1-12 [doi]
- On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite GraphsBugra Caskurlu, Vahan Mkrtchyan, Ojas Parekh, K. Subramani. 13-26 [doi]
- Perfect Pipelining for Streaming Large File in Peer-to-Peer NetworksFei Chen, Xiaowei Wu. 27-38 [doi]
- The Shortest Path Game: Complexity and AlgorithmsAndreas Darmann, Ulrich Pferschy, Joachim Schauer. 39-53 [doi]
- Online Scheduling of Unit Length Jobs with Commitment and PenaltiesStanley P. Y. Fung. 54-65 [doi]
- The Lazy Matroid ProblemLaurent Gourvès, Jérôme Monnot, Aris Pagourtzis. 66-77 [doi]
- Treewidth Computation and Kernelization in the Parallel External Memory ModelRiko Jacob, Tobias Lieber, Matthias Mnich. 78-89 [doi]
- Capturing Bisimulation-Invariant Complexity Classes with Higher-Order Modal Fixpoint LogicMartin Lange, Étienne Lozes. 90-103 [doi]
- Sensitivity, Block Sensitivity, and Certificate Complexity of Unate Functions and Read-Once FunctionsHiroki Morizumi. 104-110 [doi]
- Subshifts, MSO Logic, and Collapsing HierarchiesIlkka Törmä. 111-122 [doi]
- Fast Nondeterministic Matrix Multiplication via Derandomization of Freivalds' AlgorithmJirí Wiedermann. 123-135 [doi]
- Not All Multi-Valued Partial CFL Functions Are Refined by Single-Valued Functions (Extended Abstract)Tomoyuki Yamakami. 136-150 [doi]
- Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-CalculusPatrick Baillot, Erika De Benedetti, Simona Ronchi Della Rocca. 151-163 [doi]
- A Hoare-Like Calculus Using the SROIQ σ Logic on Transformations of GraphsJon Haël Brenas, Rachid Echahed, Martin Strecker. 164-178 [doi]
- Termination Analysis for Graph Transformation SystemsHarrie Jan Sander Bruggink, Barbara König, Hans Zantema. 179-194 [doi]
- Tropical Two-Way AutomataVincent Carnino, Sylvain Lombardy. 195-206 [doi]
- Parametric LTL on Markov ChainsSouymodip Chakraborty, Joost-Pieter Katoen. 207-221 [doi]
- Specifying and Verifying Properties of SpaceVincenzo Ciancia, Diego Latella, Michele Loreti, Mieke Massink. 222-235 [doi]
- Primal Infon Logic with Conjunctions as SetsCarlos Cotrini, Yuri Gurevich, Ori Lahav, Artem Melentyev. 236-249 [doi]
- From Display Calculi to Deep Nested Sequent Calculi: Formalised for Full Intuitionistic Linear LogicJeremy E. Dawson, Ranald Clouston, Rajeev Goré, Alwen Tiu. 250-264 [doi]
- Towards a Coalgebraic Chomsky Hierarchy - (Extended Abstract)Sergey Goncharov, Stefan Milius, Alexandra Silva 0001. 265-280 [doi]
- Strong Completeness for Iteration-Free Coalgebraic Dynamic LogicsHelle Hvid Hansen, Clemens Kupke, Raul Andres Leal. 281-295 [doi]
- Quantitative Types for the Linear Substitution CalculusDelia Kesner, Daniel Ventura. 296-310 [doi]
- Generic Partition Refinement Algorithms for Coalgebras and an Instantiation to Weighted AutomataBarbara König, Sebastian Küpper. 311-325 [doi]
- Looking at Separation Algebras with Boolean BI-eyesDominique Larchey-Wendling, Didier Galmiche. 326-340 [doi]
- The Inhabitation Problem for Non-idempotent Intersection TypesAntonio Bucciarelli, Delia Kesner, Simona Ronchi Della Rocca. 341-354 [doi]