Kousha Etessami

Rajeev Alur, Kousha Etessami, Mihalis Yannakakis, 2000, Proceedings of the 2000 International Conference on Software Engineering. ICSE 2000 the New Millennium.

Algorithmic Verification of Recursive Probabilistic State Machines

Kousha Etessami, Mihalis Yannakakis, M. Yannakakis, 2005, TACAS.

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '10)

Kousha Etessami, Dominik Wojtczak, Antonín Kučera, 2010 .

Analysis of Recursive State Machines

Rajeev Alur, Kousha Etessami, Mihalis Yannakakis, 2001, CAV.

Polynomial Time Algorithms for Multi-Type Branching Processes and Stochastic Context-Free Grammars pdf

Kousha Etessami, Mihalis Yannakakis, Alistair Stewart, 2012, ArXiv.

Recursive stochastic games with positive rewards

Kousha Etessami, Mihalis Yannakakis, Dominik Wojtczak, 2019, Theor. Comput. Sci..

A Hierarchy of Polynomial-Time Computable Simulations for Automata

Kousha Etessami, K. Etessami, 2002, CONCUR.

Computer aided verification : 17th International Conference, CAV 2005, Edinburgh, Scotland, UK, July 6-10, 2005 : proceedings

Kousha Etessami, Sriram K. Rajamani, 2005, CAV 2005.

Recursive Markov Chains, Stochastic Grammars, and Monotone Systems of Nonlinear Equations

Kousha Etessami, Mihalis Yannakakis, 2005, STACS.

Recursive Stochastic Games with Positive Rewards

Kousha Etessami, Mihalis Yannakakis, Dominik Wojtczak, 2008, ICALP.

PReMo : An Analyzer for P robabilistic Re cursive Mo dels

Kousha Etessami, Dominik Wojtczak, 2007, TACAS.

Events and constraints: a graphical editor for capturing logic requirements of programs

Kousha Etessami, Gerard J. Holzmann, Margaret H. Smith, 2001, Proceedings Fifth IEEE International Symposium on Requirements Engineering.

A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes

Kousha Etessami, Mihalis Yannakakis, Alistair Stewart, 2017, SIAM J. Comput..

First-order logic with two variables and unary temporal logic

Kousha Etessami, Thomas Wilke, Moshe Y. Vardi, 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

Approximating the termination value of one-counter MDPs and stochastic games

Kousha Etessami, Tomás Brázdil, Antonín Kucera, 2013, Inf. Comput..

Checking LTL properties of recursive Markov chains

