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="Hunter, Paul"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Quantitative games with interval objectives
Paul Hunter
,
Jean-François Raskin
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 365-377
The DAG-width of directed graphs
Dietmar Berwanger
,
Anuj Dawar
,
Paul Hunter
,
Stephan Kreutzer
,
Jan Obdrz̑álek
Journal of Combinatorial Theory Series B
102
(4), 2012, pp. 900-923
Computing rational radical sums in uniform TC
^0
Paul Hunter
,
Patricia Bouyer
,
Nicolas Markey
,
Joël Ouaknine
,
James Worrell
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 308-316
Digraph measures: Kelly decompositions, games, and orderings
Paul Hunter
,
Stephan Kreutzer
Theoretical Computer Science
399
(3), 2008, pp. 206-219
DAG-width and parity games
Dietmar Berwanger
,
Anuj Dawar
,
Paul Hunter
,
Stephan Kreutzer
Lecture Notes in Computer Science
3884
, 2006, pp. 524-536
Complexity bounds for regular games
Paul Hunter
,
Anuj Dawar
Lecture Notes in Computer Science
3618
, 2005, pp. 495-506