| 2019 | ICALP | Reachability for Branching Concurrent Stochastic Games. | Kousha Etessami, Emanuel Martinov, Alistair Stewart, Mihalis Yannakakis |
| 2017 | LICS | Algorithms for some infinite-state MDPs and stochastic games. | Kousha Etessami |
| 2015 | ICALP | Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes. | Kousha Etessami, Alistair Stewart, Mihalis Yannakakis |
| 2014 | SAGT | The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form. | Kousha Etessami, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Srensen |
| 2013 | CAV | Upper Bounds for Newton's Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata. | Alistair Stewart, Kousha Etessami, Mihalis Yannakakis |
| 2013 | ICALP | Stochastic Context-Free Grammars, Regular Languages, and Newton's Method. | Kousha Etessami, Alistair Stewart, Mihalis Yannakakis |
| 2013 | LATA | Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems. | Kousha Etessami |
| 2013 | STACS | The complexity of analyzing infinite-state Markov chains, Markov decision processes, and stochastic games (Invited talk). | Kousha Etessami |
| 2012 | ICALP | Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations. | Kousha Etessami, Alistair Stewart, Mihalis Yannakakis |
| 2012 | STOC | Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars. | Kousha Etessami, Alistair Stewart, Mihalis Yannakakis |
| 2011 | ICALP | Approximating the Termination Value of One-Counter MDPs and Stochastic Games. | Toms Brzdil, Vclav Brozek, Kousha Etessami, Antonn Kucera |
| 2010 | SODA | One-Counter Markov Decision Processes. | Toms Brzdil, Vclav Brozek, Kousha Etessami, Antonn Kucera, Dominik Wojtczak |
| 2009 | VMCAI | An Abort-Aware Model of Transactional Programming. | Kousha Etessami, Patrice Godefroid |
| 2008 | ICALP | Recursive Stochastic Games with Positive Rewards. | Kousha Etessami, Dominik Wojtczak, Mihalis Yannakakis |
| 2007 | FOCS | On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract). | Kousha Etessami, Mihalis Yannakakis |
| 2007 | LICS | First-Order and Temporal Logics for Nested Words. | Rajeev Alur, Marcelo Arenas, Pablo Barcel, Kousha Etessami, Neil Immerman, Leonid Libkin |
| 2007 | TACAS | Multi-objective Model Checking of Markov Decision Processes. | Kousha Etessami, Marta Z. Kwiatkowska, Moshe Y. Vardi, Mihalis Yannakakis |
| 2007 | TACAS | PReMo : An Analyzer for P robabilistic Re cursive Mo dels. | Dominik Wojtczak, Kousha Etessami |
| 2006 | ICALP | Recursive Concurrent Stochastic Games. | Kousha Etessami, Mihalis Yannakakis |
| 2006 | STACS | Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games. | Kousha Etessami, Mihalis Yannakakis |
| 2005 | ICALP | Recursive Markov Decision Processes and Recursive Stochastic Games. | Kousha Etessami, Mihalis Yannakakis |
| 2005 | ISAAC | Probability and Recursion. | Kousha Etessami, Mihalis Yannakakis |
| 2005 | STACS | Recursive Markov Chains, Stochastic Grammars, and Monotone Systems of Nonlinear Equations. | Kousha Etessami, Mihalis Yannakakis |
| 2005 | TACAS | On-the-Fly Reachability and Cycle Detection for Recursive State Machines. | Rajeev Alur, Swarat Chaudhuri, Kousha Etessami, P. Madhusudan |
| 2005 | TACAS | Algorithmic Verification of Recursive Probabilistic State Machines. | Kousha Etessami, Mihalis Yannakakis |
| 2004 | TACAS | A Temporal Logic of Nested Calls and Returns. | Rajeev Alur, Kousha Etessami, P. Madhusudan |
| 2004 | VMCAI | Analysis of Recursive Game Graphs Using Data Flow Equations. | Kousha Etessami |
| 2003 | CONCUR | Compression of Partially Ordered Strings. | Rajeev Alur, Swarat Chaudhuri, Kousha Etessami, Sudipto Guha, Mihalis Yannakakis |
| 2002 | CONCUR | A Hierarchy of Polynomial-Time Computable Simulations for Automata. | Kousha Etessami |
| 2001 | CAV | Analysis of Recursive State Machines. | Rajeev Alur, Kousha Etessami, Mihalis Yannakakis |
| 2001 | ICALP | Realizability and Verification of MSC Graphs. | Rajeev Alur, Kousha Etessami, Mihalis Yannakakis |
| 2001 | ICALP | Fair Simulation Relations, Parity Games, and State Space Reduction for Bchi Automata. | Kousha Etessami, Thomas Wilke, Rebecca A. Schuller |
| 2001 | RE | Events and Constraints: A Graphical Editor for Capturing Logic Requirements of Programs. | Margaret H. Smith, Gerard J. Holzmann, Kousha Etessami |
| 2000 | CONCUR | Optimizing Bchi Automata. | Kousha Etessami, Gerard J. Holzmann |
| 2000 | FORTE | From Rule-based to Automata-based Testing. | Kousha Etessami, Mihalis Yannakakis |
| 2000 | ICSE | Inference of message sequence charts. | Rajeev Alur, Kousha Etessami, Mihalis Yannakakis |
| 1999 | CAV | Stutter-Invariant Languages, omega-Automata, and Temporal Logic. | Kousha Etessami |
| 1999 | ICALP | Parametric Temporal Logic for "Model Measuring". | Rajeev Alur, Kousha Etessami, Salvatore La Torre, Doron A. Peled |
| 1998 | PODS | Dynamic Tree Isomorphism via First-Order Updates. | Kousha Etessami |
| 1997 | LICS | First-Order Logic with Two Variables and Unary Temporal Logic. | Kousha Etessami, Moshe Y. Vardi, Thomas Wilke |
| 1996 | LICS | An Until Hierarchy for Temporal Logic. | Kousha Etessami, Thomas Wilke |
| 1995 | LICS | Tree Canonization and Transitive Closure | Kousha Etessami, Neil Immerman |
| 1994 | STACS | Reachability and the Power of Local Ordering. | Kousha Etessami, Neil Immerman |