Accepted Papers


Accepted Papers at TCS 2014, Track A

  • Fei Chen and Xiaowei Wu. Perfect Pipelining for Streaming Large File in Peer-to-peer Networks
  • Jiri Wiedermann. Fast nondeterministic matrix multiplication via derandomization of Freivald's algorithm
  • Anna Bernasconi and Valentina Ciriani. Zero-Suppressed Binary Decision Diagrams Resilient to Index Faults
  • Andreas Darmann, Ulrich Pferschy and Joachim Schauer. The Shortest Path Game: Complexity and Algorithms
  • Ilkka Törmä. Subshifts, MSO Logic, and Collapsing Hierarchies
  • Martin Lange and Etienne Lozes. Capturing Bisimulation Invariant Complexity Classes with Higher Order Modal Logics
  • Laurent Gourves, Jerome Monnot and Aris Pagourtzis. The Lazy Matroid Problem
  • Riko Jacob, Tobias Lieber and Matthias Mnich. Treewidth Computation and Kernelization in the Parallel External Memory Model
  • Bugra Caskurlu, Vahan Mkrtchyan, Ojas Parekh and K. Subramani. On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs and Trees
  • Hiroki Morizumi. Sensitivity, Block Sensitivity, and Certificate Complexity of Unate Functions and Read-Once Functions
  • Tomoyuki Yamakami. Not All Multi-Valued Partial CFL Functions Are Refined by Single-Valued Functions
  • Stanley Fung. Online Scheduling of Unit Length Jobs with Commitment and Penalties


Accepted Papers at TCS 2014, Track B

  • Souymodip Chakraborty and Joost-Pieter Katoen. Parametric LTL on Markov Chains
  • 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 FullIntuitionistic Linear Logic
  • Simona Ronchi Della Rocca, Antonio Bucciarelli and Delia Kesner. The inhabitation problem for non-idempotent intersection types
  • 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
  • Vincent Carnino and Sylvain Lombardy. Tropical two-way automata
  • H.J. Sander Bruggink, Barbara König and Hans Zantema. Termination Analysis for Graph Transformation Systems
  • Sebastian Küpper and Barbara König. Generic Partition Refinement Algorithms for Coalgebras and an Instantiation toWeighted Automata
  • Carlos Cotrini Jimenez, Yuri Gurevich, Ori Lahav and Artem Melentyev. Primal Infon Logic with Conjunctions as Sets
  • Patrick Baillot, Erika De Benedetti and Simona Ronchi Della Rocca. Characterizing polynomial and exponential complexity classes in elementarylambda-calculus
  • Jon Hael Brenas, Rachid Echahed and Martin Strecker. A Hoare-like calculus using SROIQ-sigma logic on transformations of graphs
  • Vincenzo Ciancia, Diego Latella, Michele Loreti and Mieke Massink. Specifying and Verifying Properties of Space
  • Helle Hvid Hansen, Clemens Kupke and Raul Leal. Strong completeness of iteration-free coalgebraic dynamic logics