![]() | ![]() |
| 2012 | ||
|---|---|---|
| 69 | Kousha Etessami, Alistair Stewart, Mihalis Yannakakis: Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars. STOC 2012: 579-588 | |
| 68 | Kousha Etessami, Mihalis Yannakakis: Model Checking of Recursive Probabilistic Systems. ACM Trans. Comput. Log. 13(2): 12 (2012) | |
| 67 | Kousha Etessami, Alistair Stewart, Mihalis Yannakakis: Polynomial Time Algorithms for Multi-Type Branching Processes and Stochastic Context-Free Grammars CoRR abs/1201.2374: (2012) | |
| 66 | 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 | ||
| 65 | 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 | |
| 64 | 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) | |
| 63 | Kousha Etessami, Patrice Godefroid: An abort-aware model of transactional programming. STTT 13(6): 537-551 (2011) | |
| 2010 | ||
| 62 | Tomás Brázdil, Václav Brozek, Kousha Etessami: One-Counter Stochastic Games. FSTTCS 2010: 108-119 | |
| 61 | Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera, Dominik Wojtczak: One-Counter Markov Decision Processes. SODA 2010: 863-874 | |
| 60 | Tomás Brázdil, Václav Brozek, Kousha Etessami: One-Counter Stochastic Games CoRR abs/1009.5636: (2010) | |
| 59 | Kousha Etessami, Dominik Wojtczak, Mihalis Yannakakis: Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems. Perform. Eval. 67(9): 837-857 (2010) | |
| 58 | Kousha Etessami, Mihalis Yannakakis: On the Complexity of Nash Equilibria and Other Fixed Points. SIAM J. Comput. 39(6): 2531-2597 (2010) | |
| 2009 | ||
| 57 | Kousha Etessami, Patrice Godefroid: An Abort-Aware Model of Transactional Programming. VMCAI 2009: 59-73 | |
| 56 | Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera, Dominik Wojtczak: One-Counter Markov Decision Processes CoRR abs/0904.2511: (2009) | |
| 55 | Kousha Etessami, Mihalis Yannakakis: Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations. J. ACM 56(1): (2009) | |
| 2008 | ||
| 54 | Kousha Etessami, Dominik Wojtczak, Mihalis Yannakakis: Recursive Stochastic Games with Positive Rewards. ICALP (1) 2008: 711-723 | |
| 53 | Kousha Etessami, Dominik Wojtczak, Mihalis Yannakakis: Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems. QEST 2008: 243-253 | |
| 52 | Kousha Etessami, Mihalis Yannakakis: Recursive Concurrent Stochastic Games CoRR abs/0810.3581: (2008) | |
| 51 | Kousha Etessami, Marta Z. Kwiatkowska, Moshe Y. Vardi, Mihalis Yannakakis: Multi-Objective Model Checking of Markov Decision Processes CoRR abs/0810.5728: (2008) | |
| 50 | 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) | |
| 49 | Kousha Etessami, Andreas Lochbihler: The computational complexity of evolutionarily stable strategies. Int. J. Game Theory 37(1): 93-113 (2008) | |
| 48 | Rajeev Alur, Marcelo Arenas, Pablo Barceló, Kousha Etessami, Neil Immerman, Leonid Libkin: First-Order and Temporal Logics for Nested Words. Logical Methods in Computer Science 4(4): (2008) | |
| 47 | Kousha Etessami, Marta Z. Kwiatkowska, Moshe Y. Vardi, Mihalis Yannakakis: Multi-Objective Model Checking of Markov Decision Processes. Logical Methods in Computer Science 4(4): (2008) | |
| 46 | Kousha Etessami, Mihalis Yannakakis: Recursive Concurrent Stochastic Games. Logical Methods in Computer Science 4(4): (2008) | |
| 2007 | ||
| 45 | Kousha Etessami, Mihalis Yannakakis: On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract). FOCS 2007: 113-123 | |
| 44 | Rajeev Alur, Marcelo Arenas, Pablo Barceló, Kousha Etessami, Neil Immerman, Leonid Libkin: First-Order and Temporal Logics for Nested Words. LICS 2007: 151-160 | |
| 43 | Kousha Etessami, Marta Z. Kwiatkowska, Moshe Y. Vardi, Mihalis Yannakakis: Multi-objective Model Checking of Markov Decision Processes. TACAS 2007: 50-65 | |
| 42 | Dominik Wojtczak, Kousha Etessami: PReMo : An Analyzer for P robabilistic Re cursive Mo dels. TACAS 2007: 66-71 | |
| 2006 | ||
| 41 | Kousha Etessami, Mihalis Yannakakis: Recursive Concurrent Stochastic Games. ICALP (2) 2006: 324-335 | |
| 40 | Kousha Etessami, Mihalis Yannakakis: Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games. STACS 2006: 634-645 | |
| 2005 | ||
| 39 | Kousha Etessami, Sriram K. Rajamani: Computer Aided Verification, 17th International Conference, CAV 2005, Edinburgh, Scotland, UK, July 6-10, 2005, Proceedings Springer 2005 | |
| 38 | Kousha Etessami, Mihalis Yannakakis: Recursive Markov Decision Processes and Recursive Stochastic Games. ICALP 2005: 891-903 | |
| 37 | Kousha Etessami, Mihalis Yannakakis: Probability and Recursion. ISAAC 2005: 2-4 | |
| 36 | Mihalis Yannakakis, Kousha Etessami: Checking LTL Properties of Recursive Markov Chains. QEST 2005: 155-165 | |
| 35 | Kousha Etessami, Mihalis Yannakakis: Recursive Markov Chains, Stochastic Grammars, and Monotone Systems of Nonlinear Equations. STACS 2005: 340-352 | |
| 34 | Kousha Etessami, Mihalis Yannakakis: Algorithmic Verification of Recursive Probabilistic State Machines. TACAS 2005: 253-270 | |
| 33 | Rajeev Alur, Swarat Chaudhuri, Kousha Etessami, P. Madhusudan: On-the-Fly Reachability and Cycle Detection for Recursive State Machines. TACAS 2005: 61-76 | |
| 32 | 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) | |
| 31 | 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) | |
| 30 | Rajeev Alur, Kousha Etessami, Mihalis Yannakakis: Realizability and verification of MSC graphs. Theor. Comput. Sci. 331(1): 97-114 (2005) | |
| 2004 | ||
| 29 | Javier Esparza, Kousha Etessami: Verifying Probabilistic Procedural Programs. FSTTCS 2004: 16-31 | |
| 28 | Rajeev Alur, Kousha Etessami, P. Madhusudan: A Temporal Logic of Nested Calls and Returns. TACAS 2004: 467-481 | |
| 27 | Kousha Etessami: Analysis of Recursive Game Graphs Using Data Flow Equations. VMCAI 2004: 282-296 | |
| 26 | Kousha Etessami, Andreas Lochbihler: The computational complexity of Evolutionarily Stable Strategies Electronic Colloquium on Computational Complexity (ECCC)(055): (2004) | |
| 2003 | ||
| 25 | Rajeev Alur, Swarat Chaudhuri, Kousha Etessami, Sudipto Guha, Mihalis Yannakakis: Compression of Partially Ordered Strings. CONCUR 2003: 42-56 | |
| 24 | Rajeev Alur, Kousha Etessami, Mihalis Yannakakis: Inference of Message Sequence Charts. IEEE Trans. Software Eng. 29(7): 623-633 (2003) | |
| 2002 | ||
| 23 | Kousha Etessami: A Hierarchy of Polynomial-Time Computable Simulations for Automata. CONCUR 2002: 131-144 | |
| 22 | Kousha Etessami, Moshe Y. Vardi, Thomas Wilke: First-Order Logic with Two Variables and Unary Temporal Logic. Inf. Comput. 179(2): 279-295 (2002) | |
| 2001 | ||
| 21 | Rajeev Alur, Kousha Etessami, Mihalis Yannakakis: Analysis of Recursive State Machines. CAV 2001: 207-220 | |
| 20 | Kousha Etessami, Thomas Wilke, Rebecca A. Schuller: Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata. ICALP 2001: 694-707 | |
| 19 | Rajeev Alur, Kousha Etessami, Mihalis Yannakakis: Realizability and Verification of MSC Graphs. ICALP 2001: 797-808 | |
| 18 | Margaret H. Smith, Gerard J. Holzmann, Kousha Etessami: Events and Constraints: A Graphical Editor for Capturing Logic Requirements of Programs. RE 2001: 14-22 | |
| 17 | Rajeev Alur, Kousha Etessami, Salvatore La Torre, Doron Peled: Parametric temporal logic for "model measuring". ACM Trans. Comput. Log. 2(3): 388-407 (2001) | |
| 2000 | ||
| 16 | Kousha Etessami, Gerard J. Holzmann: Optimizing Büchi Automata. CONCUR 2000: 153-167 | |
| 15 | Kousha Etessami, Mihalis Yannakakis: From Rule-based to Automata-based Testing. FORTE 2000: 53-68 | |
| 14 | Rajeev Alur, Kousha Etessami, Mihalis Yannakakis: Inference of message sequence charts. ICSE 2000: 304-313 | |
| 13 | Kousha Etessami, Neil Immerman: Tree Canonization and Transitive Closure. Inf. Comput. 157(1-2): 2-24 (2000) | |
| 12 | 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) | |
| 11 | Kousha Etessami: A note on a question of Peled and Wilke regarding stutter-invariant LTL. Inf. Process. Lett. 75(6): 261-263 (2000) | |
| 1999 | ||
| 10 | Kousha Etessami: Stutter-Invariant Languages, omega-Automata, and Temporal Logic. CAV 1999: 236-248 | |
| 9 | Rajeev Alur, Kousha Etessami, Salvatore La Torre, Doron Peled: Parametric Temporal Logic for "Model Measuring". ICALP 1999: 159-168 | |
| 1998 | ||
| 8 | Kousha Etessami: Dynamic Tree Isomorphism via First-Order Updates. PODS 1998: 235-243 | |
| 1997 | ||
| 7 | Kousha Etessami, Moshe Y. Vardi, Thomas Wilke: First-Order Logic with Two Variables and Unary Temporal Logic. LICS 1997: 228-235 | |
| 6 | Kousha Etessami: Counting Quantifiers, Successor Relations, and Logarithmic Space. J. Comput. Syst. Sci. 54(3): 400-411 (1997) | |
| 1996 | ||
| 5 | Kousha Etessami, Thomas Wilke: An Until Hierarchy for Temporal Logic. LICS 1996: 108-117 | |
| 1995 | ||
| 4 | Kousha Etessami, Neil Immerman: Tree Canonization and Transitive Closure LICS 1995: 331-341 | |
| 3 | Kousha Etessami: Counting Quantifiers, Successor Relations, and Logarithmic Space. Structure in Complexity Theory Conference 1995: 2-11 | |
| 2 | Kousha Etessami, Neil Immerman: Reachability and the Power of Local Ordering. Theor. Comput. Sci. 148(2): 261-279 (1995) | |
| 1994 | ||
| 1 | Kousha Etessami, Neil Immerman: Reachability and the Power of Local Ordering. STACS 1994: 123-135 | |
Colors in the list of coauthors
Last update Tue May 29 20:41:18 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page