Kousha Etessami
Orcid: 0000-0001-5700-3462Affiliations:
- University of Edinburgh, UK
According to our database1,
Kousha Etessami
authored at least 65 papers
between 1995 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2022
2021
The complexity of computing a (quasi-)perfect equilibrium for an <i>n</i>-player extensive form game.
Games Econ. Behav., 2021
Proceedings of the Handbook of Automata Theory., 2021
2020
Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations.
Math. Oper. Res., 2020
Proceedings of the Reachability Problems - 14th International Conference, 2020
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020
2019
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019
2018
Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes.
Inf. Comput., 2018
2017
A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes.
SIAM J. Comput., 2017
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017
2015
Upper Bounds for Newton's Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata.
J. ACM, 2015
2014
The complexity of computing a (perfect) equilibrium for an n-player extensive form game of perfect recall.
CoRR, 2014
The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form.
Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014
2013
Inf. Comput., 2013
A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing.
Electron. Colloquium Comput. Complex., 2013
The complexity of analyzing infinite-state Markov chains, Markov decision processes, and stochastic games (Invited talk).
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013
Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems.
Proceedings of the Language and Automata Theory and Applications, 2013
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013
2012
Special Section on the Forty-Third Annual ACM Symposium on Theory of Computing (STOC 2011).
SIAM J. Comput., 2012
Polynomial Time Algorithms for Multi-Type Branching Processes and Stochastic Context-Free Grammars
CoRR, 2012
Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012
2011
Int. J. Softw. Tools Technol. Transf., 2011
2010
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems.
Perform. Evaluation, 2010
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010
2009
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations.
J. ACM, 2009
2008
Log. Methods Comput. Sci., 2008
Int. J. Game Theory, 2008
2007
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2007
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007
2006
Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games.
Proceedings of the STACS 2006, 2006
2005
Fair Simulation Relations, Parity Games, and State Space Reduction for Bu"chi Automata.
SIAM J. Comput., 2005
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2005
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2005
Proceedings of the Second International Conference on the Quantitative Evaluaiton of Systems (QEST 2005), 2005
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005
2004
Proceedings of the Verification, 2004
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2004
Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004
2003
2002
Proceedings of the CONCUR 2002, 2002
2001
Events and Constraints: A Graphical Editor for Capturing Logic Requirements of Programs.
Proceedings of the 5th IEEE International Symposium on Requirements Engineering (RE 2001), 2001
Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001
Proceedings of the Computer Aided Verification, 13th International Conference, 2001
2000
Inf. Process. Lett., 2000
An Until Hierarchy and Other Applications of an Ehrenfeucht-Fraïssé Game for Temporal Logic.
Inf. Comput., 2000
From Rule-based to Automata-based Testing.
Proceedings of the Formal Techniques for Distributed System Development, 2000
1999
Proceedings of the Computer Aided Verification, 11th International Conference, 1999
1998
Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1998
1997
J. Comput. Syst. Sci., 1997
1996
1995