Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Etessami, Kousha"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximating the termination value of one-counter MDPs and stochastic games
Tomás̑ Brázdil
,
Václav Broz̑ek
,
Kousha Etessami
,
Antonín Kuc̑era
Information and Computation
222
, 2013, pp. 121-138
Stochastic context-free grammars, regular languages, and Newton's method
Kousha Etessami
,
Alistair Stewart
,
Mihalis Yannakakis
Lecture Notes in Computer Science
7966
, 2013, pp. 199-211
The complexity of analyzing infinite-state Markov chains, Markov decision processes, and stochastic games
Kousha Etessami
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 1-2
Polynomial time algorithms for branching Markov decision processes and probabilistic min(max) polynomial Bellman equations
Kousha Etessami
,
Alistair Stewart
,
Mihalis Yannakakis
Lecture Notes in Computer Science
7391
, 2012, pp. 314-326
Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars
Kousha Etessami
,
Alistair Stewart
,
Mihalis Yannakakis
Proceedings of the 44th ACM Symposium on Theory of Computing, STOC'2012 (New York, NY, USA, May 19-22, 2012)
, 2012, pp. 579-588
Approximating the termination value of one-counter MDPs and stochastic games
Tomás̑ Brázdil
,
Václav Broz̑ek
,
Kousha Etessami
,
Antonín Kuc̑era
Lecture Notes in Computer Science
6756
, 2011, pp. 332-343
One-counter stochastic games
Tomás̑ Brázdil
,
Václav Broz̑ek
,
Kousha Etessami
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 108-119
On the complexity of Nash equilibria and other fixed points
Kousha Etessami
,
Mihalis Yannakakis
SIAM Journal on Computing
39
(6), 2010, pp. 2531-2597
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
Kousha Etessami
,
Mihalis Yannakakis
Journal of the ACM
56
(1), 2009, pp. 1: 1-66
Recursive stochastic games with positive rewards
Kousha Etessami
,
Dominik Wojtczak
,
Mihalis Yannakakis
Lecture Notes in Computer Science
5125
, 2008, pp. 711-723
Efficient qualitative analysis of classes of Recursive Markov Decision Processes and Simple Stochastic Games
Kousha Etessami
,
Mihalis Yannakakis
Lecture Notes in Computer Science
3884
, 2006, pp. 634-645
Recursive concurrent stochastic games
Kousha Etessami
,
Mihalis Yannakakis
Lecture Notes in Computer Science
4052
, 2006, pp. 324-335
Realizability and verification of MSC graphs
Rajeev Alur
,
Kousha Etessami
,
Mihalis Yannakakis
Theoretical Computer Science
331
(1), 2005, pp. 97-114
Fair simulation relations, parity games, and state space reduction for Büchi automata
Kousha Etessami
,
Thomas Wilke
,
Rebecca A. Schuller
SIAM Journal on Computing
34
(5), 2005, pp. 1159-1175
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
Kousha Etessami
,
Mihalis Yannakakis
Lecture Notes in Computer Science
3404
, 2005, pp. 340-352
Recursive Markov decision processes and recursive stochastic games
Kousha Etessami
,
Mihalis Yannakakis
Lecture Notes in Computer Science
3580
, 2005, pp. 891-903
Probability and recursion
Kousha Etessami
,
Mihalis Yannakakis
Lecture Notes in Computer Science
3827
, 2005, pp. 2-4
Verifying probabilistic procedural programs
Javier Esparza
,
Kousha Etessami
Lecture Notes in Computer Science
3328
, 2004, pp. 16-31
First-order logic with two variables and unary temporal logic
Kousha Etessami
,
Moshe Y. Vardi
,
Thomas Wilke
Information and Computation
179
(2), 2002, pp. 279-295
Realizability and verification of MSC graphs
Rajeev Alur
,
Kousha Etessami
,
Mihalis Yannakakis
Lecture Notes in Computer Science
2076
, 2001, pp. 797-808
Fair simulation relations, parity games, and state space reduction for Büchi automata
Kousha Etessami
,
Thomas Wilke
,
Rebecca A. Schuller
Lecture Notes in Computer Science
2076
, 2001, pp. 694-707
Tree canonization and transitive closure
Kousha Etessami
,
Neil Immerman
Information and Computation
157
(1-2), 2000, pp. 2-24
An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic
Kousha Etessami
,
Thomas Wilke
Information and Computation
160
(1-2), 2000, pp. 88-108
A note on a question of Peled and Wilke regarding stutter-invariant LTL
Kousha Etessami
Information Processing Letters
75
(6), 2000, pp. 261-263
Parametric temporal logic for ``model measuring''
Rajeev Alur
,
Kousha Etessami
,
Salvatore La Torre
,
Doron Peled
Lecture Notes in Computer Science
1644
, 1999, pp. 159-168
Seiten 1
2
>