Kousha Etessami

9.0k total citations
51 papers, 1.4k citations indexed

About

Kousha Etessami is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Software. According to data from OpenAlex, Kousha Etessami has authored 51 papers receiving a total of 1.4k indexed citations (citations by other indexed papers that have themselves been cited), including 36 papers in Computational Theory and Mathematics, 31 papers in Artificial Intelligence and 12 papers in Software. Recurrent topics in Kousha Etessami's work include Formal Methods in Verification (27 papers), Logic, programming, and type systems (15 papers) and semigroups and automata theory (12 papers). Kousha Etessami is often cited by papers focused on Formal Methods in Verification (27 papers), Logic, programming, and type systems (15 papers) and semigroups and automata theory (12 papers). Kousha Etessami collaborates with scholars based in United States, United Kingdom and Germany. Kousha Etessami's co-authors include Mihalis Yannakakis, Rajeev Alur, Thomas Wilke, Moshe Y. Vardi, Neil Immerman, Sriram K. Rajamani, Thomas Reps, Michael Benedikt, Patrice Godefroid and Margaret Smith and has published in prestigious journals such as IEEE Transactions on Software Engineering, Journal of the ACM and SIAM Journal on Computing.

In The Last Decade

Kousha Etessami

49 papers receiving 1.3k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Kousha Etessami United States 19 834 820 357 282 179 51 1.4k
Orna Kupferman Israel 23 2.0k 2.4× 2.0k 2.4× 670 1.9× 225 0.8× 124 0.7× 110 2.7k
Nicola Leone Italy 26 804 1.0× 2.7k 3.3× 84 0.2× 1.1k 3.9× 182 1.0× 135 3.3k
R.J. Lipton United States 19 441 0.5× 664 0.8× 1.3k 3.7× 562 2.0× 878 4.9× 50 2.5k
Matti J„ärvisalo Finland 17 257 0.3× 676 0.8× 101 0.3× 197 0.7× 74 0.4× 99 874
J. C. M. Baeten Netherlands 21 1.8k 2.1× 1.4k 1.7× 299 0.8× 405 1.4× 217 1.2× 92 2.3k
Stefan Szeider Austria 19 879 1.1× 618 0.8× 46 0.1× 431 1.5× 55 0.3× 139 1.3k
Torsten Schaub Germany 26 456 0.5× 2.2k 2.7× 67 0.2× 483 1.7× 99 0.6× 172 2.6k
J.A. Bergstra Netherlands 27 2.4k 2.9× 2.2k 2.7× 368 1.0× 438 1.6× 234 1.3× 267 3.1k
Glynn Winskel United Kingdom 23 1.7k 2.1× 1.5k 1.9× 232 0.6× 604 2.1× 206 1.2× 119 2.4k
Bengt Jönsson Sweden 25 1.8k 2.2× 1.3k 1.6× 1.1k 3.0× 647 2.3× 241 1.3× 105 2.7k

Countries citing papers authored by Kousha Etessami

Since Specialization
Citations

This map shows the geographic impact of Kousha Etessami's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Kousha Etessami with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Kousha Etessami more than expected).

Fields of papers citing papers by Kousha Etessami

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Kousha Etessami. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Kousha Etessami. The network helps show where Kousha Etessami may publish in the future.

Co-authorship network of co-authors of Kousha Etessami

