Kousha Etessami

103 papers A* 20A 11B 7C 2Journal 50Unranked 12

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