| Year |
Citation |
Score |
| 2025 |
Muroya S, Chatterjee K, Henzinger TA. Hardware-optimal quantum algorithms. Proceedings of the National Academy of Sciences of the United States of America. 122: e2419273122. PMID 40106357 DOI: 10.1073/pnas.2419273122 |
0.496 |
|
| 2019 |
Chatterjee K, Goharshady AK, Goyal P, Ibsen-Jensen R, Pavlogiannis A. Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth Acm Transactions On Programming Languages and Systems. 41: 1-46. DOI: 10.1145/3363525 |
0.399 |
|
| 2019 |
Chatterjee K, Fu H, Goharshady AK. Non-polynomial Worst-Case Analysis of Recursive Programs Acm Transactions On Programming Languages and Systems. 41: 20. DOI: 10.1145/3339984 |
0.349 |
|
| 2018 |
Hilbe C, Chatterjee K, Nowak MA. Partners and rivals in direct reciprocity. Nature Human Behaviour. 2: 469-477. PMID 31097794 DOI: 10.1038/S41562-018-0320-9 |
0.333 |
|
| 2018 |
Hilbe C, Šimsa Š, Chatterjee K, Nowak MA. Evolution of cooperation in stochastic games. Nature. PMID 29973718 DOI: 10.1038/S41586-018-0277-X |
0.361 |
|
| 2018 |
Reiter JG, Hilbe C, Rand DG, Chatterjee K, Nowak MA. Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness. Nature Communications. 9: 555. PMID 29416030 DOI: 10.1038/S41467-017-02721-8 |
0.379 |
|
| 2018 |
Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components Acm Transactions On Programming Languages and Systems. 40: 9. DOI: 10.1145/3210257 |
0.418 |
|
| 2018 |
Chatterjee K, Fu H, Novotný P, Hasheminezhad R. Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs Acm Transactions On Programming Languages and Systems. 40: 1-45. DOI: 10.1145/3174800 |
0.363 |
|
| 2017 |
Priklopil T, Chatterjee K, Nowak M. Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma. Journal of Theoretical Biology. PMID 28867224 DOI: 10.1016/J.Jtbi.2017.08.025 |
0.301 |
|
| 2017 |
Hilbe C, Martinez-Vaquero LA, Chatterjee K, Nowak MA. Memory-n strategies of direct reciprocity. Proceedings of the National Academy of Sciences of the United States of America. PMID 28420786 DOI: 10.1073/Pnas.1621239114 |
0.382 |
|
| 2017 |
Chatterjee K, Henzinger TA, Otop J. Nested Weighted Automata Acm Transactions On Computational Logic. 18: 1-44. DOI: 10.1145/3152769 |
0.538 |
|
| 2017 |
Chatterjee K, Velner Y. The Complexity of Mean-Payoff Pushdown Games Journal of the Acm. 64: 1-49. DOI: 10.1145/3121408 |
0.506 |
|
| 2017 |
CHATTERJEE K, PITERMAN N. OBLIGATION BLACKWELL GAMES AND P-AUTOMATA The Journal of Symbolic Logic. 82: 420-452. DOI: 10.1017/Jsl.2016.71 |
0.483 |
|
| 2017 |
Svoreňová M, Křetínský J, Chmelík M, Chatterjee K, Černá I, Belta C. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games Nonlinear Analysis: Hybrid Systems. 23: 230-253. DOI: 10.1016/J.Nahs.2016.04.006 |
0.429 |
|
| 2017 |
Chatterjee K, Velner Y. Hyperplane separation technique for multidimensional mean-payoff games Journal of Computer and System Sciences. 88: 236-259. DOI: 10.1016/J.Jcss.2017.04.005 |
0.523 |
|
| 2017 |
Brázdil T, Chatterjee K, Forejt V, Kučera A. Trading performance for stability in Markov decision processes Journal of Computer and System Sciences. 84: 144-170. DOI: 10.1016/J.Jcss.2016.09.009 |
0.391 |
|
| 2017 |
Chatterjee K, Osang G. Pushdown reachability with constant treewidth Information Processing Letters. 122: 25-29. DOI: 10.1016/J.Ipl.2017.02.003 |
0.364 |
|
| 2017 |
Chatterjee K, Doyen L, Filiot E, Raskin J. Doomsday equilibria for omega-regular games Information and Computation. 254: 296-315. DOI: 10.1016/J.Ic.2016.10.012 |
0.487 |
|
| 2017 |
Chatterjee K, Henzinger TA, Otop J, Velner Y. Quantitative fair simulation games Information and Computation. 254: 143-166. DOI: 10.1016/J.Ic.2016.10.006 |
0.596 |
|
| 2017 |
Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. Automated competitive analysis of real-time scheduling with graph games Real-Time Systems. 54: 166-207. DOI: 10.1007/S11241-017-9293-4 |
0.432 |
|
| 2016 |
Chatterjee K, Chmelík M, Tracol M. What is decidable about partially observable Markov decision processes with ω-regular objectives Journal of Computer and System Sciences. 82: 878-911. DOI: 10.1016/J.Jcss.2016.02.009 |
0.412 |
|
| 2016 |
Chatterjee K, Chmelík M, Gupta R, Kanodia A. Optimal cost almost-sure reachability in POMDPs Artificial Intelligence. 234: 26-48. DOI: 10.1016/J.Artint.2016.01.007 |
0.343 |
|
| 2015 |
Ibsen-Jensen R, Chatterjee K, Nowak MA. Computational complexity of ecological and evolutionary spatial dynamics. Proceedings of the National Academy of Sciences of the United States of America. PMID 26644569 DOI: 10.1073/Pnas.1511366112 |
0.373 |
|
| 2015 |
Reiter JG, Kanodia A, Gupta R, Nowak MA, Chatterjee K. Biological auctions with multiple rewards. Proceedings. Biological Sciences / the Royal Society. 282: 20151041. PMID 26180069 DOI: 10.1098/Rspb.2015.1041 |
0.341 |
|
| 2015 |
Priklopil T, Chatterjee K. Evolution of Decisions in Population Games with Sequentially Searching Individuals Games. 6: 413-437. DOI: 10.3390/G6040413 |
0.394 |
|
| 2015 |
Chatterjee K, Prabhu VS. Quantitative Temporal Simulation and Refinement Distances for Timed Systems Ieee Transactions On Automatic Control. 60: 2291-2306. DOI: 10.1109/Tac.2015.2404612 |
0.436 |
|
| 2015 |
Chatterjee K, Joglekar M, Shah N. Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives Theoretical Computer Science. 573: 71-89. DOI: 10.1016/J.Tcs.2015.01.050 |
0.405 |
|
| 2015 |
Bérard B, Chatterjee K, Sznajder N. Probabilistic opacity for Markov decision processes Information Processing Letters. 115: 52-59. DOI: 10.1016/J.Ipl.2014.09.001 |
0.387 |
|
| 2015 |
Chatterjee K, Doyen L, Randour M, Raskin J. Looking at mean-payoff and total-payoff through windows Information and Computation. 242: 25-52. DOI: 10.1016/J.Ic.2015.03.010 |
0.504 |
|
| 2015 |
Chatterjee K, Ibsen-Jensen R. Qualitative analysis of concurrent mean-payoff games Information & Computation. 242: 2-24. DOI: 10.1016/J.Ic.2015.03.009 |
0.526 |
|
| 2015 |
Velner Y, Chatterjee K, Doyen L, Henzinger TA, Rabinovich A, Raskin J. The complexity of multi-mean-payoff and multi-energy games Information and Computation. 241: 177-196. DOI: 10.1016/J.Ic.2015.03.001 |
0.622 |
|
| 2015 |
Chatterjee K, Chmelík M. POMDPs under probabilistic semantics Artificial Intelligence. 221: 46-72. DOI: 10.1016/J.Artint.2014.12.009 |
0.383 |
|
| 2014 |
Chatterjee K, Pavlogiannis A, Adlam B, Nowak MA. The time scale of evolutionary innovation. Plos Computational Biology. 10: e1003818. PMID 25211329 DOI: 10.1371/Journal.Pcbi.1003818 |
0.309 |
|
| 2014 |
Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. Markov Decision Processes with Multiple Long-Run AverageObjectives Logical Methods in Computer Science. 10. DOI: 10.2168/Lmcs-10(1:13)2014 |
0.408 |
|
| 2014 |
Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal specifications with accumulative values Acm Transactions On Computational Logic. 15. DOI: 10.1145/2629686 |
0.574 |
|
| 2014 |
Chatterjee K, Henzinger M. Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition Journal of the Acm. 61: 1-40. DOI: 10.1145/2597631 |
0.379 |
|
| 2014 |
Chatterjee K, Doyen L. Partial-Observation Stochastic Games Acm Transactions On Computational Logic. 15: 1-44. DOI: 10.1145/2579821 |
0.492 |
|
| 2014 |
Bloem R, Chatterjee K, Greimel K, Henzinger TA, Hofferek G, Jobstmann B, Könighofer B, Könighofer R. Synthesizing robust systems Acta Informatica. 51: 193-220. DOI: 10.1007/S00236-013-0191-5 |
0.543 |
|
| 2014 |
Chatterjee K. Qualitative concurrent parity games: Bounded rationality Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8704: 544-559. DOI: 10.1007/978-3-662-44584-6_37 |
0.374 |
|
| 2014 |
Chatterjee K. Partial-observation stochastic reachability and parity games Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8634: 1-4. DOI: 10.1007/978-3-662-44522-8_1 |
0.411 |
|
| 2013 |
Chatterjee K, de Alfaro L, Henzinger TA. Strategy improvement for concurrent reachability and turn-based stochastic safety games. Journal of Computer and System Sciences. 79: 640-657. PMID 26516289 DOI: 10.1016/J.Jcss.2012.12.001 |
0.669 |
|
| 2013 |
Zagorsky BM, Reiter JG, Chatterjee K, Nowak MA. Forgiver triumphs in alternating Prisoner's Dilemma. Plos One. 8: e80814. PMID 24349017 DOI: 10.1371/Journal.Pone.0080814 |
0.346 |
|
| 2013 |
Chatterjee K, Alfaro LD, Majumdar R. The complexity of coverage International Journal of Foundations of Computer Science. 24: 165-185. DOI: 10.1142/S0129054113400066 |
0.396 |
|
| 2013 |
Chatterjee K, Henzinger M, Krinninger S, Loitzenbauer V. Approximating the minimum cycle mean Electronic Proceedings in Theoretical Computer Science. 119: 136-149. DOI: 10.1016/J.Tcs.2014.06.031 |
0.371 |
|
| 2013 |
Chatterjee K, Prabhu VS. Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems Information and Computation. DOI: 10.1016/J.Ic.2013.04.003 |
0.391 |
|
| 2013 |
Chatterjee K, Doyen L, Henzinger TA. A survey of partial-observation stochastic parity games Formal Methods in System Design. 43: 268-284. DOI: 10.1007/s10703-012-0164-2 |
0.62 |
|
| 2013 |
Godhal Y, Chatterjee K, Henzinger TA. Synthesis of AMBA AHB from formal specification: A case study International Journal On Software Tools For Technology Transfer. 15: 585-601. DOI: 10.1007/S10009-011-0207-9 |
0.526 |
|
| 2013 |
Chatterjee K, Henzinger M, Krinninger S, Nanongkai D. Polynomial-Time Algorithms for Energy Games with Special Weight Structures Algorithmica. 70: 457-492. DOI: 10.1007/S00453-013-9843-7 |
0.425 |
|
| 2013 |
Chatterjee K, Randour M, Raskin J. Strategy synthesis for multi-dimensional quantitative objectives Acta Informatica. 51: 129-163. DOI: 10.1007/S00236-013-0182-6 |
0.445 |
|
| 2013 |
Chatterjee K, Raman V. Assume-guarantee synthesis for digital contract signing Formal Aspects of Computing. 26: 825-859. DOI: 10.1007/S00165-013-0283-6 |
0.322 |
|
| 2012 |
Chatterjee K, Doyen L. Energy parity games. Theoretical Computer Science. 458: 49-60. PMID 23470985 DOI: 10.1016/J.Tcs.2012.07.038 |
0.451 |
|
| 2012 |
Chatterjee K, Zufferey D, Nowak MA. Evolutionary game dynamics in populations with different learners. Journal of Theoretical Biology. 301: 161-73. PMID 22394652 DOI: 10.1016/J.Jtbi.2012.02.021 |
0.353 |
|
| 2012 |
Chatterjee K, Reiter JG, Nowak MA. Evolutionary dynamics of biological auctions. Theoretical Population Biology. 81: 69-80. PMID 22120126 DOI: 10.1016/J.Tpb.2011.11.003 |
0.303 |
|
| 2012 |
Chatterjee K, Henzinger TA, Prabhu VS. Finite automata with time-delay blocks Emsoft'12 - Proceedings of the 10th Acm International Conference On Embedded Software 2012, Co-Located With Esweek. 43-52. DOI: 10.1145/2380356.2380370 |
0.498 |
|
| 2012 |
Chatterjee K, Majumdar R. Discounting and averaging in games across time scales International Journal of Foundations of Computer Science. 23: 609-625. DOI: 10.1142/S0129054112400308 |
0.49 |
|
| 2012 |
Chatterjee K, Henzinger TA. A survey of stochastic ω-regular games Journal of Computer and System Sciences. 78: 394-413. DOI: 10.1016/J.Jcss.2011.05.002 |
0.642 |
|
| 2012 |
Chatterjee K. The complexity of stochastic Müller games Information and Computation. 211: 29-48. DOI: 10.1016/J.Ic.2011.11.004 |
0.489 |
|
| 2012 |
Chatterjee K, Henzinger M, Krinninger S, Nanongkai D. Polynomial-time algorithms for energy games with special weight structures Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7501: 301-312. DOI: 10.1007/978-3-642-33090-2_27 |
0.327 |
|
| 2012 |
Chatterjee K. Robustness of structurally equivalent concurrent parity games Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7213: 270-285. DOI: 10.1007/978-3-642-28729-9_18 |
0.402 |
|
| 2011 |
Chatterjee K, Fijalkow N. A reduction from parity games to simple stochastic games Electronic Proceedings in Theoretical Computer Science. 54: 74-86. DOI: 10.4204/EPTCS.54.6 |
0.329 |
|
| 2011 |
Chatterjee K, Henzinger T, Prabhu V. Timed Parity Games: Complexity and Robustness Logical Methods in Computer Science. 7. DOI: 10.2168/Lmcs-7(4:8)2011 |
0.662 |
|
| 2011 |
Chatterjee K, Alfaro LD, Henzinger TA. Qualitative concurrent parity games Acm Transactions On Computational Logic. 12: 1-51. DOI: 10.1145/1970398.1970404 |
0.656 |
|
| 2011 |
Chatterjee K, Henzinger TA, Jobstmann B, Singh R. QUASY: Quantitative synthesis tool Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6605: 267-271. DOI: 10.1007/978-3-642-19835-9_24 |
0.612 |
|
| 2010 |
Chatterjee K, Doyen L, Henzinger TA, Raskin JF. Generalized mean-payoff and energy games Leibniz International Proceedings in Informatics, Lipics. 8: 505-516. DOI: 10.4230/LIPIcs.FSTTCS.2010.505 |
0.602 |
|
| 2010 |
Chatterjee K, Majumdar R. Discounting in Games across Time Scales Electronic Proceedings in Theoretical Computer Science. 25: 22-29. DOI: 10.4204/Eptcs.25.6 |
0.49 |
|
| 2010 |
Chatterjee K, de Alfaro L, Majumdar R, Raman V. Algorithms for game metrics Logical Methods in Computer Science. 6: 1-27. DOI: 10.2168/Lmcs-6(3:13)2010 |
0.418 |
|
| 2010 |
Chatterjee K, Henzinger TA, Jobstmann B, Singh R. Measuring and synthesizing systems in probabilistic environments Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6174: 380-395. DOI: 10.1145/2699430 |
0.623 |
|
| 2010 |
Chatterjee K, Doyen L, Gimbert H, Henzinger TA. Randomness for free Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6281: 246-257. DOI: 10.1016/J.Ic.2015.06.003 |
0.623 |
|
| 2010 |
Berwanger D, Chatterjee K, De Wulf M, Doyen L, Henzinger TA. Strategy construction for parity games with imperfect information Information and Computation. 208: 1206-1220. DOI: 10.1016/J.Ic.2009.09.006 |
0.642 |
|
| 2010 |
Chatterjee K, Henzinger TA, Piterman N. Strategy logic Information and Computation. 208: 677-693. DOI: 10.1016/J.Ic.2009.07.004 |
0.646 |
|
| 2010 |
Chatterjee K, Henzinger TA. Probabilistic automata on infinite words: Decidability and undecidability results Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6252: 1-16. DOI: 10.1007/978-3-642-15643-4_1 |
0.52 |
|
| 2010 |
Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. Mean-Payoff Automaton Expressions Lecture Notes in Computer Science. 6269: 269. DOI: 10.1007/978-3-642-15375-4_19 |
0.477 |
|
| 2010 |
Chatterjee K, Doyen L, Henzinger TA. Qualitative analysis of partially-observable Markov decision processes Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6281: 258-269. DOI: 10.1007/978-3-642-15155-2_24 |
0.575 |
|
| 2010 |
Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. Gist: A solver for probabilistic games Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6174: 665-669. DOI: 10.1007/978-3-642-14295-6_57 |
0.592 |
|
| 2009 |
Chatterjee K, Doyen L, Henzinger TA. Expressiveness and closure properties for quantitative languages Proceedings - Symposium On Logic in Computer Science. 199-208. DOI: 10.2168/Lmcs-6(3:10)2010 |
0.522 |
|
| 2009 |
de Alfaro L, Chatterjee K, Faella M, Legay A. Qualitative Logics and Equivalences for Probabilistic Systems Logical Methods in Computer Science. 5. DOI: 10.2168/Lmcs-5(2:7)2009 |
0.417 |
|
| 2009 |
Chatterjee K, Henzinger TA, Horn F. Finitary winning in ω-regular games Acm Transactions On Computational Logic. 11: 1-27. DOI: 10.1145/1614431.1614432 |
0.324 |
|
| 2009 |
Chatterjee K, Doyen L, Henzinger TA. Probabilistic weighted automata Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5710: 244-258. DOI: 10.1007/978-3-642-04081-8_17 |
0.513 |
|
| 2009 |
Chatterjee K, Henzinger TA, Horn F. Stochastic Games with Finitary Objectives Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5734: 34-54. DOI: 10.1007/978-3-642-03816-7_4 |
0.654 |
|
| 2009 |
Chatterjee K, Doyen L, Henzinger TA. Alternating weighted automata Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5699: 3-13. DOI: 10.1007/978-3-642-03409-1_2 |
0.497 |
|
| 2009 |
Chatterjee K, Henzinger TA. Probabilistic systems with limsup and liminf objectives Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5489: 32-45. DOI: 10.1007/978-3-642-03092-5_4 |
0.576 |
|
| 2009 |
Chatterjee K, Doyen L, Henzinger TA. A survey of stochastic games with limsup and liminf objectives Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5556: 1-15. DOI: 10.1007/978-3-642-02930-1_1 |
0.625 |
|
| 2009 |
Bloem R, Chatterjee K, Henzinger TA, Jobstmann B. Better quality in synthesis through quantitative objectives Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5643: 140-156. DOI: 10.1007/978-3-642-02658-4_14 |
0.445 |
|
| 2008 |
Chatterjee K, Henzinger TA. Reduction of stochastic parity to stochastic mean-payoff games Information Processing Letters. 106: 1-7. DOI: 10.1016/J.Ipl.2007.08.035 |
0.655 |
|
| 2008 |
Chatterjee K, Majumdar R, Henzinger TA. Stochastic limit-average games are in EXPTIME International Journal of Game Theory. 37: 219-234. DOI: 10.1007/S00182-007-0110-5 |
0.643 |
|
| 2008 |
Chatterjee K, Doyen L, Henzinger TA. Quantitative languages Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5213: 385-400. DOI: 10.1007/978-3-540-87531-428 |
0.511 |
|
| 2008 |
Chatterjee K, Henzinger TA, Jobstmann B. Environment assumptions for synthesis Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5201: 147-161. DOI: 10.1007/978-3-540-85361-9_14 |
0.59 |
|
| 2008 |
Chatterjee K, Majumdar R, Henzinger TA. Controller synthesis with budget constraints Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4981: 72-86. DOI: 10.1007/978-3-540-78929-1-6 |
0.565 |
|
| 2008 |
Chatterjee K, Sen K, Henzinger TA. Model-checking ω-regular properties of interval Markov chains Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4962: 302-317. DOI: 10.1007/978-3-540-78499-9_22 |
0.533 |
|
| 2008 |
Chatterjee K, Henzinger TA. Value iteration Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5000: 107-138. DOI: 10.1007/978-3-540-69850-0_7 |
0.58 |
|
| 2007 |
Chatterjee K. Concurrent games with tail objectives Theoretical Computer Science. 388: 181-198. DOI: 10.1016/J.Tcs.2007.07.047 |
0.462 |
|
| 2007 |
Chatterjee K, Henzinger TA. Assume-guarantee synthesis Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4424: 261-278. |
0.467 |
|
| 2006 |
Chatterjee K, Doyen L, Henzinger TA, Raskin JE. Algorithms for omega-regular games with imperfect information Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4207: 287-302. DOI: 10.2168/Lmcs-3(3:4)2007 |
0.657 |
|
| 2006 |
Chatterjee K, Henzinger TA. Finitary winning in ω-regular games Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3920: 257-271. DOI: 10.1145/1614431.1614432 |
0.671 |
|
| 2006 |
Chatterjee K, De Alfaro L, Henzinger TA. The complexity of quantitative concurrent parity games Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 678-687. DOI: 10.1145/1109557.1109631 |
0.63 |
|
| 2006 |
Chatterjee K, De Alfaro L, Henzinger TA. Strategy improvement for concurrent reachability games Third International Conference On the Quantitative Evaluation of Systems, Qest 2006. 291-300. DOI: 10.1109/QEST.2006.37 |
0.633 |
|
| 2006 |
Chatterjee K, Henzinger TA, Jurdziński M. Games with secure equilibria Theoretical Computer Science. 365: 67-82. DOI: 10.1016/j.tcs.2006.07.032 |
0.596 |
|
| 2006 |
Chatterjee K, Henzinger TA. Strategy improvement and randomized subexponential algorithms for stochastic parity games Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3884: 512-523. DOI: 10.1007/11672142_42 |
0.613 |
|
| 2006 |
Chatterjee K, Henzinger TA. Strategy improvement for stochastic Rabin and Streett games Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4137: 375-389. |
0.651 |
|
| 2005 |
Chakrabarti A, Chatterjee K, Henzinger TA, Kupferman O, Majumdar R. Verifying quantitative properties using bound functions Lecture Notes in Computer Science. 50-64. DOI: 10.1007/11560548_7 |
0.615 |
|
| 2005 |
Chatterjee K, Henzinger TA. Semiperfect-information games Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3821: 1-18. |
0.512 |
|
| 2004 |
Chatterjee K, Dasgupta P, Chakrabarti PP. The power of first-order quantification over states in branching and linear time temporal logics Information Processing Letters. 91: 201-210. DOI: 10.1016/J.Ipl.2004.05.003 |
0.317 |
|
| 2004 |
Chatterjee K, Ma D, Majumdar R, Zhao T, Henzinger TA, Palsberg J. Stack size analysis for interrupt-driven programs Information and Computation. 194: 144-174. DOI: 10.1016/J.Ic.2004.06.001 |
0.521 |
|
| 2003 |
Chatterjee K. Journal of Automated Reasoning. 30: 205-232. DOI: 10.1023/A:1023217515688 |
0.349 |
|
| 2003 |
Chatterjee K, Jurdziński M, Henzinger TA. Simple stochastic parity games Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2803: 100-113. |
0.634 |
|
| Show low-probability matches. |