BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Latvia
1 × USA
1 × United Kingdom
2 × France
Collaborated with:
∅ S.Schewe R.Savani M.Jurdzinski N.Bertrand
Talks about:
bound (3) pariti (2) time (2) game (2) paralleliz (1) treewidth (1) exponenti (1) strategi (1) reachabl (1) parallel (1)

Person: John Fearnley

DBLP DBLP: Fearnley:John

Contributed to:

STOC 20152015
ICALP (2) 20132013
CSL 20122012
ICALP (2) 20122012
ICALP (2) 20102010
CAV (2) 20172017

Wrote 6 papers:

STOC-2015-FearnleyS #complexity
The Complexity of the Simplex Method (JF, RS), pp. 201–208.
ICALP-v2-2013-FearnleyJ #automaton #reachability
Reachability in Two-Clock Timed Automata Is PSPACE-Complete (JF, MJ), pp. 212–223.
CSL-2012-BertrandFS #bound #satisfiability
Bounded Satisfiability for PCTL (NB, JF, SS), pp. 92–106.
ICALP-v2-2012-FearnleyS #bound #game studies
Time and Parallelizability Results for Parity Games with Bounded Treewidth (JF, SS), pp. 189–200.
ICALP-v2-2010-Fearnley #bound #exponential #policy
Exponential Lower Bounds for Policy Iteration (JF), pp. 551–562.
CAV-2017-Fearnley #game studies #parallel #performance
Efficient Parallel Strategy Improvement for Parity Games (JF), pp. 137–154.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.