Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID7th IFIP TCS 2012: Amsterdam, The Netherlands
- 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 - Jirí Wiedermann
:
Computability and Non-computability Issues in Amorphous Computing. 1-9 - Davide Ancona, Giovanni Lagorio:
Static Single Information Form for Abstract Compilation. 10-27 - Suna Bensch, Markus Holzer, Martin Kutrib, Andreas Malcher:
Input-Driven Stack Automata. 28-42 - Marijke H. L. Bodlaender:
Probabilistic Inference and Monadic Second Order Logic. 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. 57-71 - Michele Boreale, Michela Paolini:
Worst- and Average-Case Privacy Breaches in Randomization Mechanisms. 72-86 - Tomasz Brengos:
Weak Bisimulations for Coalgebras over Ordered Functors. 87-103 - Arnaud Carayol, Zoltán Ésik:
A Context-Free Linear Ordering with an Undecidable First-Order Theory. 104-118 - Yuxin Deng, Yuan Feng:
Open Bisimulation for Quantum Processes. 119-133 - Fabio Gadducci, Giacoma Valentina Monreale, Ugo Montanari:
A Modular LTS for Open Reactive Systems. 134-148 - Petr Jancar, Prateek Karandikar, Philippe Schnoebelen:
Unidirectional Channel Systems Can Be Tested. 149-163 - Galina Jirásková, Tomás Masopust:
On Properties and State Complexity of Deterministic State-Partition Automata. 164-178 - Galina Jirásková, Benedek Nagy:
On Union-Free and Deterministic Union-Free Languages. 179-192 - Alexander Kurz, Tomoyuki Suzuki, Emilio Tuosto:
A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions. 193-208 - Philipp Küfner, Uwe Nestmann, Christina Rickmann:
Formal Verification of Distributed Algorithms - From Pseudo Code to Checked Proofs. 209-224 - Salvatore La Torre, Margherita Napoli:
A Temporal Logic for Multi-threaded Programs. 225-239 - Hongyu Liang:
The Algorithmic Complexity of k-Domatic Partition of Graphs. 240-249 - Bas Luttik:
Unique Parallel Decomposition in Branching and Weak Bisimulation Semantics. 250-264 - Gerald Lüttgen, Walter Vogler:
Modal Interface Automata. 265-279 - Emmanuel Beffara, Virgile Mogbil:
Proofs as Executions. 280-294 - Federico Della Croce, Vangelis Th. Paschos:
Efficient Algorithms for the max k -vertex cover Problem. 295-309 - Colin Riba:
A Model Theoretic Proof of Completeness of an Axiomatization of Monadic Second-Order Logic on Infinite Words. 310-324 - Falak Sher, Joost-Pieter Katoen:
Compositional Abstraction Techniques for Probabilistic Automata. 325-341 - Lei Song, Jens Chr. Godskesen:
Broadcast Abstraction in a Stochastic Calculus for Mobile Networks. 342-356 - Takeshi Tsukada, Naoki Kobayashi:
An Intersection Type System for Deterministic Pushdown Automata. 357-371 - Steffen van Bakel, Maria Grazia Vigliotti:
An Output-Based Semantics of Λμ with Explicit Substitution in the π-Calculus - Extended Abstract. 372-387
a service of 
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 2024-04-25 05:26 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:
