The following pages link to Kousha Etessami (Q294840):
Displayed 50 items.
- A note on a question of Peled and Wilke regarding stutter-invariant LTL (Q294841) (← links)
- (Q926194) (redirect page) (← links)
- The computational complexity of evolutionarily stable strategies (Q926196) (← links)
- Counting quantifiers, successor relations, and logarithmic space (Q1362332) (← links)
- Reachability and the power of local ordering (Q1367543) (← links)
- Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes (Q1641009) (← links)
- Realizability and verification of MSC graphs (Q1770427) (← links)
- Tree canonization and transitive closure (Q1854332) (← links)
- An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic (Q1854353) (← links)
- Approximating the termination value of one-counter MDPs and stochastic games (Q1951577) (← links)
- The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game (Q1995464) (← links)
- Qualitative multi-objective reachability for ordered branching MDPs (Q2039961) (← links)
- Analysis of probabilistic processes and automata theory (Q2244831) (← links)
- Recursive stochastic games with positive rewards (Q2422034) (← links)
- First-order logic with two variables and unary temporal logic (Q2506493) (← links)
- Recursive Markov Decision Processes and Recursive Stochastic Games (Q2796398) (← links)
- Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations (Q2843258) (← links)
- One-Counter Stochastic Games (Q2908841) (← links)
- The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form (Q2938661) (← links)
- A Note on the Complexity of Comparing Succinctly Represented Integers, with an Application to Maximum Probability Parsing (Q2943574) (← links)
- Model Checking of Recursive Probabilistic Systems (Q2946660) (← links)
- Approximating the Termination Value of One-Counter MDPs and Stochastic Games (Q3012931) (← links)
- On the Complexity of Nash Equilibria and Other Fixed Points (Q3068643) (← links)
- Upper Bounds for Newton’s Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata (Q3177734) (← links)
- Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations (Q3452195) (← links)
- Recursive Stochastic Games with Positive Rewards (Q3521960) (← links)
- Parametric temporal logic for “model measuring” (Q3549124) (← links)
- An Abort-Aware Model of Transactional Programming (Q3600465) (← links)
- Multi-Objective Model Checking of Markov Decision Processes (Q3623004) (← links)
- First-Order and Temporal Logics for Nested Words (Q3623007) (← links)
- (Q4484483) (← links)
- (Q4535058) (← links)
- (Q4535063) (← links)
- (Q4536600) (← links)
- (Q4551151) (← links)
- (Q4817547) (← links)
- (Q4938622) (← links)
- (Q4942645) (← links)
- (Q5091277) (← links)
- Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations (Q5108256) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5308427) (← links)
- Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata (Q5317190) (← links)
- Stochastic Context-Free Grammars, Regular Languages, and Newton’s Method (Q5327434) (← links)
- A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes (Q5363381) (← links)
- Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars (Q5415502) (← links)
- (Q5417673) (← links)
- Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games (Q5449837) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465856) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5703763) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5703796) (← links)