Kousha Etessami, Mihalis Yannakakis, M. Yannakakis, 2005, Second International Conference on the Quantitative Evaluation of Systems (QEST'05).

Algorithms for some infinite-state MDPs and stochastic games

Kousha Etessami, 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

Invited Articles Foreword

Helmut Veith, Kousha Etessami, Alistair Stewart, 2015, J. ACM.

Reachability and the Power of Local Ordering

Neil Immerman, Kousha Etessami, 1995, Theor. Comput. Sci..

Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes

Kousha Etessami, Mihalis Yannakakis, Alistair Stewart, 2018, Inf. Comput..

Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems

Kousha Etessami, Mihalis Yannakakis, Dominik Wojtczak, 2008, QEST.

Model Checking of Recursive Probabilistic Systems

Kousha Etessami, Mihalis Yannakakis, M. Yannakakis, 2012, TOCL.

Reachability for Branching Concurrent Stochastic Games pdf

Kousha Etessami, Mihalis Yannakakis, Alistair Stewart, 2018, ICALP.

Reachability and the Power of Local Ordering

Neil Immerman, Kousha Etessami, N. Immerman, 1995, Theor. Comput. Sci..

Verifying Probabilistic Procedural Programs

Kousha Etessami, Javier Esparza, K. Etessami, 2004, FSTTCS.

Stochastic Context-Free Grammars, Regular Languages, and Newton's Method pdf

Kousha Etessami, Mihalis Yannakakis, Alistair Stewart, 2013, ICALP.

Tree Canonization and Transitive Closure

Neil Immerman, Kousha Etessami, 2000, Inf. Comput..

Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations

Kousha Etessami, Mihalis Yannakakis, M. Yannakakis, 2005, JACM.

On-the-Fly Reachability and Cycle Detection for Recursive State Machines

Swarat Chaudhuri, Rajeev Alur, Kousha Etessami, 2005, TACAS.

Counting quantifiers, successor relations, and logarithmic space

Kousha Etessami, K. Etessami, 1995, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference.

Compression of Partially Ordered Strings

Swarat Chaudhuri, Sudipto Guha, Rajeev Alur, 2003, CONCUR.

First-Order and Temporal Logics for Nested Words

Neil Immerman, Rajeev Alur, Kousha Etessami, 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

Stutter-Invariant Languages, omega-Automata, and Temporal Logic

Kousha Etessami, K. Etessami, 1999, CAV.

One-counter Markov decision processes

Kousha Etessami, Tomás Brázdil, Antonín Kucera, 2009, SODA '10.

Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes pdf

Kousha Etessami, Mihalis Yannakakis, Alistair Stewart, 2015, ICALP.

Parametric Temporal Logic for "Model Measuring"

Rajeev Alur, Kousha Etessami, Doron A. Peled, 1999, ICALP.

An Abort-Aware Model of Transactional Programming

Kousha Etessami, Patrice Godefroid, 2009, VMCAI.

Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems

Kousha Etessami, Mihalis Yannakakis, Dominik Wojtczak, 2008, 2008 Fifth International Conference on Quantitative Evaluation of Systems.

The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form pdf

Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Lund, 2014, SAGT.

Approximating the Termination Value of One-Counter MDPs and Stochastic Games pdf

Kousha Etessami, Tomás Brázdil, Antonín Kucera, 2011, ICALP.

First-Order Logic with Two Variables and Unary Temporal Logic

Kousha Etessami, Thomas Wilke, Moshe Y. Vardi, 2002, Inf. Comput..

Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems

Kousha Etessami, 2013, LATA.

Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations

Kousha Etessami, Mihalis Yannakakis, Alistair Stewart, 2020, Math. Oper. Res..

First-Order and Temporal Logics for Nested Words

Neil Immerman, Rajeev Alur, Kousha Etessami, 2007, LICS 2007.

An abort-aware model of transactional programming

Kousha Etessami, Patrice Godefroid, 2011, International Journal on Software Tools for Technology Transfer.

Counting Quantifiers, Successor Relations, and Logarithmic Space

Kousha Etessami, 1997, J. Comput. Syst. Sci..

The computational complexity of evolutionarily stable strategies

Kousha Etessami, Andreas Lochbihler, K. Etessami, 2008, Int. J. Game Theory.

On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)

Kousha Etessami, Mihalis Yannakakis, M. Yannakakis, 2010, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

Recursive Markov Decision Processes and Recursive Stochastic Games

Kousha Etessami, Mihalis Yannakakis, 2005, ICALP.

Upper Bounds for Newton’s Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata pdf

Kousha Etessami, Mihalis Yannakakis, Alistair Stewart, 2013, J. ACM.

An Until hierarchy for temporal logic

Kousha Etessami, Thomas Wilke, Thomas Wilke, 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

Probability and Recursion

Kousha Etessami, Mihalis Yannakakis, M. Yannakakis, 2005, ISAAC.

Recursive Concurrent Stochastic Games pdf

Kousha Etessami, Mihalis Yannakakis, 2008, Log. Methods Comput. Sci..

The complexity of computing a (quasi-)perfect equilibrium for an n-player extensive form game

Kousha Etessami, K. Etessami, 2021, Games Econ. Behav..

Analysis of probabilistic processes and automata theory

Kousha Etessami, K. Etessami, 2021, Handbook of Automata Theory.

First-Order Logic with Two Variables and Unary Temporal Logic

Kousha Etessami, Moshe Y. Vardi, Thomas Wilke, 1997 .

Computer Aided Verification

Kousha Etessami, K. Etessami, 2008 .

Realizability and Veriication of Msc Graphs

Kousha Etessami, Mihalis Yannakakis, GraphsRajeev Alur, 2001 .