Travelled to:1 × Japan
1 × Latvia
1 × Russia
1 × USA
1 × United Kingdom
Collaborated with:K.Etessami M.Yannakakis
Talks about:polynomi (5) probabilist (3) process (3) branch (3) time (3) algorithm (2) stochast (2) grammar (2) context (2) newton (2)
Person: Alistair Stewart
DBLP: Stewart:Alistair
Contributed to:
2015
201320132012
2012Wrote 5 papers:
- ICALP-v2-2015-EtessamiSY #branch #equation #fixpoint #markov #polynomial #probability #process #reachability
- Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes (KE, AS, MY), pp. 184–196.
- CAV-2013-StewartEY #automaton #bound #model checking #polynomial #probability
- Upper Bounds for Newton’s Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata (AS, KE, MY), pp. 495–510.
- ICALP-v2-2013-EtessamiSY #context-free grammar #probability #regular expression
- Stochastic Context-Free Grammars, Regular Languages, and Newton’s Method (KE, AS, MY), pp. 199–211.
- ICALP-v1-2012-EtessamiSY #algorithm #branch #equation #markov #polynomial #probability #process
- Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations (KE, AS, MY), pp. 314–326.
- STOC-2012-EtessamiSY #algorithm #branch #context-free grammar #multi #polynomial #probability #process
- Polynomial time algorithms for multi-type branching processes and stochastic context-free grammars (KE, AS, MY), pp. 579–588.