The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Kousha Etessami: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Kousha Etessami
    Counting Quantifiers, Successor Relations, and Logarithmic Space. [Citation Graph (4, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:3, pp:400-411 [Journal]
  2. Kousha Etessami, Neil Immerman
    Tree Canonization and Transitive Closure [Citation Graph (3, 0)][DBLP]
    LICS, 1995, pp:331-341 [Conf]
  3. Kousha Etessami
    Dynamic Tree Isomorphism via First-Order Updates. [Citation Graph (1, 16)][DBLP]
    PODS, 1998, pp:235-243 [Conf]
  4. Rajeev Alur, Kousha Etessami, Mihalis Yannakakis
    Analysis of Recursive State Machines. [Citation Graph (0, 0)][DBLP]
    CAV, 2001, pp:207-220 [Conf]
  5. Kousha Etessami
    Stutter-Invariant Languages, omega-Automata, and Temporal Logic. [Citation Graph (0, 0)][DBLP]
    CAV, 1999, pp:236-248 [Conf]
  6. Kousha Etessami
    Counting Quantifiers, Successor Relations, and Logarithmic Space. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:2-11 [Conf]
  7. Rajeev Alur, Swarat Chaudhuri, Kousha Etessami, Sudipto Guha, Mihalis Yannakakis
    Compression of Partially Ordered Strings. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:42-56 [Conf]
  8. Kousha Etessami
    A Hierarchy of Polynomial-Time Computable Simulations for Automata. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:131-144 [Conf]
  9. Kousha Etessami, Gerard J. Holzmann
    Optimizing Büchi Automata. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2000, pp:153-167 [Conf]
  10. Kousha Etessami, Mihalis Yannakakis
    From Rule-based to Automata-based Testing. [Citation Graph (0, 0)][DBLP]
    FORTE, 2000, pp:53-68 [Conf]
  11. Javier Esparza, Kousha Etessami
    Verifying Probabilistic Procedural Programs. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2004, pp:16-31 [Conf]
  12. Rajeev Alur, Kousha Etessami, Mihalis Yannakakis
    Realizability and Verification of MSC Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:797-808 [Conf]
  13. Rajeev Alur, Kousha Etessami, Salvatore La Torre, Doron Peled
    Parametric Temporal Logic for "Model Measuring". [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:159-168 [Conf]
  14. Kousha Etessami, Thomas Wilke, Rebecca A. Schuller
    Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:694-707 [Conf]
  15. Kousha Etessami, Mihalis Yannakakis
    Recursive Markov Decision Processes and Recursive Stochastic Games. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:891-903 [Conf]
  16. Kousha Etessami, Mihalis Yannakakis
    Recursive Concurrent Stochastic Games. [Citation Graph (0, 0)][DBLP]
    ICALP (2), 2006, pp:324-335 [Conf]
  17. Rajeev Alur, Kousha Etessami, Mihalis Yannakakis
    Inference of message sequence charts. [Citation Graph (0, 0)][DBLP]
    ICSE, 2000, pp:304-313 [Conf]
  18. Kousha Etessami, Mihalis Yannakakis
    Probability and Recursion. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:2-4 [Conf]
  19. Kousha Etessami, Moshe Y. Vardi, Thomas Wilke
    First-Order Logic with Two Variables and Unary Temporal Logic. [Citation Graph (0, 0)][DBLP]
    LICS, 1997, pp:228-235 [Conf]
  20. Kousha Etessami, Thomas Wilke
    An Until Hierarchy for Temporal Logic. [Citation Graph (0, 0)][DBLP]
    LICS, 1996, pp:108-117 [Conf]
  21. Mihalis Yannakakis, Kousha Etessami
    Checking LTL Properties of Recursive Markov Chains. [Citation Graph (0, 0)][DBLP]
    QEST, 2005, pp:155-165 [Conf]
  22. Margaret H. Smith, Gerard J. Holzmann, Kousha Etessami
    Events and Constraints: A Graphical Editor for Capturing Logic Requirements of Programs. [Citation Graph (0, 0)][DBLP]
    RE, 2001, pp:14-22 [Conf]
  23. Kousha Etessami, Neil Immerman
    Reachability and the Power of Local Ordering. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:123-135 [Conf]
  24. Kousha Etessami, Mihalis Yannakakis
    Recursive Markov Chains, Stochastic Grammars, and Monotone Systems of Nonlinear Equations. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:340-352 [Conf]
  25. Kousha Etessami, Mihalis Yannakakis
    Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:634-645 [Conf]
  26. Rajeev Alur, Swarat Chaudhuri, Kousha Etessami, P. Madhusudan
    On-the-Fly Reachability and Cycle Detection for Recursive State Machines. [Citation Graph (0, 0)][DBLP]
    TACAS, 2005, pp:61-76 [Conf]
  27. Rajeev Alur, Kousha Etessami, P. Madhusudan
    A Temporal Logic of Nested Calls and Returns. [Citation Graph (0, 0)][DBLP]
    TACAS, 2004, pp:467-481 [Conf]
  28. Kousha Etessami, Mihalis Yannakakis
    Algorithmic Verification of Recursive Probabilistic State Machines. [Citation Graph (0, 0)][DBLP]
    TACAS, 2005, pp:253-270 [Conf]
  29. Kousha Etessami
    Analysis of Recursive Game Graphs Using Data Flow Equations. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2004, pp:282-296 [Conf]
  30. Kousha Etessami, Andreas Lochbihler
    The computational complexity of Evolutionarily Stable Strategies [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:055, pp:- [Journal]
  31. Kousha Etessami, Neil Immerman
    Tree Canonization and Transitive Closure. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2000, v:157, n:1-2, pp:2-24 [Journal]
  32. Kousha Etessami, Moshe Y. Vardi, Thomas Wilke
    First-Order Logic with Two Variables and Unary Temporal Logic. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:179, n:2, pp:279-295 [Journal]
  33. Kousha Etessami, Thomas Wilke
    An Until Hierarchy and Other Applications of an Ehrenfeucht-Fraïssé Game for Temporal Logic. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2000, v:160, n:1-2, pp:88-108 [Journal]
  34. Kousha Etessami
    A note on a question of Peled and Wilke regarding stutter-invariant LTL. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:75, n:6, pp:261-263 [Journal]
  35. Kousha Etessami, Thomas Wilke, Rebecca A. Schuller
    Fair Simulation Relations, Parity Games, and State Space Reduction for Bu"chi Automata. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:5, pp:1159-1175 [Journal]
  36. Rajeev Alur, Kousha Etessami, Mihalis Yannakakis
    Realizability and verification of MSC graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:331, n:1, pp:97-114 [Journal]
  37. Kousha Etessami, Neil Immerman
    Reachability and the Power of Local Ordering. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:148, n:2, pp:261-279 [Journal]
  38. Rajeev Alur, Kousha Etessami, Salvatore La Torre, Doron Peled
    Parametric temporal logic for "model measuring". [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2001, v:2, n:3, pp:388-407 [Journal]
  39. Rajeev Alur, Michael Benedikt, Kousha Etessami, Patrice Godefroid, Thomas W. Reps, Mihalis Yannakakis
    Analysis of recursive state machines. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2005, v:27, n:4, pp:786-818 [Journal]
  40. Rajeev Alur, Kousha Etessami, Mihalis Yannakakis
    Inference of Message Sequence Charts. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 2003, v:29, n:7, pp:623-633 [Journal]
  41. Rajeev Alur, Marcelo Arenas, Pablo Barceló, Kousha Etessami, Neil Immerman, Leonid Libkin
    First-Order and Temporal Logics for Nested Words. [Citation Graph (0, 0)][DBLP]
    LICS, 2007, pp:151-160 [Conf]
  42. Dominik Wojtczak, Kousha Etessami
    PReMo : An Analyzer for P robabilistic Re cursive Mo dels. [Citation Graph (0, 0)][DBLP]
    TACAS, 2007, pp:66-71 [Conf]
  43. Kousha Etessami, Marta Z. Kwiatkowska, Moshe Y. Vardi, Mihalis Yannakakis
    Multi-objective Model Checking of Markov Decision Processes. [Citation Graph (0, 0)][DBLP]
    TACAS, 2007, pp:50-65 [Conf]

  44. On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract). [Citation Graph (, )][DBLP]


  45. Recursive Stochastic Games with Positive Rewards. [Citation Graph (, )][DBLP]


  46. Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems. [Citation Graph (, )][DBLP]


  47. One-Counter Markov Decision Processes. [Citation Graph (, )][DBLP]


  48. An Abort-Aware Model of Transactional Programming. [Citation Graph (, )][DBLP]


  49. Recursive Concurrent Stochastic Games [Citation Graph (, )][DBLP]


  50. First-Order and Temporal Logics for Nested Words [Citation Graph (, )][DBLP]


  51. One-Counter Markov Decision Processes [Citation Graph (, )][DBLP]


  52. Multi-Objective Model Checking of Markov Decision Processes [Citation Graph (, )][DBLP]


Search in 0.017secs, Finished in 0.021secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002