default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID8th IFIP TCS 2014: Rome, Italy
- Josep Díaz, Ivan Lanese, Davide Sangiorgi:
Theoretical Computer Science - 8th IFIP TC 1/WG 2.2 International Conference, TCS 2014, Rome, Italy, September 1-3, 2014. Proceedings. Lecture Notes in Computer Science 8705, Springer 2014, ISBN 978-3-662-44601-0
Track A: Algorithms, Complexity and Models of Computation
- Anna Bernasconi
, Valentina Ciriani:
Zero-Suppressed Binary Decision Diagrams Resilient to Index Faults. 1-12 - Bugra Çaskurlu, Vahan Mkrtchyan, Ojas Parekh, K. Subramani:
On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs. 13-26 - Fei Chen, Xiaowei Wu:
Perfect Pipelining for Streaming Large File in Peer-to-Peer Networks. 27-38 - Andreas Darmann, Ulrich Pferschy, Joachim Schauer:
The Shortest Path Game: Complexity and Algorithms. 39-53 - Stanley P. Y. Fung:
Online Scheduling of Unit Length Jobs with Commitment and Penalties. 54-65 - Laurent Gourvès, Jérôme Monnot, Aris Pagourtzis:
The Lazy Matroid Problem. 66-77 - Riko Jacob, Tobias Lieber, Matthias Mnich:
Treewidth Computation and Kernelization in the Parallel External Memory Model. 78-89 - Martin Lange, Étienne Lozes:
Capturing Bisimulation-Invariant Complexity Classes with Higher-Order Modal Fixpoint Logic. 90-103 - Hiroki Morizumi:
Sensitivity, Block Sensitivity, and Certificate Complexity of Unate Functions and Read-Once Functions. 104-110 - Ilkka Törmä:
Subshifts, MSO Logic, and Collapsing Hierarchies. 111-122 - Jirí Wiedermann:
Fast Nondeterministic Matrix Multiplication via Derandomization of Freivalds' Algorithm. 123-135 - Tomoyuki Yamakami:
Not All Multi-Valued Partial CFL Functions Are Refined by Single-Valued Functions (Extended Abstract). 136-150
Track B: Logic, Semantics, Specification and Verification
- Patrick Baillot, Erika De Benedetti, Simona Ronchi Della Rocca:
Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus. 151-163 - Jon Haël Brenas, Rachid Echahed, Martin Strecker:
A Hoare-Like Calculus Using the SROIQ σ Logic on Transformations of Graphs. 164-178 - H. J. Sander Bruggink, Barbara König, Hans Zantema:
Termination Analysis for Graph Transformation Systems. 179-194 - Vincent Carnino, Sylvain Lombardy:
Tropical Two-Way Automata. 195-206 - Souymodip Chakraborty, Joost-Pieter Katoen:
Parametric LTL on Markov Chains. 207-221 - Vincenzo Ciancia, Diego Latella, Michele Loreti, Mieke Massink:
Specifying and Verifying Properties of Space. 222-235 - Carlos Cotrini, Yuri Gurevich, Ori Lahav, Artem Melentyev:
Primal Infon Logic with Conjunctions as Sets. 236-249 - Jeremy E. Dawson, Ranald Clouston, Rajeev Goré, Alwen Tiu:
From Display Calculi to Deep Nested Sequent Calculi: Formalised for Full Intuitionistic Linear Logic. 250-264 - Sergey Goncharov, Stefan Milius, Alexandra Silva:
Towards a Coalgebraic Chomsky Hierarchy - (Extended Abstract). 265-280 - Helle Hvid Hansen, Clemens Kupke, Raul Andres Leal:
Strong Completeness for Iteration-Free Coalgebraic Dynamic Logics. 281-295 - Delia Kesner, Daniel Ventura:
Quantitative Types for the Linear Substitution Calculus. 296-310 - Barbara König, Sebastian Küpper:
Generic Partition Refinement Algorithms for Coalgebras and an Instantiation to Weighted Automata. 311-325 - Dominique Larchey-Wendling, Didier Galmiche:
Looking at Separation Algebras with Boolean BI-eyes. 326-340 - Antonio Bucciarelli, Delia Kesner, Simona Ronchi Della Rocca:
The Inhabitation Problem for Non-idempotent Intersection Types. 341-354
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-04-23 22:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
