default search action
Theoretical Computer Science, Volume 655
Volume 655, Part A, December 2016
- Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, Dimitrios M. Thilikos:
Forewords: Special issue on Theory and Applications of Graph Searching Problems. 1
- Anthony Bonato, Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat:
A probabilistic version of the game of Zombies and Survivors on graphs. 2-14 - Klaus-Tycho Foerster, Roger Wattenhofer:
Lower and upper competitive bounds for online directed graph exploration. 15-29 - Florian Lehner:
Pursuit evasion on infinite graphs. 30-40 - Fabrizio Luccio, Linda Pagli:
More agents may decrease global work: A case in butterfly decontamination. 41-57 - Bernd Puchala, Roman Rabinovich:
Jumping robbers in digraphs. 58-77 - Saeed Akhoondian Amiri, Stephan Kreutzer, Roman Rabinovich:
DAG-width is PSPACE-complete. 78-89
Volume 655, Part B, December 2016
- Nathalie Bertrand, Luca Bortolussi, Herbert Wiklicky:
Editorial: Quantitative Aspects of Programming Languages and Systems. 91
- Ivan Gazeau, Dale Miller, Catuscia Palamidessi:
Preserving differential privacy under finite-precision semantics. 92-108 - Slawomir Lasota, Marcin Poturalski:
Undecidability of performance equivalence of Petri nets. 109-119 - Annabelle McIver, Tahiry M. Rabehaja, Georg Struth:
Probabilistic rely-guarantee calculus. 120-134 - Marino Miculan, Marco Peressotti:
Structural operational semantics for non-deterministic processes with quantitative aspects. 135-154 - Viktor Schuppan:
Enhancing unsatisfiable cores for LTL with information on temporal relevance. 155-192 - Mark Timmer, Joost-Pieter Katoen, Jaco van de Pol, Mariëlle Stoelinga:
Confluence reduction for Markov automata. 193-219
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.