|
71 |
On the Complexity of Computing Maximum Entropy for Markovian Models
Chen, Taolue. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2014
|
|
|
|
72 |
The Complexity of Counting Models of Linear-time Temporal Logic
Torfah, Hazem. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2014
|
|
|
|
73 |
Models from scenarios
Lorenz, Robert. - Augsburg : Universität Augsburg, 2013
|
|
|
|
74 |
Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models
Danos, Vincent. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2012
|
|
|
|
75 |
On the equational consistency of order-theoretic models of the lambda-calculus
Carraro, Alberto. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2012
|
|
|
|
76 |
Democratic Theory and Citizen Participation: democracy models in the evaluation of public participation in science and technology
Biegelbauer, Peter. - Mannheim, 2011
|
|
|
|
77 |
Filter Models: Non-idempotent Intersection Types, Orthogonality and Polymorphism
Bernadet, Alexis. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2011
|
|
|
|
78 |
How to prove security of communication protocols? A discussion on the soundness of formal models w.r.t. computational ones.
Comon-Lundh, Hubert. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2011
|
|
|
|
79 |
Evolving Multialgebras Unify All Usual Sequential Computation Models
Grigorieff, Serge. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2010
|
|
|
|
80 |
Named Models in Coalgebraic Hybrid Logic
Schröder, Lutz. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2010
|
|
Administration
