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="Schewe, Sven"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Complexity of node coverage games
Farn Wang
,
Sven Schewe
,
Jung-Hsuan Wu
Theoretical Computer Science
576
, 2015, pp. 45-60
Determinising parity automata
Sven Schewe
,
Thomas Varghese
Lecture Notes in Computer Science
8634
, 2014, pp. 486-498
Tight bounds for complementing parity automata
Sven Schewe
,
Thomas Varghese
Lecture Notes in Computer Science
8634
, 2014, pp. 499-510
Distributed synthesis is simply undecidable
Sven Schewe
Information Processing Letters
114
(4), 2014, pp. 203-207
Combined model checking for temporal, probabilistic, and real-time logics
Savas Konur
,
Michael Fisher
,
Sven Schewe
Theoretical Computer Science
503
, 2013, pp. 61-88
Unlimited decidability of distributed synthesis with limited missing knowledge
Anca Muscholl
,
Sven Schewe
Lecture Notes in Computer Science
8087
, 2013, pp. 691-703
Optimal time-abstract schedulers for CTMDPs and continuous-time Markov games
Markus N. Rabe
,
Sven Schewe
Theoretical Computer Science
467
, 2013, pp. 53-67
Time and parallelizability results for parity games with bounded treewidth
John Fearnley
,
Sven Schewe
Lecture Notes in Computer Science
7392
, 2012, pp. 189-200
Efficient approximation of optimal control for continuous-time Markov games
John Fearnley
,
Markus Rabe
,
Sven Schewe
,
Lijun Zhang
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 399-410
Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games
Markus N. Rabe
,
Sven Schewe
Acta Informatica
48
(5-6), 2011, pp. 291-315
Beyond hyper-minimisation - Minimising DBAs and DPAs is
NP
-complete
Sven Schewe
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 400-411
From parity and payoff games to linear programming
Sven Schewe
Lecture Notes in Computer Science
5734
, 2009, pp. 675-686
Büchi complementation made tight
Sven Schewe
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 661-672
ATL* satisfiability is 2EXPTIME-complete
Sven Schewe
Lecture Notes in Computer Science
5126
, 2008, pp. 373-385
Semi-automatic distributed synthesis
Sven Schewe
,
Bernd Finkbeiner
International Journal of Foundations of Computer Science
18
(1), 2007, pp. 113-138
Solving parity games in big steps
Sven Schewe
Lecture Notes in Computer Science
4855
, 2007, pp. 449-460