- Suna Bensch, Markus Holzer, Martin Kutrib, Andreas Malcher:
Input-Driven Stack Automata. IFIP TCS 2012: 28-42 - Marijke H. L. Bodlaender:
Probabilistic Inference and Monadic Second Order Logic. IFIP TCS 2012: 43-56 - Marijke H. L. Bodlaender, Cor A. J. Hurkens, Vincent J. J. Kusters, Frank Staals, Gerhard J. Woeginger, Hans Zantema:
Cinderella versus the Wicked Stepmother. IFIP TCS 2012: 57-71 - Michele Boreale, Michela Paolini:
Worst- and Average-Case Privacy Breaches in Randomization Mechanisms. IFIP TCS 2012: 72-86 - Tomasz Brengos:
Weak Bisimulations for Coalgebras over Ordered Functors. IFIP TCS 2012: 87-103 - Arnaud Carayol, Zoltán Ésik:
A Context-Free Linear Ordering with an Undecidable First-Order Theory. IFIP TCS 2012: 104-118 - Federico Della Croce, Vangelis Th. Paschos:
Efficient Algorithms for the max k -vertex cover Problem. IFIP TCS 2012: 295-309 - Yuxin Deng, Yuan Feng:
Open Bisimulation for Quantum Processes. IFIP TCS 2012: 119-133 - Fabio Gadducci, Giacoma Valentina Monreale, Ugo Montanari:
A Modular LTS for Open Reactive Systems. IFIP TCS 2012: 134-148 - Petr Jancar, Prateek Karandikar, Philippe Schnoebelen:
Unidirectional Channel Systems Can Be Tested. IFIP TCS 2012: 149-163 - Galina Jirásková, Tomás Masopust:
On Properties and State Complexity of Deterministic State-Partition Automata. IFIP TCS 2012: 164-178 - Galina Jirásková, Benedek Nagy:
On Union-Free and Deterministic Union-Free Languages. IFIP TCS 2012: 179-192 - Philipp Küfner, Uwe Nestmann, Christina Rickmann:
Formal Verification of Distributed Algorithms - From Pseudo Code to Checked Proofs. IFIP TCS 2012: 209-224 - Alexander Kurz, Tomoyuki Suzuki, Emilio Tuosto:
A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions. IFIP TCS 2012: 193-208 - Hongyu Liang:
The Algorithmic Complexity of k-Domatic Partition of Graphs. IFIP TCS 2012: 240-249 - Gerald Lüttgen, Walter Vogler:
Modal Interface Automata. IFIP TCS 2012: 265-279 - Bas Luttik:
Unique Parallel Decomposition in Branching and Weak Bisimulation Semantics. IFIP TCS 2012: 250-264 - Colin Riba:
A Model Theoretic Proof of Completeness of an Axiomatization of Monadic Second-Order Logic on Infinite Words. IFIP TCS 2012: 310-324 - Falak Sher, Joost-Pieter Katoen:
Compositional Abstraction Techniques for Probabilistic Automata. IFIP TCS 2012: 325-341 - Lei Song, Jens Chr. Godskesen:
Broadcast Abstraction in a Stochastic Calculus for Mobile Networks. IFIP TCS 2012: 342-356 - Salvatore La Torre, Margherita Napoli:
A Temporal Logic for Multi-threaded Programs. IFIP TCS 2012: 225-239 - Takeshi Tsukada, Naoki Kobayashi:
An Intersection Type System for Deterministic Pushdown Automata. IFIP TCS 2012: 357-371 - Jirí Wiedermann:
Computability and Non-computability Issues in Amorphous Computing. IFIP TCS 2012: 1-9 - Jos C. M. Baeten, Thomas Ball, Frank S. de Boer:
Theoretical Computer Science - 7th IFIP TC 1/WG 2.2 International Conference, TCS 2012, Amsterdam, The Netherlands, September 26-28, 2012. Proceedings. Lecture Notes in Computer Science 7604, Springer 2012, ISBN 978-3-642-33474-0 [contents] - 2010
- Mário S. Alvim, Miguel E. Andrés, Catuscia Palamidessi:
Entropy and Attack Models in Information Flow - (Invited Talk). IFIP TCS 2010: 53-54 - Mário S. Alvim, Miguel E. Andrés, Catuscia Palamidessi, Peter van Rossum:
Safe Equivalences for Security Properties. IFIP TCS 2010: 55-70 - Beate Bollig:
On Symbolic Representations of Maximum Matchings and (Un)directed Graphs. IFIP TCS 2010: 286-300 - Michele Boreale, David Clark, Daniele Gorla:
A Semiring-Based Trace Semantics for Processes with Applications to Information Leakage Analysis. IFIP TCS 2010: 340-354 - Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Otte, Denis Trystram:
Approximating the Non-contiguous Multiple Organization Packing Problem. IFIP TCS 2010: 316-327 - Darko Brodic:
Optimization of the Anisotropic Gaussian Kernel for Text Segmentation and Parameter Extraction. IFIP TCS 2010: 140-152