Kousha Etessami

ORCID

Publication Activity (10 Years)

Years Active: 1994-2022
Publications (10 Years): 13

Top Venues

Publications

Albert Atserias, Christoph Berkholz, Kousha Etessami, Joanna Ochremiak
Finite and Algorithmic Model Theory (Dagstuhl Seminar 22051). Dagstuhl Reports 12 (1) (2022)
Kousha Etessami
-player extensive form game. Games Econ. Behav. 125 (2021)
Kousha Etessami, Christos H. Papadimitriou, Aviad Rubinstein, Mihalis Yannakakis
Tarski's Theorem, Supermodular Games, and the Complexity of Equilibria. ITCS (2020)
Kousha Etessami, Emanuel Martinov
Qualitative Multi-objective Reachability for Ordered Branching MDPs. RP (2020)
Kousha Etessami, Emanuel Martinov
Qualitative Multi-Objective Reachability for Ordered Branching MDPs. CoRR (2020)
Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations. Math. Oper. Res. 45 (1) (2020)
Kousha Etessami, Emanuel Martinov, Alistair Stewart, Mihalis Yannakakis
Reachability for Branching Concurrent Stochastic Games. ICALP (2019)
Kousha Etessami, Dominik Wojtczak, Mihalis Yannakakis
Recursive stochastic games with positive rewards. Theor. Comput. Sci. 777 (2019)
Kousha Etessami, Christos H. Papadimitriou, Aviad Rubinstein, Mihalis Yannakakis
Tarski's Theorem, Supermodular Games, and the Complexity of Equilibria. CoRR (2019)
Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes. Inf. Comput. 261 (2018)
Kousha Etessami, Emanuel Martinov, Alistair Stewart, Mihalis Yannakakis
Reachability for Branching Concurrent Stochastic Games. CoRR (2018)
Kousha Etessami
Algorithms for some infinite-state MDPs and stochastic games. LICS (2017)
Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes. SIAM J. Comput. 46 (5) (2017)
Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes. CoRR (2015)
Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes. ICALP (2) (2015)
Kousha Etessami, Mihalis Yannakakis
Recursive Markov Decision Processes and Recursive Stochastic Games. J. ACM 62 (2) (2015)
Alistair Stewart, Kousha Etessami, Mihalis Yannakakis
Upper Bounds for Newton's Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata. J. ACM 62 (4) (2015)
Kousha Etessami, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
The complexity of approximating a trembling hand perfect equilibrium of a multi-player game in strategic form. CoRR (2014)
Kousha Etessami, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form. SAGT (2014)
Kousha Etessami
The complexity of computing a (perfect) equilibrium for an n-player extensive form game of perfect recall. CoRR (2014)
Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
A Note on the Complexity of Comparing Succinctly Represented Integers, with an Application to Maximum Probability Parsing. ACM Trans. Comput. Theory 6 (2) (2014)
Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
Stochastic Context-Free Grammars, Regular Languages, and Newton's Method. ICALP (2) (2013)
Alistair Stewart, Kousha Etessami, Mihalis Yannakakis
Upper Bounds for Newton's Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata. CAV (2013)
Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
Stochastic Context-Free Grammars, Regular Languages, and Newton's Method CoRR (2013)
Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing CoRR (2013)
Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera
Approximating the termination value of one-counter MDPs and stochastic games. Inf. Comput. 222 (2013)
Kousha Etessami
The complexity of analyzing infinite-state Markov chains, Markov decision processes, and stochastic games (Invited talk). STACS (2013)
Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing. Electron. Colloquium Comput. Complex. 20 (2013)
Kousha Etessami
Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems. LATA (2013)
Alistair Stewart, Kousha Etessami, Mihalis Yannakakis
Upper bounds for Newton's method on monotone polynomial systems, and P-time model checking of probabilistic one-counter automata CoRR (2013)
Kousha Etessami, Mihalis Yannakakis
Model Checking of Recursive Probabilistic Systems. ACM Trans. Comput. Log. 13 (2) (2012)
Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
Polynomial Time Algorithms for Multi-Type Branching Processes and Stochastic Context-Free Grammars CoRR (2012)
Kousha Etessami, Dieter van Melkebeek, Seth Pettie, John Watrous, Salil P. Vadhan
Special Section on the Forty-Third Annual ACM Symposium on Theory of Computing (STOC 2011). SIAM J. Comput. 41 (5) (2012)
Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars. STOC (2012)
Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations. ICALP (1) (2012)
Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations CoRR (2012)
Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera
Approximating the Termination Value of One-Counter MDPs and Stochastic Games. ICALP (2) (2011)
Kousha Etessami, Patrice Godefroid
An abort-aware model of transactional programming. Int. J. Softw. Tools Technol. Transf. 13 (6) (2011)
Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera
Approximating the Termination Value of One-Counter MDPs and Stochastic Games CoRR (2011)
Tomás Brázdil, Václav Brozek, Kousha Etessami
One-Counter Stochastic Games CoRR (2010)
Tomás Brázdil, Václav Brozek, Kousha Etessami
One-Counter Stochastic Games. FSTTCS (2010)
Kousha Etessami, Mihalis Yannakakis
On the Complexity of Nash Equilibria and Other Fixed Points. SIAM J. Comput. 39 (6) (2010)
Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera, Dominik Wojtczak
One-Counter Markov Decision Processes. SODA (2010)
Kousha Etessami, Dominik Wojtczak, Mihalis Yannakakis
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems. Perform. Evaluation 67 (9) (2010)
Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera, Dominik Wojtczak
One-Counter Markov Decision Processes CoRR (2009)
Kousha Etessami, Mihalis Yannakakis
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations. J. ACM 56 (1) (2009)
Kousha Etessami, Patrice Godefroid
An Abort-Aware Model of Transactional Programming. VMCAI (2009)
Kousha Etessami, Marta Z. Kwiatkowska, Moshe Y. Vardi, Mihalis Yannakakis
Multi-Objective Model Checking of Markov Decision Processes CoRR (2008)
Kousha Etessami, Mihalis Yannakakis
Recursive Concurrent Stochastic Games. Log. Methods Comput. Sci. 4 (4) (2008)
Kousha Etessami, Mihalis Yannakakis
Recursive Concurrent Stochastic Games CoRR (2008)
Kousha Etessami, Andreas Lochbihler
The computational complexity of evolutionarily stable strategies. Int. J. Game Theory 37 (1) (2008)
Kousha Etessami, Marta Z. Kwiatkowska, Moshe Y. Vardi, Mihalis Yannakakis
Multi-Objective Model Checking of Markov Decision Processes. Log. Methods Comput. Sci. 4 (4) (2008)
Rajeev Alur, Marcelo Arenas, Pablo Barceló, Kousha Etessami, Neil Immerman, Leonid Libkin
First-Order and Temporal Logics for Nested Words CoRR (2008)
Kousha Etessami, Dominik Wojtczak, Mihalis Yannakakis
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems. QEST (2008)
Rajeev Alur, Marcelo Arenas, Pablo Barceló, Kousha Etessami, Neil Immerman, Leonid Libkin
First-Order and Temporal Logics for Nested Words. Log. Methods Comput. Sci. 4 (4) (2008)
Kousha Etessami, Dominik Wojtczak, Mihalis Yannakakis
Recursive Stochastic Games with Positive Rewards. ICALP (1) (2008)
Kousha Etessami, Marta Z. Kwiatkowska, Moshe Y. Vardi, Mihalis Yannakakis
Multi-objective Model Checking of Markov Decision Processes. TACAS (2007)
Kousha Etessami, Mihalis Yannakakis
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract). FOCS (2007)
Dominik Wojtczak, Kousha Etessami
PReMo : An Analyzer for P robabilistic Re cursive Mo dels. TACAS (2007)
Rajeev Alur, Marcelo Arenas, Pablo Barceló, Kousha Etessami, Neil Immerman, Leonid Libkin
First-Order and Temporal Logics for Nested Words. LICS (2007)
Kousha Etessami, Mihalis Yannakakis
Recursive Concurrent Stochastic Games. ICALP (2) (2006)
Kousha Etessami, Mihalis Yannakakis
Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games. STACS (2006)
Kousha Etessami, Mihalis Yannakakis
Recursive Markov Decision Processes and Recursive Stochastic Games. ICALP (2005)
Rajeev Alur, Swarat Chaudhuri, Kousha Etessami, P. Madhusudan
On-the-Fly Reachability and Cycle Detection for Recursive State Machines. TACAS (2005)
Kousha Etessami, Mihalis Yannakakis
Probability and Recursion. ISAAC (2005)
Mihalis Yannakakis, Kousha Etessami
Checking LTL Properties of Recursive Markov Chains. QEST (2005)
Kousha Etessami, Thomas Wilke, Rebecca A. Schuller
Fair Simulation Relations, Parity Games, and State Space Reduction for Bu"chi Automata. SIAM J. Comput. 34 (5) (2005)
Rajeev Alur, Michael Benedikt, Kousha Etessami, Patrice Godefroid, Thomas W. Reps, Mihalis Yannakakis
Analysis of recursive state machines. ACM Trans. Program. Lang. Syst. 27 (4) (2005)
Rajeev Alur, Kousha Etessami, Mihalis Yannakakis
Realizability and verification of MSC graphs. Theor. Comput. Sci. 331 (1) (2005)
Kousha Etessami, Mihalis Yannakakis
Algorithmic Verification of Recursive Probabilistic State Machines. TACAS (2005)
Kousha Etessami, Mihalis Yannakakis
Recursive Markov Chains, Stochastic Grammars, and Monotone Systems of Nonlinear Equations. STACS (2005)
Kousha Etessami, Andreas Lochbihler
The computational complexity of Evolutionarily Stable Strategies Electron. Colloquium Comput. Complex. (055) (2004)
Kousha Etessami
Analysis of Recursive Game Graphs Using Data Flow Equations. VMCAI (2004)
Rajeev Alur, Kousha Etessami, P. Madhusudan
A Temporal Logic of Nested Calls and Returns. TACAS (2004)
Javier Esparza, Kousha Etessami
Verifying Probabilistic Procedural Programs. FSTTCS (2004)
Rajeev Alur, Kousha Etessami, Mihalis Yannakakis
Inference of Message Sequence Charts. IEEE Trans. Software Eng. 29 (7) (2003)
Rajeev Alur, Swarat Chaudhuri, Kousha Etessami, Sudipto Guha, Mihalis Yannakakis
Compression of Partially Ordered Strings. CONCUR (2003)
Kousha Etessami
A Hierarchy of Polynomial-Time Computable Simulations for Automata. CONCUR (2002)
Kousha Etessami, Moshe Y. Vardi, Thomas Wilke
First-Order Logic with Two Variables and Unary Temporal Logic. Inf. Comput. 179 (2) (2002)
Margaret H. Smith, Gerard J. Holzmann, Kousha Etessami
Events and Constraints: A Graphical Editor for Capturing Logic Requirements of Programs. RE (2001)
Rajeev Alur, Kousha Etessami, Mihalis Yannakakis
Realizability and Verification of MSC Graphs. ICALP (2001)
Rajeev Alur, Kousha Etessami, Mihalis Yannakakis
Analysis of Recursive State Machines. CAV (2001)
Kousha Etessami, Thomas Wilke, Rebecca A. Schuller
Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata. ICALP (2001)
Rajeev Alur, Kousha Etessami, Salvatore La Torre, Doron A. Peled
Parametric temporal logic for "model measuring". ACM Trans. Comput. Log. 2 (3) (2001)
Kousha Etessami
A note on a question of Peled and Wilke regarding stutter-invariant LTL. Inf. Process. Lett. 75 (6) (2000)
Kousha Etessami, Thomas Wilke
An Until Hierarchy and Other Applications of an Ehrenfeucht-Fraïssé Game for Temporal Logic. Inf. Comput. 160 (1-2) (2000)
Kousha Etessami, Neil Immerman
Tree Canonization and Transitive Closure. Inf. Comput. 157 (1-2) (2000)
Rajeev Alur, Kousha Etessami, Mihalis Yannakakis
Inference of message sequence charts. ICSE (2000)
Kousha Etessami, Mihalis Yannakakis
From Rule-based to Automata-based Testing. FORTE (2000)
Kousha Etessami, Gerard J. Holzmann
Optimizing Büchi Automata. CONCUR (2000)
Kousha Etessami
Stutter-Invariant Languages, omega-Automata, and Temporal Logic. CAV (1999)
Rajeev Alur, Kousha Etessami, Salvatore La Torre, Doron A. Peled
Parametric Temporal Logic for "Model Measuring". ICALP (1999)
Kousha Etessami
Dynamic Tree Isomorphism via First-Order Updates. PODS (1998)
Kousha Etessami, Moshe Y. Vardi, Thomas Wilke
First-Order Logic with Two Variables and Unary Temporal Logic. LICS (1997)
Kousha Etessami
Counting Quantifiers, Successor Relations, and Logarithmic Space. J. Comput. Syst. Sci. 54 (3) (1997)
Kousha Etessami, Thomas Wilke
An Until Hierarchy for Temporal Logic. LICS (1996)
Kousha Etessami, Neil Immerman
Reachability and the Power of Local Ordering. Theor. Comput. Sci. 148 (2) (1995)
Kousha Etessami, Neil Immerman
Tree Canonization and Transitive Closure LICS (1995)
Kousha Etessami
Counting Quantifiers, Successor Relations, and Logarithmic Space. Computational Complexity Conference (1995)
Kousha Etessami, Neil Immerman
Reachability and the Power of Local Ordering. STACS (1994)

Kousha Etessami.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Kousha Etessami