Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Demri, St{\'{e}}phane"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The covering and boundedness problems for branching vector addition systems
Stéphane Demri
,
Marcin Jurdziński
,
Oded Lachish
,
Ranko Lazić
Leibniz International Proceedings in Informatics (LIPIcs)
4
, 2009, pp. 181-192
Verification of qualitative
\mathbb{Z}
constraints
Stéphane Demri
,
Régis Gascon
Theoretical Computer Science
409
(1), 2008, pp. 24-40
Reasoning about transfinite sequences
Stéphane Demri
,
David Nowak
International Journal of Foundations of Computer Science
18
(1), 2007, pp. 87-112
The complexity of propositional linear temporal logics in simple cases
Stéphane Demri
,
Philippe Schnoebelen
Information and Computation
174
(1), 2002, pp. 84-103
A class of decidable information logics
Stéphane Demri
Theoretical Computer Science
195
(1), 1998, pp. 33-60
Logical analysis of demonic nondeterministic programs
Stéphane Demri
,
Ewa Orƚowska
Theoretical Computer Science
166
(1-2), 1996, pp. 173-202
A class of information logics with a decidable validity problem
Stéphane Demri
Lecture Notes in Computer Science
1113
, 1996, pp. 291-302
3-SAT=SAT for a class of normal modal logics
Stéphane Demri
Information Processing Letters
54
, 1995, pp. 281-287