default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKousha Etessami
Person information
- affiliation: University of Edinburgh, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[e2]Kousha Etessami, Uriel Feige, Gabriele Puppis
:
50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, July 10-14, 2023, Paderborn, Germany. LIPIcs 261, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-278-5 [contents]- 2022
- [i20]Albert Atserias, Christoph Berkholz, Kousha Etessami, Joanna Ochremiak:
Finite and Algorithmic Model Theory (Dagstuhl Seminar 22051). Dagstuhl Reports 12(1): 101-118 (2022) - 2021
- [j30]Kousha Etessami:
The complexity of computing a (quasi-)perfect equilibrium for an n-player extensive form game. Games Econ. Behav. 125: 107-140 (2021) - [p1]Kousha Etessami:
Analysis of probabilistic processes and automata theory. Handbook of Automata Theory (II.) 2021: 1343-1382 - 2020
- [j29]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): 34-62 (2020) - [c50]Kousha Etessami, Christos H. Papadimitriou, Aviad Rubinstein, Mihalis Yannakakis:
Tarski's Theorem, Supermodular Games, and the Complexity of Equilibria. ITCS 2020: 18:1-18:19 - [c49]Kousha Etessami, Emanuel Martinov:
Qualitative Multi-objective Reachability for Ordered Branching MDPs. RP 2020: 67-82 - [i19]Kousha Etessami, Emanuel Martinov:
Qualitative Multi-Objective Reachability for Ordered Branching MDPs. CoRR abs/2008.10591 (2020)
2010 – 2019
- 2019
- [j28]Kousha Etessami, Dominik Wojtczak, Mihalis Yannakakis:
Recursive stochastic games with positive rewards. Theor. Comput. Sci. 777: 308-328 (2019) - [c48]Kousha Etessami, Emanuel Martinov, Alistair Stewart, Mihalis Yannakakis:
Reachability for Branching Concurrent Stochastic Games. ICALP 2019: 115:1-115:14 - [i18]Kousha Etessami, Christos H. Papadimitriou, Aviad Rubinstein, Mihalis Yannakakis:
Tarski's Theorem, Supermodular Games, and the Complexity of Equilibria. CoRR abs/1909.03210 (2019) - 2018
- [j27]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: 355-382 (2018) - [i17]Kousha Etessami, Emanuel Martinov, Alistair Stewart, Mihalis Yannakakis:
Reachability for Branching Concurrent Stochastic Games. CoRR abs/1806.03907 (2018) - 2017
- [j26]Kousha Etessami, Alistair Stewart, Mihalis Yannakakis:
A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes. SIAM J. Comput. 46(5): 1515-1553 (2017) - [c47]Kousha Etessami:
Algorithms for some infinite-state MDPs and stochastic games. LICS 2017: 1 - 2015
- [j25]Kousha Etessami, Mihalis Yannakakis:
Recursive Markov Decision Processes and Recursive Stochastic Games. J. ACM 62(2): 11:1-11:69 (2015) - [j24]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): 30:1-30:33 (2015) - [c46]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: 184-196 - [i16]Kousha Etessami, Alistair Stewart, Mihalis Yannakakis:
Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes. CoRR abs/1502.05533 (2015) - 2014
- [j23]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): 9:1-9:23 (2014) - [c45]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: 231-243 - [i15]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 abs/1408.1017 (2014) - [i14]Kousha Etessami:
The complexity of computing a (perfect) equilibrium for an n-player extensive form game of perfect recall. CoRR abs/1408.1233 (2014) - 2013
- [j22]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: 121-138 (2013) - [c44]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: 495-510 - [c43]Kousha Etessami, Alistair Stewart, Mihalis Yannakakis:
Stochastic Context-Free Grammars, Regular Languages, and Newton's Method. ICALP (2) 2013: 199-211 - [c42]Kousha Etessami:
Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems. LATA 2013: 12 - [c41]Kousha Etessami:
The complexity of analyzing infinite-state Markov chains, Markov decision processes, and stochastic games (Invited talk). STACS 2013: 1-2 - [i13]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 abs/1302.3741 (2013) - [i12]Kousha Etessami, Alistair Stewart, Mihalis Yannakakis:
Stochastic Context-Free Grammars, Regular Languages, and Newton's Method. CoRR abs/1302.6411 (2013) - [i11]Kousha Etessami, Alistair Stewart, Mihalis Yannakakis:
A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing. CoRR abs/1304.5429 (2013) - [i10]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. TR13 (2013) - 2012
- [j21]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): 1233-1234 (2012) - [j20]Kousha Etessami, Mihalis Yannakakis:
Model Checking of Recursive Probabilistic Systems. ACM Trans. Comput. Log. 13(2): 12:1-12:40 (2012) - [c40]Kousha Etessami, Alistair Stewart, Mihalis Yannakakis:
Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations. ICALP (1) 2012: 314-326 - [c39]Kousha Etessami, Alistair Stewart, Mihalis Yannakakis:
Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars. STOC 2012: 579-588 - [i9]Kousha Etessami, Alistair Stewart, Mihalis Yannakakis:
Polynomial Time Algorithms for Multi-Type Branching Processes and Stochastic Context-Free Grammars. CoRR abs/1201.2374 (2012) - [i8]Kousha Etessami, Alistair Stewart, Mihalis Yannakakis:
Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations. CoRR abs/1202.4798 (2012) - 2011
- [j19]Kousha Etessami, Patrice Godefroid:
An abort-aware model of transactional programming. Int. J. Softw. Tools Technol. Transf. 13(6): 537-551 (2011) - [c38]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: 332-343 - [i7]Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera:
Approximating the Termination Value of One-Counter MDPs and Stochastic Games. CoRR abs/1104.4978 (2011) - 2010
- [j18]Kousha Etessami, Dominik Wojtczak, Mihalis Yannakakis:
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems. Perform. Evaluation 67(9): 837-857 (2010) - [j17]Kousha Etessami, Mihalis Yannakakis:
On the Complexity of Nash Equilibria and Other Fixed Points. SIAM J. Comput. 39(6): 2531-2597 (2010) - [c37]Tomás Brázdil, Václav Brozek, Kousha Etessami:
One-Counter Stochastic Games. FSTTCS 2010: 108-119 - [c36]Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera, Dominik Wojtczak:
One-Counter Markov Decision Processes. SODA 2010: 863-874 - [i6]Tomás Brázdil, Václav Brozek, Kousha Etessami:
One-Counter Stochastic Games. CoRR abs/1009.5636 (2010)
2000 – 2009
- 2009
- [j16]Kousha Etessami, Mihalis Yannakakis:
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations. J. ACM 56(1): 1:1-1:66 (2009) - [c35]Kousha Etessami, Patrice Godefroid:
An Abort-Aware Model of Transactional Programming. VMCAI 2009: 59-73 - [i5]Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera, Dominik Wojtczak:
One-Counter Markov Decision Processes. CoRR abs/0904.2511 (2009) - 2008
- [j15]Kousha Etessami, Andreas Lochbihler:
The computational complexity of evolutionarily stable strategies. Int. J. Game Theory 37(1): 93-113 (2008) - [j14]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) - [j13]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) - [j12]Kousha Etessami, Mihalis Yannakakis:
Recursive Concurrent Stochastic Games. Log. Methods Comput. Sci. 4(4) (2008) - [c34]Kousha Etessami, Dominik Wojtczak, Mihalis Yannakakis:
Recursive Stochastic Games with Positive Rewards. ICALP (1) 2008: 711-723 - [c33]Kousha Etessami, Dominik Wojtczak, Mihalis Yannakakis:
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems. QEST 2008: 243-253 - [i4]Kousha Etessami, Mihalis Yannakakis:
Recursive Concurrent Stochastic Games. CoRR abs/0810.3581 (2008) - [i3]Kousha Etessami, Marta Z. Kwiatkowska, Moshe Y. Vardi, Mihalis Yannakakis:
Multi-Objective Model Checking of Markov Decision Processes. CoRR abs/0810.5728 (2008) - [i2]Rajeev Alur, Marcelo Arenas, Pablo Barceló, Kousha Etessami, Neil Immerman, Leonid Libkin:
First-Order and Temporal Logics for Nested Words. CoRR abs/0811.0537 (2008) - 2007
- [c32]Kousha Etessami, Mihalis Yannakakis:
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract). FOCS 2007: 113-123 - [c31]Rajeev Alur, Marcelo Arenas, Pablo Barceló, Kousha Etessami, Neil Immerman, Leonid Libkin:
First-Order and Temporal Logics for Nested Words. LICS 2007: 151-160 - [c30]Kousha Etessami, Marta Z. Kwiatkowska, Moshe Y. Vardi, Mihalis Yannakakis:
Multi-objective Model Checking of Markov Decision Processes. TACAS 2007: 50-65 - [c29]Dominik Wojtczak, Kousha Etessami:
PReMo : An Analyzer for P robabilistic Re cursive Mo dels. TACAS 2007: 66-71 - 2006
- [c28]Kousha Etessami, Mihalis Yannakakis:
Recursive Concurrent Stochastic Games. ICALP (2) 2006: 324-335 - [c27]Kousha Etessami, Mihalis Yannakakis:
Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games. STACS 2006: 634-645 - 2005
- [j11]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): 1159-1175 (2005) - [j10]Rajeev Alur, Kousha Etessami, Mihalis Yannakakis:
Realizability and verification of MSC graphs. Theor. Comput. Sci. 331(1): 97-114 (2005) - [j9]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): 786-818 (2005) - [c26]Kousha Etessami, Mihalis Yannakakis:
Recursive Markov Decision Processes and Recursive Stochastic Games. ICALP 2005: 891-903 - [c25]Kousha Etessami, Mihalis Yannakakis:
Probability and Recursion. ISAAC 2005: 2-4 - [c24]Mihalis Yannakakis, Kousha Etessami:
Checking LTL Properties of Recursive Markov Chains. QEST 2005: 155-165 - [c23]Kousha Etessami, Mihalis Yannakakis:
Recursive Markov Chains, Stochastic Grammars, and Monotone Systems of Nonlinear Equations. STACS 2005: 340-352 - [c22]Rajeev Alur, Swarat Chaudhuri, Kousha Etessami, P. Madhusudan:
On-the-Fly Reachability and Cycle Detection for Recursive State Machines. TACAS 2005: 61-76 - [c21]Kousha Etessami, Mihalis Yannakakis:
Algorithmic Verification of Recursive Probabilistic State Machines. TACAS 2005: 253-270 - [e1]Kousha Etessami, Sriram K. Rajamani:
Computer Aided Verification, 17th International Conference, CAV 2005, Edinburgh, Scotland, UK, July 6-10, 2005, Proceedings. Lecture Notes in Computer Science 3576, Springer 2005, ISBN 3-540-27231-3 [contents] - 2004
- [c20]Javier Esparza, Kousha Etessami:
Verifying Probabilistic Procedural Programs. FSTTCS 2004: 16-31 - [c19]Rajeev Alur, Kousha Etessami, P. Madhusudan:
A Temporal Logic of Nested Calls and Returns. TACAS 2004: 467-481 - [c18]Kousha Etessami:
Analysis of Recursive Game Graphs Using Data Flow Equations. VMCAI 2004: 282-296 - [i1]Kousha Etessami, Andreas Lochbihler:
The computational complexity of Evolutionarily Stable Strategies. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j8]Rajeev Alur, Kousha Etessami, Mihalis Yannakakis:
Inference of Message Sequence Charts. IEEE Trans. Software Eng. 29(7): 623-633 (2003) - [c17]Rajeev Alur, Swarat Chaudhuri, Kousha Etessami, Sudipto Guha, Mihalis Yannakakis:
Compression of Partially Ordered Strings. CONCUR 2003: 42-56 - 2002
- [j7]Kousha Etessami, Moshe Y. Vardi, Thomas Wilke:
First-Order Logic with Two Variables and Unary Temporal Logic. Inf. Comput. 179(2): 279-295 (2002) - [c16]Kousha Etessami:
A Hierarchy of Polynomial-Time Computable Simulations for Automata. CONCUR 2002: 131-144 - 2001
- [j6]Rajeev Alur, Kousha Etessami, Salvatore La Torre, Doron A. Peled:
Parametric temporal logic for "model measuring". ACM Trans. Comput. Log. 2(3): 388-407 (2001) - [c15]Rajeev Alur, Kousha Etessami, Mihalis Yannakakis:
Analysis of Recursive State Machines. CAV 2001: 207-220 - [c14]Kousha Etessami, Thomas Wilke, Rebecca A. Schuller:
Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata. ICALP 2001: 694-707 - [c13]Rajeev Alur, Kousha Etessami, Mihalis Yannakakis:
Realizability and Verification of MSC Graphs. ICALP 2001: 797-808 - [c12]Margaret H. Smith, Gerard J. Holzmann, Kousha Etessami:
Events and Constraints: A Graphical Editor for Capturing Logic Requirements of Programs. RE 2001: 14-22 - 2000
- [j5]Kousha Etessami, Neil Immerman:
Tree Canonization and Transitive Closure. Inf. Comput. 157(1-2): 2-24 (2000) - [j4]Kousha Etessami, Thomas Wilke:
An Until Hierarchy and Other Applications of an Ehrenfeucht-Fraïssé Game for Temporal Logic. Inf. Comput. 160(1-2): 88-108 (2000) - [j3]Kousha Etessami:
A note on a question of Peled and Wilke regarding stutter-invariant LTL. Inf. Process. Lett. 75(6): 261-263 (2000) - [c11]Kousha Etessami, Gerard J. Holzmann:
Optimizing Büchi Automata. CONCUR 2000: 153-167 - [c10]Kousha Etessami, Mihalis Yannakakis:
From Rule-based to Automata-based Testing. FORTE 2000: 53-68 - [c9]Rajeev Alur, Kousha Etessami, Mihalis Yannakakis:
Inference of message sequence charts. ICSE 2000: 304-313
1990 – 1999
- 1999
- [c8]Kousha Etessami:
Stutter-Invariant Languages, omega-Automata, and Temporal Logic. CAV 1999: 236-248 - [c7]Rajeev Alur, Kousha Etessami, Salvatore La Torre, Doron A. Peled:
Parametric Temporal Logic for "Model Measuring". ICALP 1999: 159-168 - 1998
- [c6]Kousha Etessami:
Dynamic Tree Isomorphism via First-Order Updates. PODS 1998: 235-243 - 1997
- [j2]Kousha Etessami:
Counting Quantifiers, Successor Relations, and Logarithmic Space. J. Comput. Syst. Sci. 54(3): 400-411 (1997) - [c5]Kousha Etessami, Moshe Y. Vardi, Thomas Wilke:
First-Order Logic with Two Variables and Unary Temporal Logic. LICS 1997: 228-235 - 1996
- [c4]Kousha Etessami, Thomas Wilke:
An Until Hierarchy for Temporal Logic. LICS 1996: 108-117 - 1995
- [j1]Kousha Etessami, Neil Immerman:
Reachability and the Power of Local Ordering. Theor. Comput. Sci. 148(2): 261-279 (1995) - [c3]Kousha Etessami:
Counting Quantifiers, Successor Relations, and Logarithmic Space. SCT 1995: 2-11 - [c2]Kousha Etessami, Neil Immerman:
Tree Canonization and Transitive Closure. LICS 1995: 331-341 - 1994
- [c1]Kousha Etessami, Neil Immerman:
Reachability and the Power of Local Ordering. STACS 1994: 123-135
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
