| Publication | Date of Publication | Type |
|---|
| Web apps and imprecise probabilitites | 2022-12-01 | Paper |
Modelling web-service uncertainty: the angel/daemon approach
Computer Science Review | 2021-12-20 | Paper |
| Measuring investment opportunities under uncertainty | 2020-02-20 | Paper |
The computational complexity of QoS measures for orchestrations. The computational complexity of QoS measures
Journal of Combinatorial Optimization | 2017-11-09 | Paper |
The pragmatic proof: hypermedia API composition and execution
Theory and Practice of Logic Programming | 2017-11-09 | Paper |
| An angel-daemon approach to assess the uncertainty in the power of a collectivity to act | 2017-09-05 | Paper |
Parallel dictionaries with local rules on AVL and brother trees
Information Processing Letters | 2016-06-09 | Paper |
The robustness of periodic orchestrations in uncertain evolving environments
Lecture Notes in Computer Science | 2015-11-10 | Paper |
Uncertainty in the cloud: an angel-daemon approach to modelling performance
Lecture Notes in Computer Science | 2015-11-10 | Paper |
Reasoning about orchestrations of web services using partial correctness
Formal Aspects of Computing | 2014-11-10 | Paper |
Computational models for networks of tiny artifacts: a survey
Computer Science Review | 2014-10-24 | Paper |
Book review of: Robin Sharp, Principles of protocol design
Computer Science Review | 2014-10-07 | Paper |
Computational aspects of uncertainty profiles and angel-daemon games
Theory of Computing Systems | 2014-03-25 | Paper |
On the hardness of game equivalence under local isomorphism
RAIRO - Theoretical Informatics and Applications | 2013-06-18 | Paper |
Equilibria problems on games: complexity versus succinctness
Journal of Computer and System Sciences | 2012-01-11 | Paper |
The complexity of game isomorphism
Theoretical Computer Science | 2011-12-07 | Paper |
Web services and \textit{incerta spiriti}: a game theoretic approach to uncertainty
Lecture Notes in Computer Science | 2011-06-29 | Paper |
On the Complexity of Game Isomorphism
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
On the Complexity of Equilibria Problems in Angel-Daemon Games
Lecture Notes in Computer Science | 2008-07-10 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Analytic urns
The Annals of Probability | 2005-06-23 | Paper |
Barrier synchronisation: Axiomatisation and relaxation
Formal Aspects of Computing | 2004-10-01 | Paper |
| scientific article; zbMATH DE number 2102052 (Why is no real title available?) | 2004-09-22 | Paper |
Fringe analysis of synchronized parallel insertion algorithms in 2--3 trees.
Theoretical Computer Science | 2003-05-25 | Paper |
| scientific article; zbMATH DE number 1863308 (Why is no real title available?) | 2003-02-04 | Paper |
| scientific article; zbMATH DE number 1760035 (Why is no real title available?) | 2002-11-06 | Paper |
AXIOMATIC FRAMEWORKS FOR DEVELOPING BSP-STYLE PROGRAMS∗
Parallel Algorithms and Applications | 2000-06-05 | Paper |
A design of a parallel dictionary using skip lists
Theoretical Computer Science | 1997-02-27 | Paper |
| scientific article; zbMATH DE number 810103 (Why is no real title available?) | 1996-02-13 | Paper |
| scientific article; zbMATH DE number 719756 (Why is no real title available?) | 1995-02-06 | Paper |
| scientific article; zbMATH DE number 192916 (Why is no real title available?) | 1993-06-05 | Paper |
Deciding bisimilarity is P-complete
Formal Aspects of Computing | 1993-02-04 | Paper |
| scientific article; zbMATH DE number 46423 (Why is no real title available?) | 1992-09-17 | Paper |
The parallel complexity of two problems on concurrency
Information Processing Letters | 1991-01-01 | Paper |
Iterated GSMs and CO-CFL
Acta Informatica | 1989-01-01 | Paper |
Nonuniform complexity classes specified by lower and upper bounds
RAIRO - Theoretical Informatics and Applications | 1989-01-01 | Paper |
Non recursive functions have transcendental generating series
RAIRO - Theoretical Informatics and Applications | 1989-01-01 | Paper |
Prefixes of infinite words and ambiguous context-free languages
Information Processing Letters | 1987-01-01 | Paper |
On characterizations of the class PSPACE/poly
Theoretical Computer Science | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3990861 (Why is no real title available?) | 1986-01-01 | Paper |
Uniform characterizations of non-uniform complexity measures
Information and Control | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3917710 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3862469 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3980490 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3829284 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3797185 (Why is no real title available?) | 1982-01-01 | Paper |
