Kousha Etessami | Academic Influence

Kousha Etessami's AcademicInfluence.com Rankings

Kousha Etessami

Computer Science

#3064

World Rank

#3214

Historical Rank

Software Engineering

#330

World Rank

#336

Historical Rank

computer-science Degrees

Kousha Etessami

Mathematics

#5187

World Rank

#7320

Historical Rank

Measure Theory

#3113

World Rank

#3694

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Kousha Etessami's Degrees

PhD Computer Science University of Oxford
Masters Computer Science University of Oxford
Bachelors Mathematics University of Tehran

Similar Degrees You Can Earn

Why Is Kousha Etessami Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Kousha Etessami is a professor of computer science at the University of Edinburgh, Scotland, UK. He has received his Ph.D. from the University of Massachusetts Amherst in 1995. He works on theoretical computer science, in particular on computational complexity theory, game theory and probabilistic systems.

(See a Problem?)

Kousha Etessami's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

A Temporal Logic of Nested Calls and Returns (2004) (3375)
Analysis of Recursive Game Graphs Using Data Flow Equations (2004) (1056)
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations (2005) (512)
Optimizing Büchi Automata (2000) (399)
Inference of message sequence charts (2000) (335)
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract) (2007) (293)
Analysis of recursive state machines (2001) (265)
First-order logic with two variables and unary temporal logic (1997) (209)
A Hierarchy of Polynomial-Time Computable Simulations for Automata (2002) (201)
Multi-Objective Model Checking of Markov Decision Processes (2007) (194)
Realizability and verification of MSC graphs (2005) (184)
Recursive Markov Decision Processes and Recursive Stochastic Games (2005) (128)
Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata (2001) (123)
First-Order and Temporal Logics for Nested Words (2007) (123)
Verifying Probabilistic Procedural Programs (2004) (108)
Counting quantifiers, successor relations, and logarithmic space (1995) (102)
Parametric temporal logic for “model measuring” (2001) (101)
Events and constraints: a graphical editor for capturing logic requirements of programs (2001) (79)
Recursive Concurrent Stochastic Games (2006) (79)
Algorithmic Verification of Recursive Probabilistic State Machines (2005) (67)
One-counter Markov decision processes (2009) (62)
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems (2008) (53)
An Until hierarchy for temporal logic (1996) (51)
Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games (2006) (43)
One-Counter Stochastic Games (2010) (42)
An Until Hierarchy and Other Applications of an Ehrenfeucht-Fraïssé Game for Temporal Logic (2000) (42)
Recursive Stochastic Games with Positive Rewards (2008) (38)
Approximating the Termination Value of One-Counter MDPs and Stochastic Games (2011) (38)
Reachability and the Power of Local Ordering (1995) (32)
Checking LTL properties of recursive Markov chains (2005) (32)
The computational complexity of evolutionarily stable strategies (2008) (32)
Fair Simulation Relations, Parity Games, and State Space Reduction for Bu"chi Automata (2005) (30)
Polynomial Time Algorithms for Multi-Type Branching Processes and Stochastic Context-Free Grammars (2012) (28)
Tree canonization and transitive closure (1995) (27)
On-the-Fly Reachability and Cycle Detection for Recursive State Machines (2005) (26)
Stutter-Invariant Languages, omega-Automata, and Temporal Logic (1999) (24)
Model Checking of Recursive Probabilistic Systems (2012) (24)
Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars (2012) (22)
Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations (2012) (22)
A note on a question of Peled and Wilke regarding stutter-invariant LTL (2000) (22)
Dynamic Tree Isomorphism via First-Order Updates. (1998) (20)
Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29 - July 2, 1997 (1997) (20)
Dynamic tree isomorphism via first-order updates to a relational database (1998) (19)
Upper Bounds for Newton’s Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata (2013) (18)
PReMo : An Analyzer for P robabilistic Re cursive Mo dels (2007) (15)
The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form (2014) (13)
Parametric Temporal Logic for "Model Measuring" (1999) (13)
Tarski's Theorem, Supermodular Games, and the Complexity of Equilibria (2019) (11)
Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes (2015) (11)
Computer Aided Verification (2008) (10)
Compression of Partially Ordered Strings (2003) (9)
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '10) (2010) (8)
2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (2017) (7)
The complexity of computing a (quasi-)perfect equilibrium for an n-player extensive form game (2021) (6)
22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 10-12 July 2007, Wroclaw, Poland, Proceedings (2007) (6)
A Note on the Complexity of Comparing Succinctly Represented Integers, with an Application to Maximum Probability Parsing (2013) (6)
Stochastic Context-Free Grammars, Regular Languages, and Newton's Method (2013) (5)
The complexity of computing a (perfect) equilibrium for an n-player extensive form game of perfect recall (2014) (4)
From Rule-based to Automata-based Testing (2000) (4)
A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes (2017) (4)
Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes (2018) (3)
Analysis of probabilistic processes and automata theory (2021) (3)
Two Variables and Unary Temporal Logic (1997) (3)
A polynomial time algorithm for computing extinction probabilities of multi-type branching processes (2016) (2)
Reachability for Branching Concurrent Stochastic Games (2018) (2)
Proceedings of the 17th international conference on Computer Aided Verification (2005) (2)
Realizability and Veriication of Msc Graphs (2001) (2)
Approximating the Termination Value of One-Counter (2013) (1)
An abort-aware model of transactional programming (2008) (1)
Special Section on the Forty-Third Annual ACM Symposium on Theory of Computing (STOC 2011) (2012) (1)
Computer aided verification : 17th International Conference, CAV 2005, Edinburgh, Scotland, UK, July 6-10, 2005 : proceedings (2005) (1)
Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems (2013) (0)
STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings (1994) (0)
Probability and Recursion (2005) (0)
Explorer Multi-Objective Model Checking of Markov Decision Processes (2007) (0)
Algorithms for Branching MDPs and Branching Stochastic Games: Invited Presentation at the Cassting Workshop on Games for the Synthesis of Complex Systems and 3rd International Workshop on Synthesis of Complex Parameters (2016) (0)
Session details: Session 12: 16:00--16:10 (2014) (0)
A Model of Transactional Programming (2008) (0)
Explorer Stochastic Context-Free Grammars , Regular Languages , and Newton ' s Method (2013) (0)
An Abort-Aware Model of Transactional Programming ( Position Paper ) (2008) (0)
Qualitative Multi-Objective Reachability for Ordered Branching MDPs (2020) (0)
Finite and Algorithmic Model Theory (Dagstuhl Seminar 22051) (2022) (0)
Edinburgh Research Explorer Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes (2016) (0)
Algorithms for some infinite-state MDPs and stochastic games (2017) (0)
Explorer Recursive Concurrent Stochastic Games (2006) (0)
Explorer Polynomial Time Algorithms for Multi-Type Branching Processes and Stochastic Context-Free Grammars (2013) (0)
Appendix to : Model Checking of Recursive Probabilistic Systems (2012) (0)
Explorer Greatest Fixed Points of Probabilistic Min / Max Polynomial Equations , and Reachability for Branching Markov Decision Processes ? (2016) (0)
Finite and Algorithmic Model Theory (2022) (0)
The complexity of analyzing infinite-state Markov chains, Markov decision processes, and stochastic games (Invited talk) (2013) (0)
An Order, Proving Bounds for a Language with Aggre- Gates Hinges on Separation of Tc Lemma 7.1 A) Let M Be a Positive Integer. Then There Exists a Number N > 0 Such That Ntp a 2 M(~ A) = (0)
Compression of Partially Ordered (2003) (0)
Invited Articles Foreword (2015) (0)

This paper list is powered by the following services:

Other Resources About Kousha Etessami

en.wikipedia.org

What Schools Are Affiliated With Kousha Etessami?

Kousha Etessami is affiliated with the following schools: