Follow
Matthijs Melissen
Matthijs Melissen
PhD student, University of Luxembourg
Verified email at matthijsmelissen.nl - Homepage
Title
Cited by
Cited by
Year
Attack–defense trees and two-player binary zero-sum extensive form games are equivalent
B Kordy, S Mauw, M Melissen, P Schweitzer
Decision and Game Theory for Security: First International Conference …, 2010
722010
Fairness in non-repudiation protocols
W Jamroga, S Mauw, M Melissen
Security and Trust Management: 7th International Workshop, STM 2011 …, 2012
212012
Doubtful deviations and farsighted play
W Jamroga, M Melissen
Portuguese Conference on Artificial Intelligence, 506-520, 2011
142011
The generative capacity of the Lambek–Grishin calculus: A new lower bound
M Melissen
Formal Grammar: 14th International Conference, FG 2009, Bordeaux, France …, 2011
132011
Game theory and logic for non-repudiation protocols and attack analysis
M Melissen
Universitè du Luxembourg, 2013
52013
Defendable Security in Interaction Protocols
W Jamroga, M Melissen, H Schnoor
PRIMA 2013: Principles and Practice of Multi-Agent Systems: 16th …, 2013
2*2013
Attack--Defense Trees and Two-Player Binary Zero-Sum Extensive Form Games Are Equivalent-Technical Report with Proofs
B Kordy, S Mauw, M Melissen, P Schweitzer
arXiv preprint arXiv:1006.2732, 2010
12010
Lambek–grishin calculus extended to connectives of arbitrary arity
M Melissen
12009
Are insight problems really different from noninsight problems?
M Melissen
arXiv preprint arXiv:1205.0528, 2012
2012
A group-theoretical view of type IV Grishin principles
M Melissen
2007
Towards an axiomatized logic of Social Welfare
M Melissen
2007
The system can't perform the operation now. Try again later.
Articles 1–11