This figure shows the co-authorship network connecting the top 25 collaborators of Kousha Etessami. A scholar is included among the top collaborators of Kousha Etessami based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Kousha Etessami. Kousha Etessami is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Etessami, Kousha, Christos H. Papadimitriou, Aviad Rubinstein, & Mihalis Yannakakis. (2020). Tarski’s Theorem, Supermodular Games, and the Complexity of Equilibria. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 4 indexed citations
2.
Etessami, Kousha, Alistair Stewart, & Mihalis Yannakakis. (2017). A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes. SIAM Journal on Computing. 46(5). 1515–1553. 1 indexed citations
3.
Etessami, Kousha & Mihalis Yannakakis. (2010). On the Complexity of Nash Equilibria and Other Fixed Points. SIAM Journal on Computing. 39(6). 2531–2597. 95 indexed citations
4.
Brázdil, Tomǎš, Václav Brožek, Kousha Etessami, Antonı́n Kučera, & Dominik Wojtczak. (2010). One-Counter Markov Decision Processes. Edinburgh Research Explorer. 863–874. 4 indexed citations
5.
Brázdil, Tomǎš, et al.. (2010). Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '10). 15 indexed citations
6.
Etessami, Kousha, Dominik Wojtczak, & Mihalis Yannakakis. (2010). Quasi-Birth–Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems. Performance Evaluation. 67(9). 837–857. 16 indexed citations
7.
Etessami, Kousha & Mihalis Yannakakis. (2009). Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations. Journal of the ACM. 56(1). 1–66. 209 indexed citations
8.
Etessami, Kousha, Dominik Wojtczak, & Mihalis Yannakakis. (2008). Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems. Edinburgh Research Explorer. 243–253. 14 indexed citations
9.
Etessami, Kousha, Marta Kwiatkowska, Moshe Y. Vardi, & Mihalis Yannakakis. (2008). Multi-Objective Model Checking of Markov Decision Processes. Logical Methods in Computer Science. Volume 4, Issue 4. 48 indexed citations
10.
Etessami, Kousha & Sriram K. Rajamani. (2005). Computer aided verification : 17th International Conference, CAV 2005, Edinburgh, Scotland, UK, July 6-10, 2005 : proceedings. Springer eBooks. 13 indexed citations
11.
Etessami, Kousha, et al.. (2005). Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata. SIAM Journal on Computing. 34(5). 1159–1175. 30 indexed citations
12.
Alur, Rajeev, Kousha Etessami, & Mihalis Yannakakis. (2004). Realizability and verification of MSC graphs. Theoretical Computer Science. 331(1). 97–114. 67 indexed citations
13.
Smith, Margaret, Gerard J. Holzmann, & Kousha Etessami. (2002). Events and constraints: a graphical editor for capturing logic requirements of programs. 14–22. 46 indexed citations
14.
Alur, Rajeev, Kousha Etessami, Salvatore La Torre, & Doron Peled. (2001). Parametric temporal logic for “model measuring”. ACM Transactions on Computational Logic. 2(3). 388–407. 38 indexed citations
15.
Etessami, Kousha & Neil Immerman. (2000). Tree Canonization and Transitive Closure. Information and Computation. 157(1-2). 2–24. 7 indexed citations
16.
Alur, Rajeev, Kousha Etessami, & Mihalis Yannakakis. (2000). Inference of message sequence charts. 304–313. 51 indexed citations
17.
Etessami, Kousha & Thomas Wilke. (2000). An Until Hierarchy and Other Applications of an Ehrenfeucht–Fraıssé Game for Temporal Logic. Information and Computation. 160(1-2). 88–108. 18 indexed citations
18.
Etessami, Kousha. (1998). Dynamic Tree Isomorphism via First-Order Updates.. 235–243. 9 indexed citations
19.
Etessami, Kousha. (1998). Dynamic tree isomorphism via first-order updates to a relational database. 235–243. 15 indexed citations
20.
Etessami, Kousha & Neil Immerman. (1995). Reachability and the power of local ordering. Theoretical Computer Science. 148(2). 261–279. 15 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Orna Kupferman Breakdown of academic impact, for papers by Nicola Leone Breakdown of academic impact, for papers by R.J. Lipton Breakdown of academic impact, for papers by Matti J„ärvisalo Breakdown of academic impact, for papers by J. C. M. Baeten Breakdown of academic impact, for papers by Stefan Szeider Breakdown of academic impact, for papers by Torsten Schaub Breakdown of academic impact, for papers by J.A. Bergstra Breakdown of academic impact, for papers by Glynn Winskel Breakdown of academic impact, for papers by Bengt Jönsson
Rankless by CCL
2026