The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Krishnendu Chatterjee: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Arindam Chakrabarti, Krishnendu Chatterjee, Thomas A. Henzinger, Orna Kupferman, Rupak Majumdar
    Verifying Quantitative Properties Using Bound Functions. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:50-64 [Conf]
  2. Krishnendu Chatterjee
    Two-Player Nonzero-Sum omega-Regular Games. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:413-427 [Conf]
  3. Krishnendu Chatterjee, Thomas A. Henzinger
    Strategy Improvement for Stochastic Rabin and Streett Games. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:375-389 [Conf]
  4. Krishnendu Chatterjee, Radha Jagadeesan, Corin Pitcher
    Games for Controls. [Citation Graph (0, 0)][DBLP]
    CSFW, 2006, pp:70-84 [Conf]
  5. Krishnendu Chatterjee
    Concurrent Games with Tail Objectives. [Citation Graph (0, 0)][DBLP]
    CSL, 2006, pp:256-270 [Conf]
  6. Krishnendu Chatterjee
    Nash Equilibrium for Upward-Closed Objectives. [Citation Graph (0, 0)][DBLP]
    CSL, 2006, pp:271-286 [Conf]
  7. Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin
    Algorithms for Omega-Regular Games with Imperfect Information, . [Citation Graph (0, 0)][DBLP]
    CSL, 2006, pp:287-302 [Conf]
  8. Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A. Henzinger
    Simple Stochastic Parity Games. [Citation Graph (0, 0)][DBLP]
    CSL, 2003, pp:100-113 [Conf]
  9. Krishnendu Chatterjee, Rupak Majumdar, Marcin Jurdzinski
    On Nash Equilibria in Stochastic Games. [Citation Graph (0, 0)][DBLP]
    CSL, 2004, pp:26-40 [Conf]
  10. Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski
    Games with Secure Equilibria. [Citation Graph (0, 0)][DBLP]
    FMCO, 2004, pp:141-161 [Conf]
  11. Krishnendu Chatterjee, Thomas A. Henzinger
    Semiperfect-Information Games. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:1-18 [Conf]
  12. Krishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger
    The Complexity of Stochastic Rabin and Streett Games'. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:878-890 [Conf]
  13. Krishnendu Chatterjee, Pallab Dasgupta, P. P. Chakrabarti
    Complexity of Compositional Model Checking of Computation Tree Logic on Simple Structures. [Citation Graph (0, 0)][DBLP]
    IWDC, 2004, pp:102-113 [Conf]
  14. Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski
    Games with Secure Equilibria. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:160-169 [Conf]
  15. Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski
    Mean-Payoff Parity Games. [Citation Graph (0, 0)][DBLP]
    LICS, 2005, pp:178-187 [Conf]
  16. Krishnendu Chatterjee, Luca de Alfaro, Marco Faella, Thomas A. Henzinger, Rupak Majumdar, Mariëlle Stoelinga
    Compositional Quantitative Reasoning. [Citation Graph (0, 0)][DBLP]
    QEST, 2006, pp:179-188 [Conf]
  17. Krishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger
    Trading Memory for Randomness. [Citation Graph (0, 0)][DBLP]
    QEST, 2004, pp:206-217 [Conf]
  18. Krishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger
    Strategy Improvement for Concurrent Reachability Games. [Citation Graph (0, 0)][DBLP]
    QEST, 2006, pp:291-300 [Conf]
  19. Krishnendu Chatterjee, Di Ma, Rupak Majumdar, Tian Zhao, Thomas A. Henzinger, Jens Palsberg
    Stack Size Analysis for Interrupt-Driven Programs. [Citation Graph (0, 0)][DBLP]
    SAS, 2003, pp:109-126 [Conf]
  20. Krishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger
    The complexity of quantitative concurrent parity games. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:678-687 [Conf]
  21. Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A. Henzinger
    Quantitative stochastic parity games. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:121-130 [Conf]
  22. Krishnendu Chatterjee, Thomas A. Henzinger
    Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:512-523 [Conf]
  23. Krishnendu Chatterjee, Rupak Majumdar, Thomas A. Henzinger
    Markov Decision Processes with Multiple Objectives. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:325-336 [Conf]
  24. Krishnendu Chatterjee, Thomas A. Henzinger
    Finitary Winning in omega-Regular Games. [Citation Graph (0, 0)][DBLP]
    TACAS, 2006, pp:257-271 [Conf]
  25. Krishnendu Chatterjee, Di Ma, Rupak Majumdar, Tian Zhao, Thomas A. Henzinger, Jens Palsberg
    Stack size analysis for interrupt-driven programs. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:194, n:2, pp:144-174 [Journal]
  26. Krishnendu Chatterjee, Pallab Dasgupta, P. P. Chakrabarti
    The power of first-order quantification over states in branching and linear time temporal logics. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:91, n:5, pp:201-210 [Journal]
  27. Krishnendu Chatterjee, Pallab Dasgupta, P. P. Chakrabarti
    A Branching Time Temporal Framework for Quantitative Reasoning. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2003, v:30, n:2, pp:205-232 [Journal]
  28. Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski
    Games with secure equilibria. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:365, n:1-2, pp:67-82 [Journal]
  29. Krishnendu Chatterjee, Thomas A. Henzinger, Nir Piterman
    Strategy Logic. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2007, pp:59-73 [Conf]
  30. Krishnendu Chatterjee
    Optimal Strategy Synthesis in Stochastic Müller Games. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2007, pp:138-152 [Conf]
  31. Krishnendu Chatterjee, Thomas A. Henzinger, Nir Piterman
    Generalized Parity Games. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2007, pp:153-167 [Conf]
  32. Krishnendu Chatterjee, Thomas A. Henzinger
    Assume-Guarantee Synthesis. [Citation Graph (0, 0)][DBLP]
    TACAS, 2007, pp:261-275 [Conf]
  33. Krishnendu Chatterjee, Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar
    Counterexample-guided Planning. [Citation Graph (0, 0)][DBLP]
    UAI, 2005, pp:104-111 [Conf]
  34. Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin
    Algorithms for Omega-Regular Games with Imperfect Information [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  35. The Complexity of Coverage. [Citation Graph (, )][DBLP]


  36. Probabilistic Automata on Infinite Words: Decidability and Undecidability Results. [Citation Graph (, )][DBLP]


  37. Better Quality in Synthesis through Quantitative Objectives. [Citation Graph (, )][DBLP]


  38. Measuring and Synthesizing Systems in Probabilistic Environments. [Citation Graph (, )][DBLP]


  39. Robustness in the Presence of Liveness. [Citation Graph (, )][DBLP]


  40. Gist: A Solver for Probabilistic Games. [Citation Graph (, )][DBLP]


  41. Robust content-driven reputation. [Citation Graph (, )][DBLP]


  42. Environment Assumptions for Synthesis. [Citation Graph (, )][DBLP]


  43. Strategy Construction for Parity Games with Imperfect Information. [Citation Graph (, )][DBLP]


  44. Probabilistic Weighted Automata. [Citation Graph (, )][DBLP]


  45. Mean-Payoff Automaton Expressions. [Citation Graph (, )][DBLP]


  46. Obliging Games. [Citation Graph (, )][DBLP]


  47. Quantitative Languages. [Citation Graph (, )][DBLP]


  48. Logical Reliability of Interacting Real-Time Tasks. [Citation Graph (, )][DBLP]


  49. Analyzing the Impact of Change in Multi-threaded Programs. [Citation Graph (, )][DBLP]


  50. Alternating Weighted Automata. [Citation Graph (, )][DBLP]


  51. Timed Parity Games: Complexity and Robustness. [Citation Graph (, )][DBLP]


  52. Model-Checking omega-Regular Properties of Interval Markov Chains. [Citation Graph (, )][DBLP]


  53. Stochastic Müller Games are PSPACE-Complete. [Citation Graph (, )][DBLP]


  54. Markov Decision Processes with Multiple Long-Run Average Objectives. [Citation Graph (, )][DBLP]


  55. Algorithms for Game Metrics. [Citation Graph (, )][DBLP]


  56. Trading Infinite Memory for Uniform Randomness in Timed Games. [Citation Graph (, )][DBLP]


  57. Controller Synthesis with Budget Constraints. [Citation Graph (, )][DBLP]


  58. A Survey of Stochastic Games with Limsup and Liminf Objectives. [Citation Graph (, )][DBLP]


  59. Energy Parity Games. [Citation Graph (, )][DBLP]


  60. Expressiveness and Closure Properties for Quantitative Languages. [Citation Graph (, )][DBLP]


  61. Stochastic Games with Finitary Objectives. [Citation Graph (, )][DBLP]


  62. Randomness for Free. [Citation Graph (, )][DBLP]


  63. Qualitative Analysis of Partially-Observable Markov Decision Processes. [Citation Graph (, )][DBLP]


  64. Qualitative Logics and Equivalences for Probabilistic Systems. [Citation Graph (, )][DBLP]


  65. Termination criteria for solving concurrent safety and reachability games. [Citation Graph (, )][DBLP]


  66. Value Iteration. [Citation Graph (, )][DBLP]


  67. Alpaga: A Tool for Solving Parity Games with Imperfect Information. [Citation Graph (, )][DBLP]


  68. Assigning trust to Wikipedia content. [Citation Graph (, )][DBLP]


  69. Probabilistic Systems with LimSup and LimInf Objectives. [Citation Graph (, )][DBLP]


  70. The Complexity of Coverage [Citation Graph (, )][DBLP]


  71. Strategy Improvement for Concurrent Safety Games [Citation Graph (, )][DBLP]


  72. Linear Time Algorithm for Weak Parity Games [Citation Graph (, )][DBLP]


  73. Algorithms for Büchi Games [Citation Graph (, )][DBLP]


  74. Stochastic Limit-Average Games are in EXPTIME [Citation Graph (, )][DBLP]


  75. Environment Assumptions for Synthesis [Citation Graph (, )][DBLP]


  76. Timed Parity Games: Complexity and Robustness [Citation Graph (, )][DBLP]


  77. Probabilistic Systems with LimSup and LimInf Objectives [Citation Graph (, )][DBLP]


  78. Termination Criteria for Solving Concurrent Safety and Reachability Games [Citation Graph (, )][DBLP]


  79. Algorithms for Game Metrics (Full Version) [Citation Graph (, )][DBLP]


  80. Alpaga: A Tool for Solving Parity Games with Imperfect Information [Citation Graph (, )][DBLP]


  81. Qualitative Logics and Equivalences for Probabilistic Systems [Citation Graph (, )][DBLP]


  82. Better Quality in Synthesis through Quantitative Objectives [Citation Graph (, )][DBLP]


  83. Expressiveness and Closure Properties for Quantitative Languages [Citation Graph (, )][DBLP]


  84. Qualitative Analysis of Partially-observable Markov Decision Processes [Citation Graph (, )][DBLP]


  85. Probabilistic Weighted Automata [Citation Graph (, )][DBLP]


  86. Synthesis of AMBA AHB from Formal Specification [Citation Graph (, )][DBLP]


  87. Energy Parity Games [Citation Graph (, )][DBLP]


  88. Measuring and Synthesizing Systems in Probabilistic Environments [Citation Graph (, )][DBLP]


  89. GIST: A Solver for Probabilistic Games [Citation Graph (, )][DBLP]


  90. Assume-Guarantee Synthesis for Digital Contract Signing [Citation Graph (, )][DBLP]


  91. Randomness for Free [Citation Graph (, )][DBLP]


  92. Discounting in Games across Time Scales [Citation Graph (, )][DBLP]


  93. Mean-payoff Automaton Expressions [Citation Graph (, )][DBLP]


  94. Generalized Mean-payoff and Energy Games [Citation Graph (, )][DBLP]


  95. Expressiveness and Closure Properties for Quantitative Languages [Citation Graph (, )][DBLP]


Search in 0.024secs, Finished in 0.026secs
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