342 Publications

Mark all

[342]
2019 | Conference Paper | IST-REx-ID: 6490
Chatterjee K, Goharshady AK, Goharshady EK. The treewidth of smart contracts. Proceedings of the 34th ACM Symposium on Applied Computing. SAC: Symposium on Applied Computing vol. Part F147772. 400–408.
View | DOI
 
[341]
2019 | Conference Paper | IST-REx-ID: 5948
Fu H, Chatterjee K. 2019. Termination of nondeterministic probabilistic programs (eds. C. Enea & R. Piskac). 11388, 468–490.
View | DOI
 
[340]
2019 | Conference Paper | IST-REx-ID: 6175   OA
Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. Cost analysis of nondeterministic probabilistic programs. 40th ACM Conference on Programming Language Design and Implementation (PLDI 2019). 40th ACM Conference on Programming Language Design and Implementation
View | Files available | arXiv
 
[339]
2019 | Conference Paper | IST-REx-ID: 6056   OA
Chatterjee K, Goharshady AK, Pourdamghani A. Probabilistic smart contracts: Secure randomness on the blockchain. IEEE International Conference on Blockchain and Cryptocurrency. IEEE International Conference on Blockchain and Cryptocurrency
View | Files available | Download (ext.) | arXiv
 
[338]
2019 | Journal Article | IST-REx-ID: 6380   OA
Chatterjee K, Goharshady AK, Okati N, Pavlogiannis A. 2019. Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages. 3(POPL), 53.
View | Files available | DOI
 
[337]
2019 | Conference Paper | IST-REx-ID: 6378   OA
Chatterjee K, Goharshady AK, Pourdamghani A. Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. Proceedings of the 34th ACM Symposium on Applied Computing. ACM Symposium on Applied Computing vol. Part F147772. 374–381.
View | Files available | DOI
 
[336]
2019 | Conference Paper | IST-REx-ID: 6462   OA
Avni G, Bloem R, Chatterjee K, Henzinger TA, Konighofer B, Pranger S. 2019. Run-time optimization for learned controllers through quantitative games. 31st International Conference on Computer-Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 11561. 630–649.
View | Files available | DOI
 
[335]
2019 | Conference Paper | IST-REx-ID: 6780   OA
Huang M, Fu H, Chatterjee K, Goharshady AK. Modular verification for almost-sure termination of probabilistic programs. Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications . OOPSLA: Object-oriented Programming, Systems, Languages and Applications
View | Files available | Download (ext.) | arXiv
 
[334]
2018 | Conference Paper | IST-REx-ID: 143   OA
Brázdil T, Chatterjee K, Kučera A, Novotny P, Velan D, Zuleger F. 2018. Efficient algorithms for asymptotic bounds on termination time in VASS. LICS: Logic in Computer Science, ACM/IEEE Symposium on Logic in Computer Science, vol. F138033. 185–194.
View | DOI | Download (ext.)
 
[333]
2018 | Journal Article | IST-REx-ID: 198   OA
Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. 2018. Language acquisition with communication between learners. Journal of the Royal Society Interface. 15(140).
View | Files available | DOI
 
[332]
2018 | Conference Paper | IST-REx-ID: 35   OA
Chatterjee K, Dvorák W, Henzinger M, Svozil A. 2018. Algorithms and conditional lower bounds for planning problems. 28th International Conference on Automated Planning and Scheduling . ICAPS: International Conference on Automated Planning and Scheduling
View | Download (ext.) | arXiv
 
[331]
2018 | Book Chapter | IST-REx-ID: 59
Bloem R, Chatterjee K, Jobstmann B. 2018. Graph games and reactive synthesis. Handbook of Modeling Checking. 921–962.
View | DOI
 
[330]
2018 | Conference Paper | IST-REx-ID: 66   OA
Chatterjee K, Goharshady A, Ibsen-Jensen R, Velner Y. 2018. Ergodic mean-payoff games for the analysis of attacks in crypto-currencies. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 118. 11.
View | Files available | DOI | Download (ext.) | arXiv
 
[329]
2018 | Conference Paper | IST-REx-ID: 24   OA
Chatterjee K, Elgyütt A, Novotny P, Rouillé O. 2018. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018. 4692–4699.
View | DOI | Download (ext.) | arXiv
 
[328]
2018 | Conference Paper | IST-REx-ID: 310   OA
Chatterjee K, Dvorák W, Henzinger M, Loitzenbauer V. 2018. Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety and diameter. SODA: Symposium on Discrete Algorithms, SODA, 2341–2356.
View | DOI | Download (ext.) | arXiv
 
[327]
2018 | Journal Article | IST-REx-ID: 6009   OA
Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. 2018. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. ACM Transactions on Programming Languages and Systems. 40(3), 9.
View | Files available | DOI | Download (ext.) | arXiv
 
[326]
2018 | Journal Article | IST-REx-ID: 5993   OA
Chatterjee K, Fu H, Novotný P, Hasheminezhad R. 2018. Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs. ACM Transactions on Programming Languages and Systems. 40(2), 7.
View | Files available | DOI | Download (ext.) | arXiv
 
[325]
2018 | Conference Paper | IST-REx-ID: 6340   OA
Goharshady AK, Behrouz A, Chatterjee K. 2018. Secure Credit Reporting on the Blockchain. Proceedings of the IEEE International Conference on Blockchain. IEEE International Conference on Blockchain 1343–1348.
View | Files available | arXiv
 
[324]
2018 | Conference Paper | IST-REx-ID: 79   OA
Arming S, Bartocci E, Chatterjee K, Katoen JP, Sokolova A. 2018. Parameter-independent strategies for pMDPs via POMDPs. QEST: Quantitative Evaluation of Systems, LNCS, vol. 11024. 53–70.
View | DOI | Download (ext.) | arXiv
 
[323]
2018 | Journal Article | IST-REx-ID: 738   OA
Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. 2018. Automated competitive analysis of real time scheduling with graph games. Real-Time Systems. 54(1), 166–207.
View | Files available | DOI
 
[322]
2018 | Book Chapter | IST-REx-ID: 86
Chatterjee K, Henzinger TA, Otop J. 2018. Computing average response time. Principles of Modeling. , LNCS, vol. 10760. 143–161.
View | DOI
 
[321]
2018 | Journal Article | IST-REx-ID: 454   OA
Reiter J, Hilbe C, Rand D, Chatterjee K, Nowak M. 2018. Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness. Nature Communications. 9(1), 555.
View | Files available | DOI
 
[320]
2018 | Journal Article | IST-REx-ID: 157
Hilbe C, Šimsa Š, Chatterjee K, Nowak M. 2018. Evolution of cooperation in stochastic games. Nature. 559(7713), 246–249.
View | Files available | DOI
 
[319]
2018 | Conference Paper | IST-REx-ID: 25
Horák K, Bošanský B, Chatterjee K. 2018. Goal-HSVI: Heuristic search value iteration for goal-POMDPs. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018–July. 4764–4770.
View | DOI
 
[318]
2018 | Conference Paper | IST-REx-ID: 311   OA
Chatterjee K, Goharshady A, Velner Y. 2018. Quantitative analysis of smart contracts. ESOP: European Symposium on Programming, LNCS., vol. 10801. 739–767.
View | Files available | DOI
 
[317]
2018 | Conference Paper | IST-REx-ID: 141   OA
Chatterjee K, Henzinger M, Loitzenbauer V, Oraee S, Toman V. 2018. Symbolic algorithms for graphs and Markov decision processes with fairness objectives. CAV: Computer Aided Verification, LNCS, vol. 10982. 178–197.
View | Files available | DOI
 
[316]
2018 | Journal Article | IST-REx-ID: 2   OA
Hilbe C, Schmid L, Tkadlec J, Chatterjee K, Nowak M. 2018. Indirect reciprocity with private noisy and incomplete information. PNAS. 115(48), 12241–12246.
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 
[315]
2018 | Conference Paper | IST-REx-ID: 297   OA
Brázdil T, Chatterjee K, Kretinsky J, Toman V. 2018. Strategy representation by decision trees in reactive synthesis. TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 10805. 385–407.
View | Files available | DOI
 
[314]
2018 | Conference Paper | IST-REx-ID: 325   OA
Agrawal S, Chatterjee K, Novotny P. 2018. Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. POPL: Principles of Programming Languages vol. 2.
View | DOI | Download (ext.) | arXiv
 
[313]
2018 | Conference Paper | IST-REx-ID: 34   OA
Chatterjee K, Chemlík M, Topcu U. 2018. Sensor synthesis for POMDPs with reachability objectives. ICAPS: International Conference on Automated Planning and Scheduling, ICAPS, vol. 2018. 47–55.
View | Download (ext.) | arXiv
 
[312]
2018 | Journal Article | IST-REx-ID: 419
Hilbe C, Chatterjee K, Nowak M. 2018. Partners and rivals in direct reciprocity. Nature Human Behaviour. 2, 469–477.
View | Files available | DOI
 
[311]
2018 | Conference Paper | IST-REx-ID: 5679   OA
Huang M, Fu H, Chatterjee K. 2018. New approaches for almost-sure termination of probabilistic programs. 16th Asian Symposium on Programming Languages and Systems, APLAS, LNCS, vol. 11275. 181–201.
View | DOI | Download (ext.) | arXiv
 
[310]
2018 | Preprint | IST-REx-ID: 5977   OA
Chatterjee K, Fu H, Goharshady A, Okati N. Computational Approaches for Stochastic Shortest Path on Succinct MDPs. ArXiv.
View | Download (ext.) | arXiv
 
[309]
2018 | Journal Article | IST-REx-ID: 5751   OA
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak MA. 2018. Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory. Communications Biology. 1(1), 71.
View | Files available | DOI
 
[308]
2017 | Journal Article | IST-REx-ID: 1065
Chatterjee K, Osang GF. 2017. Pushdown reachability with constant treewidth. Information Processing Letters. 122, 25–29.
View | Files available | DOI
 
[307]
2017 | Journal Article | IST-REx-ID: 1407
Svoreňová M, Kretinsky J, Chmelik M, Chatterjee K, Cěrná I, Belta C. 2017. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Nonlinear Analysis: Hybrid Systems. 23(2), 230–253.
View | Files available | DOI | Download (ext.)
 
[306]
2017 | Journal Article | IST-REx-ID: 465
Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2017. Edit distance for pushdown automata. Logical Methods in Computer Science. 13(3).
View | Files available | DOI
 
[305]
2017 | Journal Article | IST-REx-ID: 681   OA
Chatterjee K, Doyen L, Filiot E, Raskin J. 2017. Doomsday equilibria for omega-regular games. Information and Computation. 254, 296–315.
View | DOI | Download (ext.)
 
[304]
2017 | Journal Article | IST-REx-ID: 744
Priklopil T, Chatterjee K, Nowak M. 2017. Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma. Journal of Theoretical Biology. 433, 64–72.
View | DOI
 
[303]
2017 | Conference Paper | IST-REx-ID: 1009   OA
Chatterjee K, Novotny P, Pérez G, Raskin J, Zikelic D. 2017. Optimizing expectation with guarantees in POMDPs. Proceedings of the 31st AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 5. 3725–3732.
View | Download (ext.)
 
[302]
2017 | Conference Paper | IST-REx-ID: 1011   OA
Chatterjee K, Kragl B, Mishra S, Pavlogiannis A. 2017. Faster algorithms for weighted recursive state machines. ESOP: European Symposium on Programming, LNCS, vol. 10201. 287–313.
View | DOI | Download (ext.)
 
[301]
2017 | Journal Article | IST-REx-ID: 1080   OA
Reiter J, Makohon Moore A, Gerold J, Božić I, Chatterjee K, Iacobuzio Donahue C, Vogelstein B, Nowak M. 2017. Reconstructing metastatic seeding patterns of human cancers. Nature Communications. 8.
View | Files available | DOI
 
[300]
2017 | Journal Article | IST-REx-ID: 1294
Brázdil T, Chatterjee K, Forejt V, Kučera A. 2017. Trading performance for stability in Markov decision processes. Journal of Computer and System Sciences. 84, 144–170.
View | Files available | DOI
 
[299]
2017 | Journal Article | IST-REx-ID: 466
Chatterjee K, Křetínská Z, Kretinsky J. 2017. Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. 13(2), 15.
View | Files available | DOI
 
[298]
2017 | Journal Article | IST-REx-ID: 1066
Chatterjee K, Henzinger TA, Otop J, Velner Y. 2017. Quantitative fair simulation games. Information and Computation. 254(2), 143–166.
View | Files available | DOI
 
[297]
2017 | Journal Article | IST-REx-ID: 512
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2017. Amplification on undirected population structures: Comets beat stars. Scientific Reports. 7(1).
View | Files available | DOI
 
[296]
2017 | Technical Report | IST-REx-ID: 5455   OA
Chatterjee K, Choudhary B, Pavlogiannis A. 2017. Optimal Dyck reachability for data-dependence and alias analysis, IST Austria, 37p.
View | Files available | DOI
 
[295]
2017 | Book Chapter | IST-REx-ID: 625
Chatterjee K, Doyen L, Henzinger TA. 2017. The cost of exactness in quantitative reachability. Models, Algorithms, Logics and Tools. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), LNCS, vol. 10460. 367–381.
View | DOI
 
[294]
2017 | Journal Article | IST-REx-ID: 719
Chatterjee K, Ehlers R. 2017. Special issue: Synthesis and SYNT 2014. Acta Informatica. 54(6), 543–544.
View | DOI
 
[293]
2017 | Conference Paper | IST-REx-ID: 1194   OA
Chatterjee K, Novotny P, Zikelic D. 2017. Stochastic invariants for probabilistic termination. POPL: Principles of Programming Languages, ACM SIGPLAN Notices, vol. 52. 145–160.
View | DOI | Download (ext.)
 
[292]
2017 | Journal Article | IST-REx-ID: 467
Chatterjee K, Henzinger TA, Otop J. 2017. Nested weighted automata. ACM Transactions on Computational Logic (TOCL). 18(4), 31.
View | Files available | DOI | Download (ext.) | arXiv
 
[291]
2017 | Technical Report | IST-REx-ID: 5456   OA
Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. 2017. Data-centric dynamic partial order reduction, IST Austria, 36p.
View | Files available | DOI
 
[290]
2017 | Conference Paper | IST-REx-ID: 551   OA
Chatterjee K, Ibsen-Jensen R, Nowak M. 2017. Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83.
View | Files available | DOI
 
[289]
2017 | Conference Paper | IST-REx-ID: 645   OA
Ashok P, Chatterjee K, Daca P, Kretinsky J, Meggendorfer T. 2017. Value iteration for long run average reward in markov decision processes. CAV: Computer Aided Verification, LNCS, vol. 10426. 201–221.
View | DOI | Download (ext.)
 
[288]
2017 | Journal Article | IST-REx-ID: 671   OA
Hilbe C, Martinez V, Chatterjee K, Nowak M. 2017. Memory-n strategies of direct reciprocity. PNAS. 114(18), 4715–4720.
View | DOI | Download (ext.) | PubMed | Europe PMC
 
[287]
2017 | Conference Paper | IST-REx-ID: 552   OA
Chatterjee K, Henzinger M, Svozil A. 2017. Faster algorithms for mean payoff parity games. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83.
View | Files available | DOI
 
[286]
2017 | Conference Paper | IST-REx-ID: 639   OA
Chatterjee K, Fu H, Goharshady A. 2017. Non-polynomial worst case analysis of recursive programs. CAV: Computer Aided Verification, LNCS, vol. 10427. 41–63.
View | DOI | Download (ext.)
 
[285]
2017 | Journal Article | IST-REx-ID: 653
Makohon Moore A, Zhang M, Reiter J, Božić I, Allen B, Kundu D, Chatterjee K, Wong F, Jiao Y, Kohutek Z, Hong J, Attiyeh M, Javier B, Wood L, Hruban R, Nowak M, Papadopoulos N, Kinzler K, Vogelstein B, Iacobuzio Donahue C. 2017. Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. Nature Genetics. 49(3), 358–366.
View | DOI
 
[284]
2017 | Journal Article | IST-REx-ID: 684   OA
Chatterjee K, Piterman N. 2017. Obligation blackwell games and p-automata. Journal of Symbolic Logic. 82(2), 420–452.
View | DOI | Download (ext.)
 
[283]
2017 | Conference Paper | IST-REx-ID: 711   OA
Chatterjee K, Henzinger TA, Otop J. 2017. Bidirectional nested weighted automata. 28th International Conference on Concurrency Theory, CONCUR, LIPIcs, vol. 85.
View | Files available | DOI
 
[282]
2017 | Journal Article | IST-REx-ID: 716
Chatterjee K, Velner Y. 2017. The complexity of mean-payoff pushdown games. Journal of the ACM. 64(5), 34.
View | DOI
 
[281]
2017 | Conference Paper | IST-REx-ID: 949   OA
Chatterjee K, Goharshady A, Pavlogiannis A. 2017. JTDec: A tool for tree decompositions in soot. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 10482. 59–66.
View | Files available | DOI
 
[280]
2017 | Journal Article | IST-REx-ID: 464   OA
Chatterjee K, Henzinger M, Loitzenbauer V. 2017. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 13(3).
View | Files available | DOI
 
[279]
2017 | Conference Paper | IST-REx-ID: 553   OA
Chatterjee K, Hansen K, Ibsen-Jensen R. 2017. Strategy complexity of concurrent safety games. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83.
View | Files available | DOI | Download (ext.)
 
[278]
2017 | Conference Paper | IST-REx-ID: 628   OA
Chatterjee K, Fu H, Murhekar A. 2017. Automated recurrence analysis for almost linear expected runtime bounds. CAV: Computer Aided Verification, LNCS, vol. 10426. 118–139.
View | DOI | Download (ext.)
 
[277]
2017 | Conference Paper | IST-REx-ID: 6519   OA
Chatterjee K, Dvorák W, Henzinger M, Loitzenbauer V. 2017. Improved set-based symbolic algorithms for parity games. CSL: Conference on Computer Science Logic vol. 82. 18.
View | Files available | DOI
 
[276]
2017 | Journal Article | IST-REx-ID: 717   OA
Chatterjee K, Velner Y. 2017. Hyperplane separation technique for multidimensional mean-payoff games. Journal of Computer and System Sciences. 88, 236–259.
View | Files available | DOI | Download (ext.)
 
[275]
2017 | Research Data | IST-REx-ID: 5559
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2017. Strong amplifiers of natural selection, IST Austria,p.
View | Files available | DOI
 
[274]
2016 | Conference Paper | IST-REx-ID: 1166
Chatterjee K, Chmelik M, Davies J. 2016. A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps. Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 2016. 3225–3232.
View | Files available
 
[273]
2016 | Conference Paper | IST-REx-ID: 1438
Chatterjee K, Fu H, Novotny P, Hasheminezhad R. 2016. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. POPL: Principles of Programming Languages, POPL, vol. 20–22. 327–342.
View | Files available | DOI | Download (ext.) | arXiv
 
[272]
2016 | Conference Paper | IST-REx-ID: 478   OA
Chatterjee K, Ibsen-Jensen R. 2016. The complexity of deciding legality of a single step of magic: The gathering. ECAI: European Conference on Artificial Intelligence, Frontiers in Artificial Intelligence and Applications, vol. 285. 1432–1439.
View | Files available | DOI
 
[271]
2016 | Conference Paper | IST-REx-ID: 480   OA
Chatterjee K, Doyen L. 2016. Perfect-information stochastic games with generalized mean-payoff objectives. LICS: Logic in Computer Science, Proceedings Symposium on Logic in Computer Science, vol. 05-08-July-2016. 247–256.
View | DOI | Download (ext.)
 
[270]
2016 | Journal Article | IST-REx-ID: 1477
Chatterjee K, Chmelik M, Tracol M. 2016. What is decidable about partially observable Markov decision processes with ω-regular objectives. Journal of Computer and System Sciences. 82(5), 878–911.
View | Files available | DOI | Download (ext.) | arXiv
 
[269]
2016 | Conference Paper | IST-REx-ID: 1182   OA
Chatterjee K, Ibsen-Jensen R, Tkadlec J. 2016. Robust draws in balanced knockout tournaments. IJCAI: International Joint Conference on Artificial Intelligence vol. 2016–January. 172–179.
View | Files available | Download (ext.)
 
[268]
2016 | Conference Paper | IST-REx-ID: 1245
Pandey V, Chatterjee K. 2016. Game-theoretic models identify useful principles for peer collaboration in online learning platforms. Proceedings of the ACM Conference on Computer Supported Cooperative Work. CSCW: Computer Supported Cooperative Work and Social Computing vol. 26. 365–368.
View | DOI
 
[267]
2016 | Conference Paper | IST-REx-ID: 1327   OA
Brázdil T, Chatterjee K, Chmelik M, Gupta A, Novotny P. 2016. Stochastic shortest path with energy constraints in POMDPs. Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems. AAMAS: Autonomous Agents & Multiagent Systems 1465–1466.
View | Download (ext.)
 
[266]
2016 | Journal Article | IST-REx-ID: 1529
Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2016. Optimal cost almost-sure reachability in POMDPs. Artificial Intelligence. 234, 26–48.
View | Files available | DOI | Download (ext.) | arXiv
 
[265]
2016 | Technical Report | IST-REx-ID: 5449   OA
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Amplification on undirected population structures: Comets beat stars, IST Austria, 22p.
View | Files available | DOI
 
[264]
2016 | Technical Report | IST-REx-ID: 5451   OA
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Strong amplifiers of natural selection, IST Austria, 34p.
View | Files available | DOI
 
[263]
2016 | Conference Paper | IST-REx-ID: 1068   OA
Chatterjee K, Dvorák W, Henzinger M, Loitzenbauer V. 2016. Conditionally optimal algorithms for generalized Büchi Games. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 58.
View | Files available | DOI
 
[262]
2016 | Conference Paper | IST-REx-ID: 1070   OA
Chatterjee K, Doyen L. 2016. Computation tree logic for synchronization properties. ICALP: Automata, Languages and Programming, LIPIcs, vol. 55.
View | Files available | DOI
 
[261]
2016 | Conference Paper | IST-REx-ID: 1138   OA
Chatterjee K, Henzinger TA, Otop J. 2016. Quantitative automata under probabilistic semantics. Proceedings of the 31st Annual ACM/IEEE Symposium. LICS: Logic in Computer Science 76–85.
View | DOI | Download (ext.)
 
[260]
2016 | Conference Paper | IST-REx-ID: 1140   OA
Chatterjee K, Dvoák W, Henzinger M, Loitzenbauer V. 2016. Model and objective separation with conditional lower bounds disjunction is harder than conjunction. Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, Proceedings Symposium on Logic in Computer Science, 197–206.
View | DOI | Download (ext.)
 
[259]
2016 | Conference Paper | IST-REx-ID: 1335   OA
Chatterjee K, Henzinger TA, Otop J. 2016. Quantitative monitor automata. SAS: Static Analysis Symposium, LNCS, vol. 9837. 23–38.
View | DOI | Download (ext.)
 
[258]
2016 | Technical Report | IST-REx-ID: 5445   OA
Chatterjee K, Pavlogiannis A, Velner Y. 2016. Quantitative interprocedural analysis, IST Austria, 33p.
View | Files available | DOI
 
[257]
2016 | Technical Report | IST-REx-ID: 5452
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Arbitrarily strong amplifiers of natural selection, IST Austria, 32p.
View | Files available | DOI
 
[256]
2016 | Conference Paper | IST-REx-ID: 1090   OA
Chatterjee K, Henzinger TA, Otop J. 2016. Nested weighted limit-average automata of bounded width. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 58.
View | Files available | DOI
 
[255]
2016 | Conference Paper | IST-REx-ID: 1324
Chatterjee K, Chmelik M. 2016. Indefinite-horizon reachability in Goal-DEC-POMDPs. Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling. ICAPS: International Conference on Automated Planning and Scheduling vol. 2016–January. 88–96.
View | Download (ext.)
 
[254]
2016 | Conference Paper | IST-REx-ID: 1386   OA
Chatterjee K, Fu H, Goharshady A. 2016. Termination analysis of probabilistic programs through Positivstellensatz’s. CAV: Computer Aided Verification, LNCS, vol. 9779. 3–22.
View | DOI | Download (ext.)
 
[253]
2016 | Technical Report | IST-REx-ID: 5453   OA
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Arbitrarily strong amplifiers of natural selection, IST Austria, 34p.
View | Files available | DOI
 
[252]
2016 | Conference Paper | IST-REx-ID: 1071
Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2016. Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs. ESA: European Symposium on Algorithms, LIPIcs, vol. 57.
View | Files available | DOI
 
[251]
2016 | Conference Paper | IST-REx-ID: 1437
Chatterjee K, Goharshady A, Ibsen-Jensen R, Pavlogiannis A. 2016. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. POPL: Principles of Programming Languages, POPL, vol. 20–22. 733–747.
View | Files available | DOI | Download (ext.) | arXiv
 
[250]
2015 | Conference Paper | IST-REx-ID: 1609   OA
Chatterjee K, Doyen L, Vardi M. 2015. The complexity of synthesis from probabilistic components. 9135, 108–120.
View | DOI | Download (ext.)
 
[249]
2015 | Journal Article | IST-REx-ID: 1673   OA
Adlam B, Chatterjee K, Nowak M. 2015. Amplifiers of selection. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 471(2181), 20150114.
View | Files available | DOI
 
[248]
2015 | Conference Paper | IST-REx-ID: 1820   OA
Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2015. Optimal cost almost-sure reachability in POMDPs. Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence . IAAI: Innovative Applications of Artificial Intelligence, Artifical Intelligence, vol. 5. 3496–3502.
View | Files available | Download (ext.) | arXiv
 
[247]
2015 | Journal Article | IST-REx-ID: 1856
Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2015. Measuring and synthesizing systems in probabilistic environments. Journal of the ACM. 62(1).
View | Files available | DOI | Download (ext.)
 
[246]
2015 | Journal Article | IST-REx-ID: 1731
Chatterjee K, Doyen L, Gimbert H, Henzinger TA. 2015. Randomness for free. Information and Computation. 245(12), 3–16.
View | Files available | DOI | Download (ext.)
 
[245]
2015 | Conference Paper | IST-REx-ID: 1661
Chatterjee K, Henzinger M, Loitzenbauer V. 2015. Improved algorithms for one-pair and k-pair Streett objectives. Proceedings - Symposium on Logic in Computer Science. LICS: Logic in Computer Science vol. 2015–July. 7174888.
View | Files available | DOI | Download (ext.)
 
[244]
2015 | Journal Article | IST-REx-ID: 523   OA
Chatterjee K, Doyen L, Randour M, Raskin J. 2015. Looking at mean-payoff and total-payoff through windows. Information and Computation. 242(6), 25–52.
View | Files available | DOI | Download (ext.)
 
[243]
2015 | Technical Report | IST-REx-ID: 5430
Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2015. Faster algorithms for quantitative verification in constant treewidth graphs, IST Austria, 31p.
View | Files available | DOI
 
[242]
2015 | Technical Report | IST-REx-ID: 5435   OA
Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes, IST Austria, 51p.
View | Files available | DOI
 
[241]
2015 | Journal Article | IST-REx-ID: 1604
Chatterjee K, Pavlogiannis A, Velner Y. 2015. Quantitative interprocedural analysis. Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT . 50(1), 539–551.
View | Files available | DOI
 
[240]
2015 | Journal Article | IST-REx-ID: 1559   OA
Ibsen-Jensen R, Chatterjee K, Nowak M. 2015. Computational complexity of ecological and evolutionary spatial dynamics. PNAS. 112(51), 15636–15641.
View | DOI | Download (ext.) | PubMed | Europe PMC
 
[239]
2015 | Journal Article | IST-REx-ID: 1624   OA
Pavlogiannis A, Chatterjee K, Adlam B, Nowak M. 2015. Cellular cooperation with shift updating and repulsion. Scientific Reports. 5.
View | Files available | DOI
 
[238]
2015 | Journal Article | IST-REx-ID: 1698   OA
Velner Y, Chatterjee K, Doyen L, Henzinger TA, Rabinovich A, Raskin J. 2015. The complexity of multi-mean-payoff and multi-energy games. Information and Computation. 241(4), 177–196.
View | DOI | Download (ext.)
 
[237]
2015 | Journal Article | IST-REx-ID: 1681   OA
Priklopil T, Chatterjee K. 2015. Evolution of decisions in population games with sequentially searching individuals. Games. 6(4), 413–437.
View | Files available | DOI
 
[236]
2015 | Conference Paper | IST-REx-ID: 1838   OA
Bloem R, Chatterjee K, Jacobs S, Könighofer R. 2015. Assume-guarantee synthesis for concurrent reactive programs with partial information. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 9035. 517–532.
View | DOI | Download (ext.)
 
[235]
2015 | Journal Article | IST-REx-ID: 524
Chatterjee K, Ibsen-Jensen R. 2015. Qualitative analysis of concurrent mean payoff games. Information and Computation. 242(6), 2–24.
View | Files available | DOI | Download (ext.) | arXiv
 
[234]
2015 | Conference Paper | IST-REx-ID: 1732
Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2015. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. ICRA: International Conference on Robotics and Automation 325–330.
View | Files available | DOI | Download (ext.) | arXiv
 
[233]
2015 | Technical Report | IST-REx-ID: 5429
Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes, IST Austria, 41p.
View | Files available | DOI
 
[232]
2015 | Technical Report | IST-REx-ID: 5443   OA
Chatterjee K, Chmelik M, Davies J. 2015. A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs, IST Austria, 23p.
View | Files available | DOI
 
[231]
2015 | Technical Report | IST-REx-ID: 5431   OA
Chatterjee K, Ibsen-Jensen R, Hansen K. 2015. The patience of concurrent stochastic games with safety and reachability objectives, IST Austria, 25p.
View | Files available | DOI
 
[230]
2015 | Technical Report | IST-REx-ID: 5436   OA
Chatterjee K, Henzinger TA, Otop J. 2015. Nested weighted automata, IST Austria, 29p.
View | Files available | DOI
 
[229]
2015 | Journal Article | IST-REx-ID: 1694
Chatterjee K, Prabhu V. 2015. Quantitative temporal simulation and refinement distances for timed systems. IEEE Transactions on Automatic Control. 60(9), 2291–2306.
View | DOI
 
[228]
2015 | Conference Paper | IST-REx-ID: 1839   OA
Brázdil T, Chatterjee K, Forejt V, Kučera A. 2015. Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives. 9035, 181–187.
View | DOI | Download (ext.)
 
[227]
2015 | Journal Article | IST-REx-ID: 2034   OA
Bérard B, Chatterjee K, Sznajder N. 2015. Probabilistic opacity for Markov decision processes. Information Processing Letters. 115(1), 52–59.
View | DOI | Download (ext.)
 
[226]
2015 | Journal Article | IST-REx-ID: 1598
Chatterjee K, Joglekar M, Shah N. 2015. Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. Theoretical Computer Science. 573(3), 71–89.
View | Files available | DOI | Download (ext.)
 
[225]
2015 | Conference Paper | IST-REx-ID: 1656
Chatterjee K, Henzinger TA, Otop J. 2015. Nested weighted automata. Proceedings - Symposium on Logic in Computer Science. LICS: Logic in Computer Science vol. 2015–July. 7174926.
View | Files available | DOI | arXiv
 
[224]
2015 | Technical Report | IST-REx-ID: 5437   OA
Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2015. Faster algorithms for quantitative verification in constant treewidth graphs, IST Austria, 27p.
View | Files available | DOI
 
[223]
2015 | Technical Report | IST-REx-ID: 5444   OA
Reiter J, Makohon-Moore A, Gerold J, Bozic I, Chatterjee K, Iacobuzio-Donahue C, Vogelstein B, Nowak M. 2015. Reconstructing robust phylogenies of metastatic cancers, IST Austria, 25p.
View | Files available | DOI
 
[222]
2015 | Technical Report | IST-REx-ID: 5432
Chatterjee K, Ibsen-Jensen R, Nowak M. 2015. The complexity of evolutionary games on graphs, IST Austria, 29p.
View | Files available | DOI
 
[221]
2015 | Conference Paper | IST-REx-ID: 1714
Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. 2015. A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. Real-Time Systems Symposium. RTSS: Real-Time Systems Symposium, Proceedings - Real-Time Systems Symposium , vol. 2015. 118–127.
View | Files available | DOI
 
[220]
2015 | Journal Article | IST-REx-ID: 1873   OA
Chatterjee K, Chmelik M. 2015. POMDPs under probabilistic semantics. Artificial Intelligence. 221, 46–72.
View | DOI | Download (ext.) | arXiv
 
[219]
2015 | Conference Paper | IST-REx-ID: 1481
Ahmed U, Chatterjee K, Gulwani S. 2015. Automatic generation of alternative starting positions for simple traditional board games. AAAI: Conference on Artificial Intelligence, Proceedings of the National Conference on Artificial Intelligence, vol. 2. 745–752.
View | Files available | Download (ext.)
 
[218]
2015 | Conference Paper | IST-REx-ID: 1657
Chatterjee K, Komárková Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes. , 244–256.
View | Files available | DOI
 
[217]
2015 | Technical Report | IST-REx-ID: 5438   OA
Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2015. Edit distance for pushdown automata, IST Austria, 15p.
View | Files available | DOI
 
[216]
2015 | Journal Article | IST-REx-ID: 1501
Chatterjee K, Chmelik M, Daca P. 2015. CEGAR for compositional analysis of qualitative properties in Markov decision processes. Formal Methods in System Design. 47(2), 230–264.
View | Files available | DOI | Download (ext.)
 
[215]
2015 | Technical Report | IST-REx-ID: 5440
Chatterjee K, Ibsen-Jensen R, Nowak M. 2015. The complexity of evolutionary games on graphs, IST Austria, 18p.
View | Files available | DOI
 
[214]
2015 | Journal Article | IST-REx-ID: 1602
Chatterjee K, Ibsen-Jensen R, Pavlogiannis A, Goyal P. 2015. Faster algorithms for algebraic path properties in recursive state machines with constant treewidth. ACM SIGPLAN Notices. 50(1), 97–109.
View | Files available | DOI | Download (ext.) | arXiv
 
[213]
2015 | Conference Paper | IST-REx-ID: 1607
Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2015. Faster algorithms for quantitative verification in constant treewidth graphs. CAV: Computer Aided Verification, LNCS, vol. 9206. 140–157.
View | Files available | DOI | Download (ext.)
 
[212]
2015 | Conference Paper | IST-REx-ID: 1689   OA
Svoreňová M, Kretinsky J, Chmelik M, Chatterjee K, Cěrná I, Belta C. 2015. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control 259–268.
View | Files available | DOI | Download (ext.)
 
[211]
2015 | Conference Paper | IST-REx-ID: 1691
Svoreňová M, Chmelik M, Leahy K, Eniser H, Chatterjee K, Cěrná I, Belta C. 2015. Temporal logic motion planning using POMDPs with parity objectives: Case study paper. Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control 233–238.
View | DOI
 
[210]
2015 | Journal Article | IST-REx-ID: 1709   OA
Reiter J, Kanodia A, Gupta R, Nowak M, Chatterjee K. 2015. Biological auctions with multiple rewards. Proceedings of the Royal Society of London Series B Biological Sciences. 282(1812).
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 
[209]
2015 | Conference Paper | IST-REx-ID: 1610
Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2015. Edit distance for pushdown automata. 9135(Part II), 121–133.
View | Files available | DOI
 
[208]
2015 | Conference Paper | IST-REx-ID: 1603
Brázdil T, Chatterjee K, Chmelik M, Fellner A, Kretinsky J. 2015. Counterexample explanation by learning small strategies in Markov decision processes. CAV: Computer Aided Verification, LNCS, vol. 9206. 158–177.
View | Files available | DOI | Download (ext.)
 
[207]
2015 | Technical Report | IST-REx-ID: 5441
Chatterjee K, Ibsen-Jensen R, Goharshady A, Pavlogiannis A. 2015. Algorithms for algebraic path properties in concurrent systems of constant treewidth components, IST Austria, 24p.
View | Files available | DOI
 
[206]
2014 | Journal Article | IST-REx-ID: 1375   OA
Chatterjee K, Henzinger M, Krinninger S, Loitzenbauer V, Raskin M. 2014. Approximating the minimum cycle mean. Theoretical Computer Science. 547(C), 104–116.
View | DOI | Download (ext.)
 
[205]
2014 | Journal Article | IST-REx-ID: 2234   OA
Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. 2014. Markov decision processes with multiple long-run average objectives. Logical Methods in Computer Science. 10(1).
View | Files available | DOI | Download (ext.)
 
[204]
2014 | Journal Article | IST-REx-ID: 535   OA
Chatterjee K, Henzinger M, Krinninger S, Nanongkai D. 2014. Polynomial time algorithms for energy games with special weight structures. Algorithmica. 70(3), 457–492.
View | DOI | Download (ext.)
 
[203]
2014 | Technical Report | IST-REx-ID: 5423   OA
Chatterjee K, Kössler A, Pavlogiannis A, Schmid U. 2014. A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks, IST Austria, 14p.
View | Files available | DOI
 
[202]
2014 | Technical Report | IST-REx-ID: 5428   OA
Chatterjee K, Henzinger TA, Otop J, Velner Y. 2014. Quantitative fair simulation games, IST Austria, 26p.
View | Files available | DOI
 
[201]
2014 | Conference Paper | IST-REx-ID: 2063
Chatterjee K, Chmelik M, Daca P. 2014. CEGAR for qualitative analysis of probabilistic systems. CAV: Computer Aided Verification, LNCS, vol. 8559. 473–490.
View | Files available | DOI
 
[200]
2014 | Journal Article | IST-REx-ID: 2716   OA
Chatterjee K, Randour M, Raskin J. 2014. Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica. 51(3–4), 129–163.
View | DOI | Download (ext.)
 
[199]
2014 | Journal Article | IST-REx-ID: 2141
Chatterjee K, Henzinger M. 2014. Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. Journal of the ACM. 61(3).
View | Files available | DOI | Download (ext.)
 
[198]
2014 | Journal Article | IST-REx-ID: 2038
Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2014. Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). 15(4), 27.
View | Files available | DOI
 
[197]
2014 | Journal Article | IST-REx-ID: 2211
Chatterjee K, Doyen L. 2014. Partial-observation stochastic games: How to win when belief fails. ACM Transactions on Computational Logic (TOCL). 15(2), 16.
View | Files available | DOI | Download (ext.) | arXiv
 
[196]
2014 | Conference Paper | IST-REx-ID: 1903
Chatterjee K. 2014. Partial-observation stochastic reachability and parity games. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 8634. 1–4.
View | Files available | DOI
 
[195]
2014 | Conference Paper | IST-REx-ID: 2216
Chatterjee K, Ibsen-Jensen R, Majumdar R. 2014. Edit distance for timed automata. HSCC: Hybrid Systems - Computation and Control 303–312.
View | Files available | DOI | Download (ext.)
 
[194]
2014 | Technical Report | IST-REx-ID: 5412
Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 31p.
View | Files available | DOI
 
[193]
2014 | Technical Report | IST-REx-ID: 5424
Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2014. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications, IST Austria, 12p.
View | Files available | DOI
 
[192]
2014 | Conference Paper | IST-REx-ID: 1853
Jha S, Tripakis S, Seshia S, Chatterjee K. 2014. Game theoretic secure localization in wireless sensor networks. IOT: Internet of Things 85–90.
View | DOI
 
[191]
2014 | Conference Paper | IST-REx-ID: 2027   OA
Brázdil T, Chatterjee K, Chmelik M, Forejt V, Kretinsky J, Kwiatkowska M, Parker D, Ujma M. 2014. Verification of markov decision processes using learning algorithms. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ALENEX: Algorithm Engineering and Experiments, LNCS, vol. 8837. 98–114.
View | DOI | Download (ext.)
 
[190]
2014 | Conference Paper | IST-REx-ID: 2212
Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. 2014. Perfect-information stochastic mean-payoff parity games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 8412. 210–225.
View | Files available | DOI
 
[189]
2014 | Technical Report | IST-REx-ID: 5413
Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 33p.
View | Files available | DOI
 
[188]
2014 | Technical Report | IST-REx-ID: 5418   OA
Chatterjee K, Doyen L. 2014. Games with a weak adversary, IST Austria, 18p.
View | Files available | DOI
 
[187]
2014 | Technical Report | IST-REx-ID: 5420   OA
Chatterjee K, Ibsen-Jensen R. 2014. The value 1 problem for concurrent mean-payoff games, IST Austria, 49p.
View | Files available | DOI
 
[186]
2014 | Journal Article | IST-REx-ID: 2039   OA
Chatterjee K, Pavlogiannis A, Adlam B, Nowak M. 2014. The time scale of evolutionary innovation. PLoS Computational Biology. 10(9).
View | Files available | DOI
 
[185]
2014 | Conference Paper | IST-REx-ID: 2054
Chatterjee K. 2014. Qualitative concurrent parity games: Bounded rationality. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). CONCUR: Concurrency Theory, LNCS, vol. 8704. 544–559.
View | Files available | DOI
 
[184]
2014 | Conference Paper | IST-REx-ID: 2213
Chatterjee K, Doyen L, Nain S, Vardi M. 2014. The complexity of partial-observation stochastic parity games with finite-memory strategies. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 8412. 242–257.
View | Files available | DOI | Download (ext.) | arXiv
 
[183]
2014 | Conference Paper | IST-REx-ID: 2162
Chatterjee K, Ibsen-Jensen R. 2014. The complexity of ergodic mean payoff games. ICST: International Conference on Software Testing, Verification and Validation, LNCS, vol. 8573. 122–133.
View | Files available | DOI | Download (ext.) | arXiv
 
[182]
2014 | Technical Report | IST-REx-ID: 5426   OA
Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2014. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications, IST Austria, 10p.
View | Files available | DOI
 
[181]
2014 | Technical Report | IST-REx-ID: 5419   OA
Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2014. Improved algorithms for reachability and shortest path on low tree-width graphs, IST Austria, 34p.
View | Files available | DOI
 
[180]
2014 | Technical Report | IST-REx-ID: 5414   OA
Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 33p.
View | Files available | DOI
 
[179]
2014 | Technical Report | IST-REx-ID: 5421   OA
Chatterjee K, Ibsen-Jensen R, Nowak M. 2014. The complexity of evolution on graphs, IST Austria, 27p.
View | Files available | DOI
 
[178]
2014 | Journal Article | IST-REx-ID: 2187   OA
Bloem R, Chatterjee K, Greimel K, Henzinger TA, Hofferek G, Jobstmann B, Könighofer B, Könighofer R. 2014. Synthesizing robust systems. Acta Informatica. 51(3–4), 193–220.
View | Files available | DOI
 
[177]
2014 | Conference Paper | IST-REx-ID: 2163
Chatterjee K, Doyen L. 2014. Games with a weak adversary. Lecture Notes in Computer Science. ICALP: Automata, Languages and Programming, LNCS, vol. 8573. 110–121.
View | Files available | DOI | Download (ext.) | arXiv
 
[176]
2014 | Technical Report | IST-REx-ID: 5427   OA
Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2014. Optimal tree-decomposition balancing and reachability on low treewidth graphs, IST Austria, 24p.
View | Files available | DOI
 
[175]
2014 | Technical Report | IST-REx-ID: 5415
Chatterjee K, Henzinger TA, Otop J. 2014. Nested weighted automata, IST Austria, 27p.
View | Files available | DOI
 
[174]
2013 | Journal Article | IST-REx-ID: 2816   OA
Božić I, Reiter J, Allen B, Antal T, Chatterjee K, Shah P, Moon Y, Yaqubie A, Kelly N, Le D, Lipson E, Chapman P, Diaz L, Vogelstein B, Nowak M. 2013. Evolutionary dynamics of cancer in response to targeted combination therapy. eLife. 2.
View | Files available | DOI
 
[173]
2013 | Journal Article | IST-REx-ID: 2854   OA
Chatterjee K, De Alfaro L, Henzinger TA. 2013. Strategy improvement for concurrent reachability and turn based stochastic safety games. Journal of Computer and System Sciences. 79(5), 640–657.
View | Files available | DOI
 
[172]
2013 | Technical Report | IST-REx-ID: 5404   OA
Chatterjee K, Ibsen-Jensen R. 2013. The complexity of ergodic games, IST Austria, 29p.
View | Files available | DOI
 
[171]
2013 | Technical Report | IST-REx-ID: 5409   OA
Chatterjee K, Ibsen-Jensen R, Majumdar R. 2013. Edit distance for timed automata, IST Austria, 12p.
View | Files available | DOI
 
[170]
2013 | Journal Article | IST-REx-ID: 2247   OA
Zagorsky B, Reiter J, Chatterjee K, Nowak M. 2013. Forgiver triumphs in alternating prisoner’s dilemma . PLoS One. 8(12).
View | Files available | DOI
 
[169]
2013 | Conference (Editor) | IST-REx-ID: 2292
Chatterjee K, Sgall J eds. 2013. Mathematical Foundations of Computer Science 2013, Springer,p.
View | DOI
 
[168]
2013 | Conference Paper | IST-REx-ID: 2444   OA
Chatterjee K, Ła̧Cki J. 2013. Faster algorithms for Markov decision processes with low treewidth. 8044, 543–558.
View | DOI | Download (ext.) | arXiv
 
[167]
2013 | Conference Paper | IST-REx-ID: 2305   OA
Brázdil T, Chatterjee K, Forejt V, Kučera A. 2013. Trading performance for stability in Markov decision processes. 28th Annual ACM/IEEE Symposium. LICS: Logic in Computer Science 331–340.
View | Files available | DOI | Download (ext.) | arXiv
 
[166]
2013 | Journal Article | IST-REx-ID: 2824
Chatterjee K, Prabhu V. 2013. Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems. Information and Computation. 228–229, 83–119.
View | DOI
 
[165]
2013 | Journal Article | IST-REx-ID: 2831   OA
Chatterjee K, Henzinger M, Joglekar M, Shah N. 2013. Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. Formal Methods in System Design. 42(3), 301–327.
View | DOI | Download (ext.) | arXiv
 
[164]
2013 | Journal Article | IST-REx-ID: 2836   OA
Chatterjee K, Raman V. 2013. Assume-guarantee synthesis for digital contract signing. Formal Aspects of Computing. 26(4), 825–859.
View | DOI | Download (ext.) | arXiv
 
[163]
2013 | Journal Article | IST-REx-ID: 2817   OA
Novak S, Chatterjee K, Nowak M. 2013. Density games. Journal of Theoretical Biology. 334, 26–34.
View | Files available | DOI
 
[162]
2013 | Technical Report | IST-REx-ID: 5400   OA
Chatterjee K, Chmelik M, Tracol M. 2013. What is decidable about partially observable Markov decision processes with ω-regular objectives, IST Austria, 41p.
View | Files available | DOI
 
[161]
2013 | Conference Paper | IST-REx-ID: 1376
Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. 2013. Distributed synthesis for LTL fragments. 13th International Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design 18–25.
View | Files available | DOI
 
[160]
2013 | Technical Report | IST-REx-ID: 5405   OA
Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. 2013. Perfect-information stochastic mean-payoff parity games, IST Austria, 22p.
View | Files available | DOI
 
[159]
2013 | Conference Paper | IST-REx-ID: 2329
Chatterjee K, Velner Y. 2013. Hyperplane separation technique for multidimensional mean-payoff games. 8052, 500–515.
View | Files available | DOI | Download (ext.) | arXiv
 
[158]
2013 | Conference Paper | IST-REx-ID: 2279
Chatterjee K, Doyen L, Randour M, Raskin J. 2013. Looking at mean-payoff and total-payoff through windows. 8172, 118–132.
View | Files available | DOI | Download (ext.)
 
[157]
2013 | Technical Report | IST-REx-ID: 5406   OA
Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. 2013. Distributed synthesis for LTL Fragments, IST Austria, 11p.
View | Files available | DOI
 
[156]
2013 | Conference Paper | IST-REx-ID: 2820
Chatterjee K, Kößler A, Schmid U. 2013. Automated analysis of real-time scheduling using graph games. Proceedings of the 16th International conference on Hybrid systems: Computation and control. HSCC: Hybrid Systems - Computation and Control 163–172.
View | Files available | DOI
 
[155]
2013 | Conference Paper | IST-REx-ID: 2446   OA
Chatterjee K, Gaiser A, Kretinsky J. 2013. Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis. 8044, 559–575.
View | DOI | Download (ext.) | arXiv
 
[154]
2013 | Journal Article | IST-REx-ID: 2299   OA
Godhal Y, Chatterjee K, Henzinger TA. 2013. Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer. 15(5–6), 585–601.
View | Files available | DOI
 
[153]
2013 | Journal Article | IST-REx-ID: 2814   OA
Chatterjee K, Alfaro L, Majumdar R. 2013. The complexity of coverage. International Journal of Foundations of Computer Science. 24(2), 165–185.
View | DOI | Download (ext.) | arXiv
 
[152]
2013 | Conference Paper | IST-REx-ID: 2819   OA
Chatterjee K, Prabhu V. 2013. Quantitative timed simulation functions and refinement metrics for real-time systems. Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control vol. 1. 273–282.
View | DOI | Download (ext.)
 
[151]
2013 | Technical Report | IST-REx-ID: 5399   OA
Reiter J, Bozic I, Chatterjee K, Nowak M. 2013. TTP: Tool for Tumor Progression, IST Austria, 17p.
View | Files available | DOI
 
[150]
2013 | Conference Paper | IST-REx-ID: 1374   OA
Chatterjee K, Fijalkow N. 2013. Infinite-state games with finitary conditions. 22nd EACSL Annual Conference on Computer Science Logic. CSL: Computer Science LogicLeibniz International Proceedings in Informatics, LIPIcs, vol. 23. 181–196.
View | Files available | DOI
 
[149]
2013 | Conference Paper | IST-REx-ID: 2238
Chatterjee K, Forejt V, Wojtczak D. 2013. Multi-objective discounted reward verification in graphs and MDPs. 8312, 228–242.
View | DOI
 
[148]
2013 | Journal Article | IST-REx-ID: 2858   OA
Reiter J, Božić I, Allen B, Chatterjee K, Nowak M. 2013. The effect of one additional driver mutation on tumor progression. Evolutionary Applications. 6(1), 34–45.
View | Files available | DOI
 
[147]
2013 | Journal Article | IST-REx-ID: 3116
Chatterjee K, De Alfaro L, Faella M, Majumdar R, Raman V. 2013. Code aware resource management. Formal Methods in System Design. 42(2), 142–174.
View | DOI
 
[146]
2013 | Conference Paper | IST-REx-ID: 2295
Chatterjee K, Chmelik M, Tracol M. 2013. What is decidable about partially observable Markov decision processes with omega-regular objectives. 23, 165–180.
View | Files available | DOI
 
[145]
2013 | Technical Report | IST-REx-ID: 5403   OA
Chatterjee K, Ibsen-Jensen R. 2013. Qualitative analysis of concurrent mean-payoff games, IST Austria, 33p.
View | Files available | DOI
 
[144]
2013 | Conference Paper | IST-REx-ID: 2000
Reiter J, Božić I, Chatterjee K, Nowak M. 2013. TTP: Tool for tumor progression. Proceedings of 25th Int. Conf. on Computer Aided Verification. CAV: Computer Aided VerificationLecture Notes in Computer Science, LNCS, vol. 8044. 101–106.
View | Files available | DOI | Download (ext.) | arXiv
 
[143]
2013 | Technical Report | IST-REx-ID: 5410   OA
Ahmed U, Chatterjee K, Gulwani S. 2013. Automatic generation of alternative starting positions for traditional board games, IST Austria, 13p.
View | Files available | DOI
 
[142]
2013 | Technical Report | IST-REx-ID: 5408   OA
Chatterjee K, Doyen L, Nain S, Vardi M. 2013. The complexity of partial-observation stochastic parity games with finite-memory strategies, IST Austria, 17p.
View | Files available | DOI
 
[141]
2012 | Conference Paper | IST-REx-ID: 2715   OA
Chatterjee K, Joglekar M, Shah N. 2012. Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 18. 461–473.
View | Files available | DOI
 
[140]
2012 | Conference Paper | IST-REx-ID: 2936   OA
Chatterjee K, Henzinger TA, Prabhu V. 2012. Finite automata with time delay blocks. roceedings of the tenth ACM international conference on Embedded software. EMSOFT: Embedded Software 43–52.
View | DOI | Download (ext.)
 
[139]
2012 | Journal Article | IST-REx-ID: 3314
Chatterjee K, Majumdar R. 2012. Discounting and averaging in games across time scales. International Journal of Foundations of Computer Science. 23(3), 609–625.
View | DOI
 
[138]
2012 | Conference Paper | IST-REx-ID: 2955
Chatterjee K, Doyen L. 2012. Partial-observation stochastic games: How to win when belief fails. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science 6280436.
View | Files available | DOI | Download (ext.) | arXiv
 
[137]
2012 | Technical Report | IST-REx-ID: 5377   OA
Chatterjee K, Velner Y. 2012. Mean-payoff pushdown games, IST Austria, 33p.
View | Files available | DOI
 
[136]
2012 | Journal Article | IST-REx-ID: 2848   OA
Chatterjee K, Zufferey D, Nowak M. 2012. Evolutionary game dynamics in populations with different learners. Journal of Theoretical Biology. 301, 161–173.
View | DOI | Download (ext.) | PubMed | Europe PMC
 
[135]
2012 | Conference Paper | IST-REx-ID: 3252   OA
Chatterjee K, Raman V. 2012. Synthesizing protocols for digital contract signing. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 7148. 152–168.
View | DOI | Download (ext.)
 
[134]
2012 | Journal Article | IST-REx-ID: 3846   OA
Chatterjee K, Henzinger TA. 2012. A survey of stochastic ω regular games. Journal of Computer and System Sciences. 78(2), 394–413.
View | Files available | DOI
 
[133]
2012 | Conference Paper | IST-REx-ID: 497
Chatterjee K, Chaubal S, Kamath P. 2012. Faster algorithms for alternating refinement relations. EACSL: European Association for Computer Science Logic, LIPIcs, vol. 16. 167–182.
View | Files available | DOI
 
[132]
2012 | Conference Paper | IST-REx-ID: 2956
Chatterjee K, Velner Y. 2012. Mean payoff pushdown games. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science
View | Files available | DOI
 
[131]
2012 | Technical Report | IST-REx-ID: 5378   OA
Chatterjee K, Chaubal S, Kamath P. 2012. Faster algorithms for alternating refinement relations, IST Austria, 21p.
View | Files available | DOI
 
[130]
2012 | Conference Paper | IST-REx-ID: 3341
Chatterjee K. 2012. Robustness of structurally equivalent concurrent parity games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 7213. 270–285.
View | Files available | DOI | Download (ext.) | arXiv
 
[129]
2012 | Journal Article | IST-REx-ID: 3260   OA
Chatterjee K, Reiter J, Nowak M. 2012. Evolutionary dynamics of biological auctions. Theoretical Population Biology. 81(1), 69–80.
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 
[128]
2012 | Conference Paper | IST-REx-ID: 2957
Chatterjee K, Tracol M. 2012. Decidable problems for probabilistic automata on infinite words. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science 6280437.
View | Files available | DOI | Download (ext.) | arXiv
 
[127]
2012 | Journal Article | IST-REx-ID: 2972   OA
Chatterjee K, Doyen L. 2012. Energy parity games. Theoretical Computer Science. 458, 49–60.
View | Files available | DOI
 
[126]
2012 | Journal Article | IST-REx-ID: 3254
Chatterjee K. 2012. The complexity of stochastic Müller games. Information and Computation. 211, 29–48.
View | DOI | Download (ext.)
 
[125]
2012 | Conference Paper | IST-REx-ID: 3165
Chatterjee K, Henzinger M. 2012. An O(n2) time algorithm for alternating Büchi games. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms 1386–1399.
View | Files available | DOI
 
[124]
2012 | Conference Paper | IST-REx-ID: 2947   OA
Chatterjee K, Chmelik M, Majumdar R. 2012. Equivalence of games with probabilistic uncertainty and partial observation games. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 7561. 385–399.
View | DOI | Download (ext.)
 
[123]
2012 | Conference Paper | IST-REx-ID: 3135   OA
Brázdil B, Chatterjee K, Kučera A, Novotny P. 2012. Efficient controller synthesis for consumption games with multiple resource types. CAV: Computer Aided Verification, LNCS, vol. 7358. 23–38.
View | DOI | Download (ext.)
 
[122]
2012 | Journal Article | IST-REx-ID: 3128   OA
Chatterjee K, Doyen L, Henzinger TA. 2012. A survey of partial-observation stochastic parity games. Formal Methods in System Design. 43(2), 268–284.
View | Files available | DOI
 
[121]
2012 | Conference Paper | IST-REx-ID: 3255
Chatterjee K, Doyen L. 2012. Games and Markov decision processes with mean payoff parity and energy parity objectives. MEMICS: Mathematical and Engineering Methods in Computer Science, LNCS, vol. 7119. 37–46.
View | DOI
 
[120]
2011 | Conference Paper | IST-REx-ID: 3357
Chatterjee K, Henzinger TA, Horn F. 2011. The complexity of request-response games. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638. 227–237.
View | DOI
 
[119]
2011 | Conference Paper | IST-REx-ID: 3345
Chatterjee K, Doyen L. 2011. Energy and mean-payoff parity Markov Decision Processes. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6907. 206–218.
View | Files available | DOI | Download (ext.) | arXiv
 
[118]
2011 | Technical Report | IST-REx-ID: 5384   OA
Chatterjee K, Tracol M. 2011. Decidable problems for probabilistic automata on infinite words, IST Austria, 30p.
View | Files available | DOI
 
[117]
2011 | Journal Article | IST-REx-ID: 3338
Chatterjee K. 2011. Bounded rationality in concurrent parity games. CoRR: Computing Research Repository., 1–51.
View | Files available | Download (ext.) | arXiv
 
[116]
2011 | Conference Paper | IST-REx-ID: 3346   OA
Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. 2011. Two views on multiple mean payoff objectives in Markov Decision Processes. LICS: Logic in Computer Science
View | DOI | Download (ext.)
 
[115]
2011 | Journal Article | IST-REx-ID: 3339   OA
Chatterjee K, De Alfaro L, Pritam R. 2011. Magnifying lens abstraction for stochastic games with discounted and long-run average objectives. CoRR: Computing Research Repository.
View | Download (ext.) | arXiv
 
[114]
2011 | Conference Paper | IST-REx-ID: 3365   OA
Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2011. QUASY: quantitative synthesis tool. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 6605. 267–271.
View | Files available | DOI
 
[113]
2011 | Journal Article | IST-REx-ID: 3315
Chatterjee K, Henzinger TA, Prabhu V. 2011. Timed parity games: Complexity and robustness. Logical Methods in Computer Science. 7(4).
View | Files available | DOI
 
[112]
2011 | Technical Report | IST-REx-ID: 5380   OA
Chatterjee K. 2011. Bounded rationality in concurrent parity games, IST Austria, 53p.
View | Files available | DOI
 
[111]
2011 | Technical Report | IST-REx-ID: 5385   OA
Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values, IST Austria, 14p.
View | Files available | DOI
 
[110]
2011 | Conference Paper | IST-REx-ID: 3347   OA
Chatterjee K, Fijalkow N. 2011. Finitary languages. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638. 216–226.
View | DOI | Download (ext.)
 
[109]
2011 | Conference Paper | IST-REx-ID: 3342   OA
Chatterjee K, Henzinger M, Joglekar M, Nisarg S. 2011. Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. CAV: Computer Aided Verification, LNCS, vol. 6806. 260–276.
View | DOI | Download (ext.) | arXiv
 
[108]
2011 | Journal Article | IST-REx-ID: 3354
Chatterjee K, De Alfaro L, Henzinger TA. 2011. Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL). 12(4).
View | Files available | DOI
 
[107]
2011 | Conference Paper | IST-REx-ID: 3316
Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. 2011. Specification-centered robustness. SIES: International Symposium on Industrial Embedded Systems 176–185.
View | DOI
 
[106]
2011 | Conference Paper | IST-REx-ID: 3361   OA
Cerny P, Chatterjee K, Henzinger TA. 2011. The complexity of quantitative information flow problems. CSF: Computer Security Foundations 205–217.
View | Files available | DOI
 
[105]
2011 | Technical Report | IST-REx-ID: 5381   OA
Chatterjee K, Doyen L. 2011. Partial-observation stochastic games: How to win when belief fails, IST Austria, 43p.
View | Files available | DOI
 
[104]
2011 | Technical Report | IST-REx-ID: 5379   OA
Chatterjee K, Henzinger M. 2011. An O(n2) time algorithm for alternating Büchi games, IST Austria, 20p.
View | Files available | DOI
 
[103]
2011 | Conference Paper | IST-REx-ID: 3366
Cerny P, Chatterjee K, Henzinger TA, Radhakrishna A, Singh R. 2011. Quantitative synthesis for concurrent programs. CAV: Computer Aided Verification, LNCS, vol. 6806. 243–259.
View | Files available | DOI
 
[102]
2011 | Conference Paper | IST-REx-ID: 3348   OA
Chatterjee K, Prabhu V. 2011. Synthesis of memory efficient real time controllers for safety objectives. HSCC: Hybrid Systems - Computation and Control 221–230.
View | DOI | Download (ext.)
 
[101]
2011 | Conference Paper | IST-REx-ID: 3350
Chatterjee K, Majumdar R. 2011. Minimum attention controller synthesis for omega regular objectives. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 6919. 145–159.
View | DOI
 
[100]
2011 | Conference Paper | IST-REx-ID: 3343   OA
Chatterjee K, Henzinger M. 2011. Faster and dynamic algorithms for maximal end component decomposition and related graph problems in probabilistic verification. SODA: Symposium on Discrete Algorithms 1318–1336.
View | DOI | Download (ext.)
 
[99]
2011 | Technical Report | IST-REx-ID: 5382   OA
Chatterjee K. 2011. Robustness of structurally equivalent concurrent parity games, IST Austria, 18p.
View | Files available | DOI
 
[98]
2011 | Technical Report | IST-REx-ID: 5387   OA
Chatterjee K, Doyen L. 2011. Energy and mean-payoff parity Markov decision processes, IST Austria, 20p.
View | Files available | DOI
 
[97]
2011 | Preprint | IST-REx-ID: 3363   OA
Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words.
View | Download (ext.) | arXiv
 
[96]
2011 | Conference Paper | IST-REx-ID: 3349   OA
Chatterjee K, Fijalkow N. 2011. A reduction from parity games to simple stochastic games. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 54. 74–86.
View | DOI | Download (ext.)
 
[95]
2011 | Conference Paper | IST-REx-ID: 3351   OA
Chatterjee K, Doyen L, Singh R. 2011. On memoryless quantitative objectives. FCT: Fundamentals of Computation Theory, LNCS, vol. 6914. 148–159.
View | DOI | Download (ext.)
 
[94]
2011 | Conference Paper | IST-REx-ID: 3344
Chatterjee K. 2011. Graph games with reachability objectives. RP: Reachability Problems, LNCS, vol. 6945. 1–1.
View | DOI
 
[93]
2011 | Conference Paper | IST-REx-ID: 3356
Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values. LICS: Logic in Computer Science
View | Files available | DOI
 
[92]
2010 | Conference Paper | IST-REx-ID: 3852   OA
Chatterjee K, Majumdar R. 2010. Discounting in games across time scales. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 25. 22–29.
View | Files available | DOI | Download (ext.) | arXiv
 
[91]
2010 | Conference Paper | IST-REx-ID: 3864   OA
Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2010. Measuring and synthesizing systems in probabilistic environments. CAV: Computer Aided Verification, LNCS, vol. 6174. 380–395.
View | Files available | DOI | Download (ext.)
 
[90]
2010 | Conference Paper | IST-REx-ID: 3857
Chatterjee K, Henzinger TA. 2010. Probabilistic Automata on infinite words: decidability and undecidability results. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 6252. 1–16.
View | Files available | DOI
 
[89]
2010 | Conference Paper | IST-REx-ID: 3853   OA
Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. 2010. Mean-payoff automaton expressions. CONCUR: Concurrency Theory, LNCS, vol. 6269. 269–283.
View | Files available | DOI
 
[88]
2010 | Conference Paper | IST-REx-ID: 3858
Chatterjee K, Doyen L. 2010. The complexity of partial-observation parity games. LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, LNCS, vol. 6397. 1–14.
View | DOI
 
[87]
2010 | Conference Paper | IST-REx-ID: 3865
Chatterjee K, De Alfaro L, Raman V, Sánchez C. 2010. Analyzing the impact of change in multi-threaded programs. FASE: Fundamental Approaches To Software Engineering, LNCS, vol. 6013. 293–307.
View | DOI
 
[86]
2010 | Conference Paper | IST-REx-ID: 3860   OA
Chatterjee K, Doyen L, Henzinger TA, Raskin J. 2010. Generalized mean-payoff and energy games. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 8. 505–516.
View | Files available | DOI
 
[85]
2010 | Conference Paper | IST-REx-ID: 3854
Chatterjee K, Horn F, Löding C. 2010. Obliging games. CONCUR: Concurrency Theory, LNCS, vol. 6269. 284–296.
View | DOI
 
[84]
2010 | Conference Paper | IST-REx-ID: 3866   OA
Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. 2010. Robustness in the presence of liveness. CAV: Computer Aided Verification, LNCS, vol. 6174. 410–424.
View | Files available | DOI
 
[83]
2010 | Journal Article | IST-REx-ID: 3861
Chatterjee K, Henzinger TA, Piterman N. 2010. Strategy logic. Information and Computation. 208(6), 677–693.
View | Files available | DOI
 
[82]
2010 | Conference (Editor) | IST-REx-ID: 3859
Chatterjee K, Henzinger TA eds. 2010. FORMATS: Formal modeling and analysis of timed systems, Springer,p.
View | DOI
 
[81]
2010 | Conference Paper | IST-REx-ID: 4388
Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. 2010. GIST: A solver for probabilistic games. CAV: Computer Aided Verification, LNCS, vol. 6174. 665–669.
View | Files available | DOI | Download (ext.) | arXiv
 
[80]
2010 | Journal Article | IST-REx-ID: 3862   OA
Chatterjee K, Doyen L, Henzinger TA. 2010. Quantitative languages. ACM Transactions on Computational Logic (TOCL). 11(4), 23.
View | Files available | DOI
 
[79]
2010 | Conference Paper | IST-REx-ID: 3855
Chatterjee K, Doyen L, Henzinger TA. 2010. Qualitative analysis of partially-observable Markov Decision Processes. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281. 258–269.
View | Files available | DOI
 
[78]
2010 | Journal Article | IST-REx-ID: 3867
Chatterjee K, Doyen L, Henzinger TA. 2010. Expressiveness and closure properties for quantitative languages. Logical Methods in Computer Science. 6(3), 1–23.
View | Files available | DOI
 
[77]
2010 | Conference Paper | IST-REx-ID: 3851   OA
Chatterjee K, Doyen L. 2010. Energy parity games. ICALP: Automata, Languages and Programming, 37th International Colloquium, LNCS, vol. 6199. 599–610.
View | DOI | Download (ext.) | arXiv
 
[76]
2010 | Conference Paper | IST-REx-ID: 3856   OA
Chatterjee K, Doyen L, Gimbert H, Henzinger TA. 2010. Randomness for free. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281. 246–257.
View | Files available | DOI | Download (ext.)
 
[75]
2010 | Journal Article | IST-REx-ID: 3868   OA
Chatterjee K, De Alfaro L, Majumdar R, Raman V. 2010. Algorithms for game metrics. Logical Methods in Computer Science. 6(3), 1–27.
View | Files available | DOI
 
[74]
2010 | Journal Article | IST-REx-ID: 3863
Berwanger D, Chatterjee K, De Wulf M, Doyen L, Henzinger TA. 2010. Strategy construction for parity games with imperfect information. Information and Computation. 208(10), 1206–1220.
View | Files available | DOI
 
[73]
2010 | Technical Report | IST-REx-ID: 5388   OA
Chatterjee K, Cerny P, Henzinger TA, Radhakrishna A, Singh R. 2010. Quantitative synthesis for concurrent programs, IST Austria, 17p.
View | Files available | DOI
 
[72]
2010 | Technical Report | IST-REx-ID: 5390   OA
Chatterjee K, Fijalkow N. 2010. Topological, automata-theoretic and logical characterization of finitary languages, IST Austria, 21p.
View | Files available | DOI
 
[71]
2009 | Journal Article | IST-REx-ID: 3869
Chatterjee K, De Alfaro L, Faella M, Legay A. 2009. Qualitative logics and equivalences for probabilistic systems. Logical Methods in Computer Science. 5(2).
View | DOI
 
[70]
2009 | Conference Paper | IST-REx-ID: 3871   OA
Chatterjee K, Doyen L, Henzinger TA. 2009. Probabilistic weighted automata. CONCUR: Concurrency Theory, LNCS, vol. 5710. 244–258.
View | Files available | DOI
 
[69]
2009 | Conference Paper | IST-REx-ID: 4545   OA
Chatterjee K, Doyen L, Henzinger TA. 2009. A survey of stochastic games with limsup and liminf objectives. ICALP: Automata, Languages and Programming, LNCS, vol. 5556. 1–15.
View | Files available | DOI
 
[68]
2009 | Conference Paper | IST-REx-ID: 4569   OA
Bloem R, Chatterjee K, Henzinger TA, Jobstmann B. 2009. Better quality in synthesis through quantitative objectives. CAV: Computer Aided Verification, LNCS, vol. 5643. 140–156.
View | DOI | Download (ext.) | arXiv
 
[67]
2009 | Conference Paper | IST-REx-ID: 4540
Chatterjee K, Doyen L, Henzinger TA. 2009. Expressiveness and closure properties for quantitative languages. LICS: Logic in Computer Science 199–208.
View | Files available | DOI
 
[66]
2009 | Technical Report | IST-REx-ID: 5392   OA
Chatterjee K. 2009. Probabilistic automata on infinite words: Decidability and undecidability results, IST Austria, 17p.
View | Files available | DOI
 
[65]
2009 | Conference Paper | IST-REx-ID: 4580   OA
Berwanger D, Chatterjee K, De Wulf M, Doyen L, Henzinger TA. 2009. Alpaga: A tool for solving parity games with imperfect information. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 5505. 58–61.
View | Files available | DOI | Download (ext.)
 
[64]
2009 | Conference Paper | IST-REx-ID: 4542   OA
Chatterjee K, Doyen L, Henzinger TA. 2009. Alternating weighted automata. FCT: Fundamentals of Computation Theory, LNCS, vol. 5699. 3–13.
View | Files available | DOI
 
[63]
2009 | Technical Report | IST-REx-ID: 5393   OA
Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. 2009. Gist: A solver for probabilistic games, IST Austria, 12p.
View | Files available | DOI
 
[62]
2009 | Conference Paper | IST-REx-ID: 4543
Chatterjee K, Henzinger TA, Horn F. 2009. Stochastic games with finitary objectives. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 5734. 34–54.
View | DOI
 
[61]
2009 | Technical Report | IST-REx-ID: 5394   OA
Chatterjee K, Henzinger TA, Horn F. 2009. Improved lower bounds for request-response and finitary Streett games, IST Austria, 11p.
View | Files available | DOI
 
[60]
2009 | Conference Paper | IST-REx-ID: 3503   OA
Chatterjee K, Henzinger TA. 2009. Probabilistic systems with limsup and liminf objectives. ILC: Infinity in Logic and Computation, LNCS, vol. 5489. 32–45.
View | DOI | Download (ext.)
 
[59]
2009 | Journal Article | IST-REx-ID: 3870   OA
Chatterjee K, Henzinger TA, Horn F. 2009. Finitary winning in omega-regular games. ACM Transactions on Computational Logic (TOCL). 11(1).
View | Files available | DOI
 
[58]
2009 | Conference Paper | IST-REx-ID: 4544   OA
Chatterjee K, De Alfaro L, Henzinger TA. 2009. Termination criteria for solving concurrent safety and reachability games. SODA: Symposium on Discrete Algorithms 197–206.
View | Files available | DOI | Download (ext.)
 
[57]
2009 | Technical Report | IST-REx-ID: 5395   OA
Chatterjee K, Doyen L, Henzinger TA. 2009. Qualitative analysis of partially-observable Markov decision processes, IST Austria, 20p.
View | Files available | DOI
 
[56]
2008 | Conference Paper | IST-REx-ID: 3876
Chatterjee K, Henzinger TA, Prabhu V. 2008. Timed parity games: complexity and robustness. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 5215. 124–140.
View | Files available | DOI
 
[55]
2008 | Conference Paper | IST-REx-ID: 3504
Chatterjee K, De Alfaro L, Majumdar R, Raman V. 2008. Algorithms for game metrics. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 2. 107–118.
View | Files available | DOI
 
[54]
2008 | Conference Paper | IST-REx-ID: 3877
Chatterjee K, Henzinger TA, Jobstmann B. 2008. Environment assumptions for synthesis. CONCUR: Concurrency Theory, LNCS, vol. 5201. 147–161.
View | DOI
 
[53]
2008 | Book Chapter | IST-REx-ID: 3872
Chatterjee K, Henzinger TA. 2008. Value iteration. 25 Years in Model Checking. , LNCS, vol. 5000. 107–138.
View | DOI
 
[52]
2008 | Journal Article | IST-REx-ID: 4534
Chatterjee K, Henzinger TA. 2008. Reduction of stochastic parity to stochastic mean-payoff games. Information Processing Letters. 106(1), 1–7.
View | DOI | Download (ext.)
 
[51]
2008 | Conference Paper | IST-REx-ID: 4546
Chatterjee K, Ghosal A, Henzinger TA, Iercan D, Kirsch C, Pinello C, Sangiovanni Vincentelli A. 2008. Logical reliability of interacting real-time tasks. DATE: Design, Automation and Test in Europe 909–914.
View | DOI | Download (ext.)
 
[50]
2008 | Conference Paper | IST-REx-ID: 3501
Adler BT, Chatterjee K, De Alfaro L, Faella M, Pye I, Raman V. 2008. Assigning trust to Wikipedia content. WikiSym: International Symposium on Wikis
View | DOI
 
[49]
2008 | Conference Paper | IST-REx-ID: 3873
Chatterjee K, Majumdar R, Henzinger TA. 2008. Controller synthesis with budget constraints. HSCC: Hybrid Systems - Computation and Control, LNCS, vol. 4981. 72–86.
View | DOI
 
[48]
2008 | Conference Paper | IST-REx-ID: 3878   OA
Chatterjee K, De Alfaro L, Majumdar R. 2008. The complexity of coverage. APLAS: Asian Symposium on Programming Languages and Systems, LNCS, vol. 5356. 91–106.
View | DOI | Download (ext.)
 
[47]
2008 | Conference Paper | IST-REx-ID: 3880
Berwanger D, Chatterjee K, Doyen L, Henzinger TA, Raje S. 2008. Strategy construction for parity games with imperfect information. CONCUR: Concurrency Theory, LNCS, vol. 5201. 325–339.
View | Files available | DOI
 
[46]
2008 | Conference Paper | IST-REx-ID: 3502
Chatterjee K, De Alfaro L, Pye I. 2008. Robust content-driven reputation. AISec: Artificial Intelligence and Security 33–42.
View | DOI
 
[45]
2008 | Conference Paper | IST-REx-ID: 3874
Chatterjee K, Henzinger TA, Prabhu V. 2008. Trading infinite memory for uniform randomness in timed games. HSCC: Hybrid Systems - Computation and Control, LNCS, vol. 4981. 87–100.
View | DOI
 
[44]
2008 | Conference Paper | IST-REx-ID: 3879
Chatterjee K, Doyen L, Henzinger TA. 2008. Quantitative languages. CSL: Computer Science Logic, LNCS, vol. 5213. 385–400.
View | DOI
 
[43]
2008 | Journal Article | IST-REx-ID: 4548
Chatterjee K, Majumdar R, Henzinger TA. 2008. Stochastic limit-average games are in EXPTIME. International Journal of Game Theory. 37(2), 219–234.
View | DOI | Download (ext.)
 
[42]
2008 | Conference Paper | IST-REx-ID: 3875
Chatterjee K, Henzinger TA, Sen K. 2008. Model-checking omega-regular properties of interval Markov chains. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 4962. 302–317.
View | DOI
 
[41]
2007 | Conference Paper | IST-REx-ID: 3883
Chatterjee K, Henzinger TA, Piterman N. 2007. Generalized parity games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 4423. 153–167.
View | DOI
 
[40]
2007 | Conference Paper | IST-REx-ID: 3884
Chatterjee K, Henzinger TA, Piterman N. 2007. Strategy logic. CONCUR: Concurrency Theory, LNCS, vol. 4703. 59–73.
View | Files available | DOI
 
[39]
2007 | Conference Paper | IST-REx-ID: 3885
Chatterjee K. 2007. Optimal strategy synthesis in stochastic Müller games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS , vol. 4423. 138–152.
View | DOI
 
[38]
2007 | Journal Article | IST-REx-ID: 4547
Chatterjee K, Doyen L, Henzinger TA, Raskin J. 2007. Algorithms for omega-regular games with imperfect information. Logical Methods in Computer Science. 3(184), 1–23.
View | DOI
 
[37]
2007 | Thesis | IST-REx-ID: 4559
Chatterjee K. 2007. Stochastic ω-Regular Games, University of California, Berkeley,p.
View | Download (ext.)
 
[36]
2007 | Conference Paper | IST-REx-ID: 3886
Chatterjee K. 2007. Stochastic Müller games are PSPACE-complete. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LNCS, vol. 4855. 436–448.
View | DOI
 
[35]
2007 | Conference Paper | IST-REx-ID: 3881
De Alfaro L, Chatterjee K, Faella M, Legay A. 2007. Qualitative logics and equivalences for probabilistic systems. QEST: Quantitative Evaluation of Systems 237–248.
View | DOI
 
[34]
2007 | Conference Paper | IST-REx-ID: 3887
Chatterjee K. 2007. Markov decision processes with multiple long-run average objectives. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LNCS , vol. 4855. 473–484.
View | DOI
 
[33]
2007 | Journal Article | IST-REx-ID: 3882
Chatterjee K. 2007. Concurrent games with tail objectives. Theoretical Computer Science. 388(1–3), 181–198.
View | DOI
 
[32]
2007 | Conference Paper | IST-REx-ID: 4537
Chatterjee K, Henzinger TA. 2007. Assume-guarantee synthesis. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 4424. 261–275.
View | DOI
 
[31]
2006 | Conference Paper | IST-REx-ID: 3888
Chatterjee K, Henzinger TA. 2006. Strategy improvement for stochastic Rabin and Streett games. CONCUR: Concurrency Theory, LNCS, vol. 4137. 375–389.
View | DOI
 
[30]
2006 | Conference Paper | IST-REx-ID: 3890
Chatterjee K, De Alfaro L, Henzinger TA. 2006. The complexity of quantitative concurrent parity games. SODA: Symposium on Discrete Algorithms 678–687.
View | DOI
 
[29]
2006 | Conference Paper | IST-REx-ID: 4552
Chatterjee K, De Alfaro L, Henzinger TA. 2006. Strategy improvement for concurrent reachability games. QEST: Quantitative Evaluation of Systems 291–300.
View | DOI
 
[28]
2006 | Conference Paper | IST-REx-ID: 4538
Chatterjee K, Henzinger TA. 2006. Strategy improvement and randomized subexponential algorithms for stochastic parity games. STACS: Theoretical Aspects of Computer Science, LNCS, vol. 3884. 512–523.
View | DOI
 
[27]
2006 | Conference Paper | IST-REx-ID: 3500
Chatterjee K, Henzinger TA, Piterman N. 2006. Algorithms for Büchi Games. GDV: Games in Design and Verification
View | Download (ext.)
 
[26]
2006 | Conference Paper | IST-REx-ID: 3889
Chatterjee K, Doyen L, Henzinger TA, Raskin J. 2006. Algorithms for omega-regular games with imperfect information. CSL: Computer Science Logic, LNCS, vol. 4207. 287–302.
View | DOI
 
[25]
2006 | Conference Paper | IST-REx-ID: 3891
Chatterjee K. 2006. Concurrent games with tail objectives. CSL: Computer Science Logic, LNCS , vol. 4207. 256–270.
View | DOI
 
[24]
2006 | Conference Paper | IST-REx-ID: 4539
Chatterjee K, Henzinger TA. 2006. Finitary winning in omega-regular games. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 3920. 257–271.
View | DOI
 
[23]
2006 | Conference Paper | IST-REx-ID: 3449
Chatterjee K, Jagadeesan R, Pitcher C. 2006. Games for controls. CSF: Computer Security Foundations 70–82.
View | DOI
 
[22]
2006 | Conference Paper | IST-REx-ID: 3499
Chatterjee K. 2006. Nash equilibrium for upward-closed objectives. CSL: Computer Science Logic, LNCS , vol. 4207. 271–286.
View | DOI
 
[21]
2006 | Journal Article | IST-REx-ID: 4550
Chatterjee K, Henzinger TA, Jurdziński M. 2006. Games with secure equilibria. Theoretical Computer Science. 365(1–2), 67–82.
View | DOI
 
[20]
2006 | Conference Paper | IST-REx-ID: 4549
Chatterjee K, De Alfaro L, Faella M, Henzinger TA, Majumdar R, Stoelinga M. 2006. Compositional quantitative reasoning. QEST: Quantitative Evaluation of Systems 179–188.
View | DOI
 
[19]
2006 | Conference Paper | IST-REx-ID: 4551
Chatterjee K, Majumdar R, Henzinger TA. 2006. Markov decision processes with multiple objectives. STACS: Theoretical Aspects of Computer Science, LNCS, vol. 3884. 325–336.
View | DOI
 
[18]
2005 | Conference Paper | IST-REx-ID: 4557
Chatterjee K, Henzinger TA, Jhala R, Majumdar R. 2005. Counterexample-guided planning. UAI: Uncertainty in Artificial Intelligence 104–111.
View | Download (ext.)
 
[17]
2005 | Conference Paper | IST-REx-ID: 3896
Chatterjee K, Dasgupta P, Chakrabarti P. 2005. Complexity of compositional model checking of computation tree logic on simple structures. IWDC: International Workshop on Distributed Computing , LNCS, vol. 3326. 89–102.
View | DOI
 
[16]
2005 | Conference Paper | IST-REx-ID: 4541
Chatterjee K, Henzinger TA. 2005. Semiperfect-information games. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LNCS, vol. 3821. 1–18.
View | DOI
 
[15]
2005 | Conference Paper | IST-REx-ID: 4553
Chatterjee K, De Alfaro L, Henzinger TA. 2005. The complexity of stochastic Rabin and Streett games. ICALP: Automata, Languages and Programming, LNCS, vol. 3580. 878–890.
View | DOI
 
[14]
2005 | Conference Paper | IST-REx-ID: 4560
Chakrabarti A, Chatterjee K, Henzinger TA, Kupferman O, Majumdar R. 2005. Verifying quantitative properties using bound functions. CHARME: Correct Hardware Design and Verification Methods, LNCS, vol. 3725. 50–64.
View | DOI
 
[13]
2005 | Conference Paper | IST-REx-ID: 3892
Chatterjee K, Henzinger TA, Jurdziński M. 2005. Games with secure equilibria. FMCO: Formal Methods for Components and Objects, LNCS, vol. 3657. 141–161.
View | DOI
 
[12]
2005 | Conference Paper | IST-REx-ID: 4554
Chatterjee K, Henzinger TA, Jurdziński M. 2005. Mean-payoff parity games. LICS: Logic in Computer Science 178–187.
View | DOI
 
[11]
2005 | Conference Paper | IST-REx-ID: 3893
Chatterjee K. 2005. Two-player nonzero-sum ω-regular games. CONCUR: Concurrency Theory, LNCS , vol. 3653. 413–427.
View | DOI
 
[10]
2004 | Conference Paper | IST-REx-ID: 3895
Chatterjee K, Henzinger TA, Jurdziński M. 2004. Games with secure equilibria. LICS: Logic in Computer Science 160–169.
View | DOI
 
[9]
2004 | Conference Paper | IST-REx-ID: 4558
Chatterjee K, Jurdziński M, Henzinger TA. 2004. Quantitative stochastic parity games. SODA: Symposium on Discrete Algorithms 121–130.
View
 
[8]
2004 | Conference Paper | IST-REx-ID: 4555
Chatterjee K, De Alfaro L, Henzinger TA. 2004. Trading memory for randomness. QEST: Quantitative Evaluation of Systems 206–217.
View | DOI
 
[7]
2004 | Conference Paper | IST-REx-ID: 3894
Chatterjee K, Majumdar R, Jurdziński M. 2004. On Nash equilibria in stochastic games. CSL: Computer Science Logic, LNCS , vol. 3210. 26–40.
View | DOI
 
[6]
2004 | Journal Article | IST-REx-ID: 4556
Chatterjee K, Ma D, Majumdar R, Zhao T, Henzinger TA, Palsberg J. 2004. Stack size analysis for interrupt-driven programs. Information and Computation. 194(2), 144–174.
View | DOI
 
[5]
2003 | Journal Article | IST-REx-ID: 3593
Chatterjee K, Dasgupta P, Chakrabarti P. 2003. A branching time temporal framework for quantitative reasoning. Journal of Automated Reasoning. 30(2), 205–232.
View | DOI
 
[4]
2003 | Conference Paper | IST-REx-ID: 3897
Chatterjee K, Jurdziński M, Henzinger TA. 2003. Simple stochastic parity games. CSL: Computer Science Logic, LNCS, vol. 2803. 100–113.
View | DOI
 
[3]
2003 | Conference Paper | IST-REx-ID: 3898
Chatterjee K, Ma D, Majumdar R, Zhao T, Henzinger TA, Palsberg J. 2003. Stack size analysis for interrupt-driven programs. SAS: Static Analysis Symposium, LNCS, vol. 2694. 109–126.
View | DOI
 
[2]
2002 | Conference Paper | IST-REx-ID: 3448
Mallick S, Chatterjee K, Merchant A, Dasgupta P. 2002. Implementation of shape grammar for plan analysis. IT-Built: Information Technology For Built Environment
View
 
[1]
2001 | Conference Paper | IST-REx-ID: 3447
Chatterjee K, Dasgupta P, Chakrabarti P. 2001. Weighted quantified computation tree logic. CIT: Conference on Information Technology
View
 

Search

Filter Publications

Display / Sort

Citation Style: IST Annual Report

Export / Embed

342 Publications

Mark all

[342]
2019 | Conference Paper | IST-REx-ID: 6490
Chatterjee K, Goharshady AK, Goharshady EK. The treewidth of smart contracts. Proceedings of the 34th ACM Symposium on Applied Computing. SAC: Symposium on Applied Computing vol. Part F147772. 400–408.
View | DOI
 
[341]
2019 | Conference Paper | IST-REx-ID: 5948
Fu H, Chatterjee K. 2019. Termination of nondeterministic probabilistic programs (eds. C. Enea & R. Piskac). 11388, 468–490.
View | DOI
 
[340]
2019 | Conference Paper | IST-REx-ID: 6175   OA
Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. Cost analysis of nondeterministic probabilistic programs. 40th ACM Conference on Programming Language Design and Implementation (PLDI 2019). 40th ACM Conference on Programming Language Design and Implementation
View | Files available | arXiv
 
[339]
2019 | Conference Paper | IST-REx-ID: 6056   OA
Chatterjee K, Goharshady AK, Pourdamghani A. Probabilistic smart contracts: Secure randomness on the blockchain. IEEE International Conference on Blockchain and Cryptocurrency. IEEE International Conference on Blockchain and Cryptocurrency
View | Files available | Download (ext.) | arXiv
 
[338]
2019 | Journal Article | IST-REx-ID: 6380   OA
Chatterjee K, Goharshady AK, Okati N, Pavlogiannis A. 2019. Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages. 3(POPL), 53.
View | Files available | DOI
 
[337]
2019 | Conference Paper | IST-REx-ID: 6378   OA
Chatterjee K, Goharshady AK, Pourdamghani A. Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. Proceedings of the 34th ACM Symposium on Applied Computing. ACM Symposium on Applied Computing vol. Part F147772. 374–381.
View | Files available | DOI
 
[336]
2019 | Conference Paper | IST-REx-ID: 6462   OA
Avni G, Bloem R, Chatterjee K, Henzinger TA, Konighofer B, Pranger S. 2019. Run-time optimization for learned controllers through quantitative games. 31st International Conference on Computer-Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 11561. 630–649.
View | Files available | DOI
 
[335]
2019 | Conference Paper | IST-REx-ID: 6780   OA
Huang M, Fu H, Chatterjee K, Goharshady AK. Modular verification for almost-sure termination of probabilistic programs. Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications . OOPSLA: Object-oriented Programming, Systems, Languages and Applications
View | Files available | Download (ext.) | arXiv
 
[334]
2018 | Conference Paper | IST-REx-ID: 143   OA
Brázdil T, Chatterjee K, Kučera A, Novotny P, Velan D, Zuleger F. 2018. Efficient algorithms for asymptotic bounds on termination time in VASS. LICS: Logic in Computer Science, ACM/IEEE Symposium on Logic in Computer Science, vol. F138033. 185–194.
View | DOI | Download (ext.)
 
[333]
2018 | Journal Article | IST-REx-ID: 198   OA
Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. 2018. Language acquisition with communication between learners. Journal of the Royal Society Interface. 15(140).
View | Files available | DOI
 
[332]
2018 | Conference Paper | IST-REx-ID: 35   OA
Chatterjee K, Dvorák W, Henzinger M, Svozil A. 2018. Algorithms and conditional lower bounds for planning problems. 28th International Conference on Automated Planning and Scheduling . ICAPS: International Conference on Automated Planning and Scheduling
View | Download (ext.) | arXiv
 
[331]
2018 | Book Chapter | IST-REx-ID: 59
Bloem R, Chatterjee K, Jobstmann B. 2018. Graph games and reactive synthesis. Handbook of Modeling Checking. 921–962.
View | DOI
 
[330]
2018 | Conference Paper | IST-REx-ID: 66   OA
Chatterjee K, Goharshady A, Ibsen-Jensen R, Velner Y. 2018. Ergodic mean-payoff games for the analysis of attacks in crypto-currencies. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 118. 11.
View | Files available | DOI | Download (ext.) | arXiv
 
[329]
2018 | Conference Paper | IST-REx-ID: 24   OA
Chatterjee K, Elgyütt A, Novotny P, Rouillé O. 2018. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018. 4692–4699.
View | DOI | Download (ext.) | arXiv
 
[328]
2018 | Conference Paper | IST-REx-ID: 310   OA
Chatterjee K, Dvorák W, Henzinger M, Loitzenbauer V. 2018. Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety and diameter. SODA: Symposium on Discrete Algorithms, SODA, 2341–2356.
View | DOI | Download (ext.) | arXiv
 
[327]
2018 | Journal Article | IST-REx-ID: 6009   OA
Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. 2018. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. ACM Transactions on Programming Languages and Systems. 40(3), 9.
View | Files available | DOI | Download (ext.) | arXiv
 
[326]
2018 | Journal Article | IST-REx-ID: 5993   OA
Chatterjee K, Fu H, Novotný P, Hasheminezhad R. 2018. Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs. ACM Transactions on Programming Languages and Systems. 40(2), 7.
View | Files available | DOI | Download (ext.) | arXiv
 
[325]
2018 | Conference Paper | IST-REx-ID: 6340   OA
Goharshady AK, Behrouz A, Chatterjee K. 2018. Secure Credit Reporting on the Blockchain. Proceedings of the IEEE International Conference on Blockchain. IEEE International Conference on Blockchain 1343–1348.
View | Files available | arXiv
 
[324]
2018 | Conference Paper | IST-REx-ID: 79   OA
Arming S, Bartocci E, Chatterjee K, Katoen JP, Sokolova A. 2018. Parameter-independent strategies for pMDPs via POMDPs. QEST: Quantitative Evaluation of Systems, LNCS, vol. 11024. 53–70.
View | DOI | Download (ext.) | arXiv
 
[323]
2018 | Journal Article | IST-REx-ID: 738   OA
Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. 2018. Automated competitive analysis of real time scheduling with graph games. Real-Time Systems. 54(1), 166–207.
View | Files available | DOI
 
[322]
2018 | Book Chapter | IST-REx-ID: 86
Chatterjee K, Henzinger TA, Otop J. 2018. Computing average response time. Principles of Modeling. , LNCS, vol. 10760. 143–161.
View | DOI
 
[321]
2018 | Journal Article | IST-REx-ID: 454   OA
Reiter J, Hilbe C, Rand D, Chatterjee K, Nowak M. 2018. Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness. Nature Communications. 9(1), 555.
View | Files available | DOI
 
[320]
2018 | Journal Article | IST-REx-ID: 157
Hilbe C, Šimsa Š, Chatterjee K, Nowak M. 2018. Evolution of cooperation in stochastic games. Nature. 559(7713), 246–249.
View | Files available | DOI
 
[319]
2018 | Conference Paper | IST-REx-ID: 25
Horák K, Bošanský B, Chatterjee K. 2018. Goal-HSVI: Heuristic search value iteration for goal-POMDPs. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018–July. 4764–4770.
View | DOI
 
[318]
2018 | Conference Paper | IST-REx-ID: 311   OA
Chatterjee K, Goharshady A, Velner Y. 2018. Quantitative analysis of smart contracts. ESOP: European Symposium on Programming, LNCS., vol. 10801. 739–767.
View | Files available | DOI
 
[317]
2018 | Conference Paper | IST-REx-ID: 141   OA
Chatterjee K, Henzinger M, Loitzenbauer V, Oraee S, Toman V. 2018. Symbolic algorithms for graphs and Markov decision processes with fairness objectives. CAV: Computer Aided Verification, LNCS, vol. 10982. 178–197.
View | Files available | DOI
 
[316]
2018 | Journal Article | IST-REx-ID: 2   OA
Hilbe C, Schmid L, Tkadlec J, Chatterjee K, Nowak M. 2018. Indirect reciprocity with private noisy and incomplete information. PNAS. 115(48), 12241–12246.
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 
[315]
2018 | Conference Paper | IST-REx-ID: 297   OA
Brázdil T, Chatterjee K, Kretinsky J, Toman V. 2018. Strategy representation by decision trees in reactive synthesis. TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 10805. 385–407.
View | Files available | DOI
 
[314]
2018 | Conference Paper | IST-REx-ID: 325   OA
Agrawal S, Chatterjee K, Novotny P. 2018. Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. POPL: Principles of Programming Languages vol. 2.
View | DOI | Download (ext.) | arXiv
 
[313]
2018 | Conference Paper | IST-REx-ID: 34   OA
Chatterjee K, Chemlík M, Topcu U. 2018. Sensor synthesis for POMDPs with reachability objectives. ICAPS: International Conference on Automated Planning and Scheduling, ICAPS, vol. 2018. 47–55.
View | Download (ext.) | arXiv
 
[312]
2018 | Journal Article | IST-REx-ID: 419
Hilbe C, Chatterjee K, Nowak M. 2018. Partners and rivals in direct reciprocity. Nature Human Behaviour. 2, 469–477.
View | Files available | DOI
 
[311]
2018 | Conference Paper | IST-REx-ID: 5679   OA
Huang M, Fu H, Chatterjee K. 2018. New approaches for almost-sure termination of probabilistic programs. 16th Asian Symposium on Programming Languages and Systems, APLAS, LNCS, vol. 11275. 181–201.
View | DOI | Download (ext.) | arXiv
 
[310]
2018 | Preprint | IST-REx-ID: 5977   OA
Chatterjee K, Fu H, Goharshady A, Okati N. Computational Approaches for Stochastic Shortest Path on Succinct MDPs. ArXiv.
View | Download (ext.) | arXiv
 
[309]
2018 | Journal Article | IST-REx-ID: 5751   OA
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak MA. 2018. Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory. Communications Biology. 1(1), 71.
View | Files available | DOI
 
[308]
2017 | Journal Article | IST-REx-ID: 1065
Chatterjee K, Osang GF. 2017. Pushdown reachability with constant treewidth. Information Processing Letters. 122, 25–29.
View | Files available | DOI
 
[307]
2017 | Journal Article | IST-REx-ID: 1407
Svoreňová M, Kretinsky J, Chmelik M, Chatterjee K, Cěrná I, Belta C. 2017. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Nonlinear Analysis: Hybrid Systems. 23(2), 230–253.
View | Files available | DOI | Download (ext.)
 
[306]
2017 | Journal Article | IST-REx-ID: 465
Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2017. Edit distance for pushdown automata. Logical Methods in Computer Science. 13(3).
View | Files available | DOI
 
[305]
2017 | Journal Article | IST-REx-ID: 681   OA
Chatterjee K, Doyen L, Filiot E, Raskin J. 2017. Doomsday equilibria for omega-regular games. Information and Computation. 254, 296–315.
View | DOI | Download (ext.)
 
[304]
2017 | Journal Article | IST-REx-ID: 744
Priklopil T, Chatterjee K, Nowak M. 2017. Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma. Journal of Theoretical Biology. 433, 64–72.
View | DOI
 
[303]
2017 | Conference Paper | IST-REx-ID: 1009   OA
Chatterjee K, Novotny P, Pérez G, Raskin J, Zikelic D. 2017. Optimizing expectation with guarantees in POMDPs. Proceedings of the 31st AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 5. 3725–3732.
View | Download (ext.)
 
[302]
2017 | Conference Paper | IST-REx-ID: 1011   OA
Chatterjee K, Kragl B, Mishra S, Pavlogiannis A. 2017. Faster algorithms for weighted recursive state machines. ESOP: European Symposium on Programming, LNCS, vol. 10201. 287–313.
View | DOI | Download (ext.)
 
[301]
2017 | Journal Article | IST-REx-ID: 1080   OA
Reiter J, Makohon Moore A, Gerold J, Božić I, Chatterjee K, Iacobuzio Donahue C, Vogelstein B, Nowak M. 2017. Reconstructing metastatic seeding patterns of human cancers. Nature Communications. 8.
View | Files available | DOI
 
[300]
2017 | Journal Article | IST-REx-ID: 1294
Brázdil T, Chatterjee K, Forejt V, Kučera A. 2017. Trading performance for stability in Markov decision processes. Journal of Computer and System Sciences. 84, 144–170.
View | Files available | DOI
 
[299]
2017 | Journal Article | IST-REx-ID: 466
Chatterjee K, Křetínská Z, Kretinsky J. 2017. Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. 13(2), 15.
View | Files available | DOI
 
[298]
2017 | Journal Article | IST-REx-ID: 1066
Chatterjee K, Henzinger TA, Otop J, Velner Y. 2017. Quantitative fair simulation games. Information and Computation. 254(2), 143–166.
View | Files available | DOI
 
[297]
2017 | Journal Article | IST-REx-ID: 512
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2017. Amplification on undirected population structures: Comets beat stars. Scientific Reports. 7(1).
View | Files available | DOI
 
[296]
2017 | Technical Report | IST-REx-ID: 5455   OA
Chatterjee K, Choudhary B, Pavlogiannis A. 2017. Optimal Dyck reachability for data-dependence and alias analysis, IST Austria, 37p.
View | Files available | DOI
 
[295]
2017 | Book Chapter | IST-REx-ID: 625
Chatterjee K, Doyen L, Henzinger TA. 2017. The cost of exactness in quantitative reachability. Models, Algorithms, Logics and Tools. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), LNCS, vol. 10460. 367–381.
View | DOI
 
[294]
2017 | Journal Article | IST-REx-ID: 719
Chatterjee K, Ehlers R. 2017. Special issue: Synthesis and SYNT 2014. Acta Informatica. 54(6), 543–544.
View | DOI
 
[293]
2017 | Conference Paper | IST-REx-ID: 1194   OA
Chatterjee K, Novotny P, Zikelic D. 2017. Stochastic invariants for probabilistic termination. POPL: Principles of Programming Languages, ACM SIGPLAN Notices, vol. 52. 145–160.
View | DOI | Download (ext.)
 
[292]
2017 | Journal Article | IST-REx-ID: 467
Chatterjee K, Henzinger TA, Otop J. 2017. Nested weighted automata. ACM Transactions on Computational Logic (TOCL). 18(4), 31.
View | Files available | DOI | Download (ext.) | arXiv
 
[291]
2017 | Technical Report | IST-REx-ID: 5456   OA
Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. 2017. Data-centric dynamic partial order reduction, IST Austria, 36p.
View | Files available | DOI
 
[290]
2017 | Conference Paper | IST-REx-ID: 551   OA
Chatterjee K, Ibsen-Jensen R, Nowak M. 2017. Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83.
View | Files available | DOI
 
[289]
2017 | Conference Paper | IST-REx-ID: 645   OA
Ashok P, Chatterjee K, Daca P, Kretinsky J, Meggendorfer T. 2017. Value iteration for long run average reward in markov decision processes. CAV: Computer Aided Verification, LNCS, vol. 10426. 201–221.
View | DOI | Download (ext.)
 
[288]
2017 | Journal Article | IST-REx-ID: 671   OA
Hilbe C, Martinez V, Chatterjee K, Nowak M. 2017. Memory-n strategies of direct reciprocity. PNAS. 114(18), 4715–4720.
View | DOI | Download (ext.) | PubMed | Europe PMC
 
[287]
2017 | Conference Paper | IST-REx-ID: 552   OA
Chatterjee K, Henzinger M, Svozil A. 2017. Faster algorithms for mean payoff parity games. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83.
View | Files available | DOI
 
[286]
2017 | Conference Paper | IST-REx-ID: 639   OA
Chatterjee K, Fu H, Goharshady A. 2017. Non-polynomial worst case analysis of recursive programs. CAV: Computer Aided Verification, LNCS, vol. 10427. 41–63.
View | DOI | Download (ext.)
 
[285]
2017 | Journal Article | IST-REx-ID: 653
Makohon Moore A, Zhang M, Reiter J, Božić I, Allen B, Kundu D, Chatterjee K, Wong F, Jiao Y, Kohutek Z, Hong J, Attiyeh M, Javier B, Wood L, Hruban R, Nowak M, Papadopoulos N, Kinzler K, Vogelstein B, Iacobuzio Donahue C. 2017. Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. Nature Genetics. 49(3), 358–366.
View | DOI
 
[284]
2017 | Journal Article | IST-REx-ID: 684   OA
Chatterjee K, Piterman N. 2017. Obligation blackwell games and p-automata. Journal of Symbolic Logic. 82(2), 420–452.
View | DOI | Download (ext.)
 
[283]
2017 | Conference Paper | IST-REx-ID: 711   OA
Chatterjee K, Henzinger TA, Otop J. 2017. Bidirectional nested weighted automata. 28th International Conference on Concurrency Theory, CONCUR, LIPIcs, vol. 85.
View | Files available | DOI
 
[282]
2017 | Journal Article | IST-REx-ID: 716
Chatterjee K, Velner Y. 2017. The complexity of mean-payoff pushdown games. Journal of the ACM. 64(5), 34.
View | DOI
 
[281]
2017 | Conference Paper | IST-REx-ID: 949   OA
Chatterjee K, Goharshady A, Pavlogiannis A. 2017. JTDec: A tool for tree decompositions in soot. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 10482. 59–66.
View | Files available | DOI
 
[280]
2017 | Journal Article | IST-REx-ID: 464   OA
Chatterjee K, Henzinger M, Loitzenbauer V. 2017. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 13(3).
View | Files available | DOI
 
[279]
2017 | Conference Paper | IST-REx-ID: 553   OA
Chatterjee K, Hansen K, Ibsen-Jensen R. 2017. Strategy complexity of concurrent safety games. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83.
View | Files available | DOI | Download (ext.)
 
[278]
2017 | Conference Paper | IST-REx-ID: 628   OA
Chatterjee K, Fu H, Murhekar A. 2017. Automated recurrence analysis for almost linear expected runtime bounds. CAV: Computer Aided Verification, LNCS, vol. 10426. 118–139.
View | DOI | Download (ext.)
 
[277]
2017 | Conference Paper | IST-REx-ID: 6519   OA
Chatterjee K, Dvorák W, Henzinger M, Loitzenbauer V. 2017. Improved set-based symbolic algorithms for parity games. CSL: Conference on Computer Science Logic vol. 82. 18.
View | Files available | DOI
 
[276]
2017 | Journal Article | IST-REx-ID: 717   OA
Chatterjee K, Velner Y. 2017. Hyperplane separation technique for multidimensional mean-payoff games. Journal of Computer and System Sciences. 88, 236–259.
View | Files available | DOI | Download (ext.)
 
[275]
2017 | Research Data | IST-REx-ID: 5559
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2017. Strong amplifiers of natural selection, IST Austria,p.
View | Files available | DOI
 
[274]
2016 | Conference Paper | IST-REx-ID: 1166
Chatterjee K, Chmelik M, Davies J. 2016. A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps. Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 2016. 3225–3232.
View | Files available
 
[273]
2016 | Conference Paper | IST-REx-ID: 1438
Chatterjee K, Fu H, Novotny P, Hasheminezhad R. 2016. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. POPL: Principles of Programming Languages, POPL, vol. 20–22. 327–342.
View | Files available | DOI | Download (ext.) | arXiv
 
[272]
2016 | Conference Paper | IST-REx-ID: 478   OA
Chatterjee K, Ibsen-Jensen R. 2016. The complexity of deciding legality of a single step of magic: The gathering. ECAI: European Conference on Artificial Intelligence, Frontiers in Artificial Intelligence and Applications, vol. 285. 1432–1439.
View | Files available | DOI
 
[271]
2016 | Conference Paper | IST-REx-ID: 480   OA
Chatterjee K, Doyen L. 2016. Perfect-information stochastic games with generalized mean-payoff objectives. LICS: Logic in Computer Science, Proceedings Symposium on Logic in Computer Science, vol. 05-08-July-2016. 247–256.
View | DOI | Download (ext.)
 
[270]
2016 | Journal Article | IST-REx-ID: 1477
Chatterjee K, Chmelik M, Tracol M. 2016. What is decidable about partially observable Markov decision processes with ω-regular objectives. Journal of Computer and System Sciences. 82(5), 878–911.
View | Files available | DOI | Download (ext.) | arXiv
 
[269]
2016 | Conference Paper | IST-REx-ID: 1182   OA
Chatterjee K, Ibsen-Jensen R, Tkadlec J. 2016. Robust draws in balanced knockout tournaments. IJCAI: International Joint Conference on Artificial Intelligence vol. 2016–January. 172–179.
View | Files available | Download (ext.)
 
[268]
2016 | Conference Paper | IST-REx-ID: 1245
Pandey V, Chatterjee K. 2016. Game-theoretic models identify useful principles for peer collaboration in online learning platforms. Proceedings of the ACM Conference on Computer Supported Cooperative Work. CSCW: Computer Supported Cooperative Work and Social Computing vol. 26. 365–368.
View | DOI
 
[267]
2016 | Conference Paper | IST-REx-ID: 1327   OA
Brázdil T, Chatterjee K, Chmelik M, Gupta A, Novotny P. 2016. Stochastic shortest path with energy constraints in POMDPs. Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems. AAMAS: Autonomous Agents & Multiagent Systems 1465–1466.
View | Download (ext.)
 
[266]
2016 | Journal Article | IST-REx-ID: 1529
Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2016. Optimal cost almost-sure reachability in POMDPs. Artificial Intelligence. 234, 26–48.
View | Files available | DOI | Download (ext.) | arXiv
 
[265]
2016 | Technical Report | IST-REx-ID: 5449   OA
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Amplification on undirected population structures: Comets beat stars, IST Austria, 22p.
View | Files available | DOI
 
[264]
2016 | Technical Report | IST-REx-ID: 5451   OA
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Strong amplifiers of natural selection, IST Austria, 34p.
View | Files available | DOI
 
[263]
2016 | Conference Paper | IST-REx-ID: 1068   OA
Chatterjee K, Dvorák W, Henzinger M, Loitzenbauer V. 2016. Conditionally optimal algorithms for generalized Büchi Games. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 58.
View | Files available | DOI
 
[262]
2016 | Conference Paper | IST-REx-ID: 1070   OA
Chatterjee K, Doyen L. 2016. Computation tree logic for synchronization properties. ICALP: Automata, Languages and Programming, LIPIcs, vol. 55.
View | Files available | DOI
 
[261]
2016 | Conference Paper | IST-REx-ID: 1138   OA
Chatterjee K, Henzinger TA, Otop J. 2016. Quantitative automata under probabilistic semantics. Proceedings of the 31st Annual ACM/IEEE Symposium. LICS: Logic in Computer Science 76–85.
View | DOI | Download (ext.)
 
[260]
2016 | Conference Paper | IST-REx-ID: 1140   OA
Chatterjee K, Dvoák W, Henzinger M, Loitzenbauer V. 2016. Model and objective separation with conditional lower bounds disjunction is harder than conjunction. Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, Proceedings Symposium on Logic in Computer Science, 197–206.
View | DOI | Download (ext.)
 
[259]
2016 | Conference Paper | IST-REx-ID: 1335   OA
Chatterjee K, Henzinger TA, Otop J. 2016. Quantitative monitor automata. SAS: Static Analysis Symposium, LNCS, vol. 9837. 23–38.
View | DOI | Download (ext.)
 
[258]
2016 | Technical Report | IST-REx-ID: 5445   OA
Chatterjee K, Pavlogiannis A, Velner Y. 2016. Quantitative interprocedural analysis, IST Austria, 33p.
View | Files available | DOI
 
[257]
2016 | Technical Report | IST-REx-ID: 5452
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Arbitrarily strong amplifiers of natural selection, IST Austria, 32p.
View | Files available | DOI
 
[256]
2016 | Conference Paper | IST-REx-ID: 1090   OA
Chatterjee K, Henzinger TA, Otop J. 2016. Nested weighted limit-average automata of bounded width. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 58.
View | Files available | DOI
 
[255]
2016 | Conference Paper | IST-REx-ID: 1324
Chatterjee K, Chmelik M. 2016. Indefinite-horizon reachability in Goal-DEC-POMDPs. Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling. ICAPS: International Conference on Automated Planning and Scheduling vol. 2016–January. 88–96.
View | Download (ext.)
 
[254]
2016 | Conference Paper | IST-REx-ID: 1386   OA
Chatterjee K, Fu H, Goharshady A. 2016. Termination analysis of probabilistic programs through Positivstellensatz’s. CAV: Computer Aided Verification, LNCS, vol. 9779. 3–22.
View | DOI | Download (ext.)
 
[253]
2016 | Technical Report | IST-REx-ID: 5453   OA
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Arbitrarily strong amplifiers of natural selection, IST Austria, 34p.
View | Files available | DOI
 
[252]
2016 | Conference Paper | IST-REx-ID: 1071
Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2016. Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs. ESA: European Symposium on Algorithms, LIPIcs, vol. 57.
View | Files available | DOI
 
[251]
2016 | Conference Paper | IST-REx-ID: 1437
Chatterjee K, Goharshady A, Ibsen-Jensen R, Pavlogiannis A. 2016. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. POPL: Principles of Programming Languages, POPL, vol. 20–22. 733–747.
View | Files available | DOI | Download (ext.) | arXiv
 
[250]
2015 | Conference Paper | IST-REx-ID: 1609   OA
Chatterjee K, Doyen L, Vardi M. 2015. The complexity of synthesis from probabilistic components. 9135, 108–120.
View | DOI | Download (ext.)
 
[249]
2015 | Journal Article | IST-REx-ID: 1673   OA
Adlam B, Chatterjee K, Nowak M. 2015. Amplifiers of selection. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 471(2181), 20150114.
View | Files available | DOI
 
[248]
2015 | Conference Paper | IST-REx-ID: 1820   OA
Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2015. Optimal cost almost-sure reachability in POMDPs. Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence . IAAI: Innovative Applications of Artificial Intelligence, Artifical Intelligence, vol. 5. 3496–3502.
View | Files available | Download (ext.) | arXiv
 
[247]
2015 | Journal Article | IST-REx-ID: 1856
Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2015. Measuring and synthesizing systems in probabilistic environments. Journal of the ACM. 62(1).
View | Files available | DOI | Download (ext.)
 
[246]
2015 | Journal Article | IST-REx-ID: 1731
Chatterjee K, Doyen L, Gimbert H, Henzinger TA. 2015. Randomness for free. Information and Computation. 245(12), 3–16.
View | Files available | DOI | Download (ext.)
 
[245]
2015 | Conference Paper | IST-REx-ID: 1661
Chatterjee K, Henzinger M, Loitzenbauer V. 2015. Improved algorithms for one-pair and k-pair Streett objectives. Proceedings - Symposium on Logic in Computer Science. LICS: Logic in Computer Science vol. 2015–July. 7174888.
View | Files available | DOI | Download (ext.)
 
[244]
2015 | Journal Article | IST-REx-ID: 523   OA
Chatterjee K, Doyen L, Randour M, Raskin J. 2015. Looking at mean-payoff and total-payoff through windows. Information and Computation. 242(6), 25–52.
View | Files available | DOI | Download (ext.)
 
[243]
2015 | Technical Report | IST-REx-ID: 5430
Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2015. Faster algorithms for quantitative verification in constant treewidth graphs, IST Austria, 31p.
View | Files available | DOI
 
[242]
2015 | Technical Report | IST-REx-ID: 5435   OA
Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes, IST Austria, 51p.
View | Files available | DOI
 
[241]
2015 | Journal Article | IST-REx-ID: 1604
Chatterjee K, Pavlogiannis A, Velner Y. 2015. Quantitative interprocedural analysis. Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT . 50(1), 539–551.
View | Files available | DOI
 
[240]
2015 | Journal Article | IST-REx-ID: 1559   OA
Ibsen-Jensen R, Chatterjee K, Nowak M. 2015. Computational complexity of ecological and evolutionary spatial dynamics. PNAS. 112(51), 15636–15641.
View | DOI | Download (ext.) | PubMed | Europe PMC
 
[239]
2015 | Journal Article | IST-REx-ID: 1624   OA
Pavlogiannis A, Chatterjee K, Adlam B, Nowak M. 2015. Cellular cooperation with shift updating and repulsion. Scientific Reports. 5.
View | Files available | DOI
 
[238]
2015 | Journal Article | IST-REx-ID: 1698   OA
Velner Y, Chatterjee K, Doyen L, Henzinger TA, Rabinovich A, Raskin J. 2015. The complexity of multi-mean-payoff and multi-energy games. Information and Computation. 241(4), 177–196.
View | DOI | Download (ext.)
 
[237]
2015 | Journal Article | IST-REx-ID: 1681   OA
Priklopil T, Chatterjee K. 2015. Evolution of decisions in population games with sequentially searching individuals. Games. 6(4), 413–437.
View | Files available | DOI
 
[236]
2015 | Conference Paper | IST-REx-ID: 1838   OA
Bloem R, Chatterjee K, Jacobs S, Könighofer R. 2015. Assume-guarantee synthesis for concurrent reactive programs with partial information. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 9035. 517–532.
View | DOI | Download (ext.)
 
[235]
2015 | Journal Article | IST-REx-ID: 524
Chatterjee K, Ibsen-Jensen R. 2015. Qualitative analysis of concurrent mean payoff games. Information and Computation. 242(6), 2–24.
View | Files available | DOI | Download (ext.) | arXiv
 
[234]
2015 | Conference Paper | IST-REx-ID: 1732
Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2015. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. ICRA: International Conference on Robotics and Automation 325–330.
View | Files available | DOI | Download (ext.) | arXiv
 
[233]
2015 | Technical Report | IST-REx-ID: 5429
Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes, IST Austria, 41p.
View | Files available | DOI
 
[232]
2015 | Technical Report | IST-REx-ID: 5443   OA
Chatterjee K, Chmelik M, Davies J. 2015. A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs, IST Austria, 23p.
View | Files available | DOI
 
[231]
2015 | Technical Report | IST-REx-ID: 5431   OA
Chatterjee K, Ibsen-Jensen R, Hansen K. 2015. The patience of concurrent stochastic games with safety and reachability objectives, IST Austria, 25p.
View | Files available | DOI
 
[230]
2015 | Technical Report | IST-REx-ID: 5436   OA
Chatterjee K, Henzinger TA, Otop J. 2015. Nested weighted automata, IST Austria, 29p.
View | Files available | DOI
 
[229]
2015 | Journal Article | IST-REx-ID: 1694
Chatterjee K, Prabhu V. 2015. Quantitative temporal simulation and refinement distances for timed systems. IEEE Transactions on Automatic Control. 60(9), 2291–2306.
View | DOI
 
[228]
2015 | Conference Paper | IST-REx-ID: 1839   OA
Brázdil T, Chatterjee K, Forejt V, Kučera A. 2015. Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives. 9035, 181–187.
View | DOI | Download (ext.)
 
[227]
2015 | Journal Article | IST-REx-ID: 2034   OA
Bérard B, Chatterjee K, Sznajder N. 2015. Probabilistic opacity for Markov decision processes. Information Processing Letters. 115(1), 52–59.
View | DOI | Download (ext.)
 
[226]
2015 | Journal Article | IST-REx-ID: 1598
Chatterjee K, Joglekar M, Shah N. 2015. Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. Theoretical Computer Science. 573(3), 71–89.
View | Files available | DOI | Download (ext.)
 
[225]
2015 | Conference Paper | IST-REx-ID: 1656
Chatterjee K, Henzinger TA, Otop J. 2015. Nested weighted automata. Proceedings - Symposium on Logic in Computer Science. LICS: Logic in Computer Science vol. 2015–July. 7174926.
View | Files available | DOI | arXiv
 
[224]
2015 | Technical Report | IST-REx-ID: 5437   OA
Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2015. Faster algorithms for quantitative verification in constant treewidth graphs, IST Austria, 27p.
View | Files available | DOI
 
[223]
2015 | Technical Report | IST-REx-ID: 5444   OA
Reiter J, Makohon-Moore A, Gerold J, Bozic I, Chatterjee K, Iacobuzio-Donahue C, Vogelstein B, Nowak M. 2015. Reconstructing robust phylogenies of metastatic cancers, IST Austria, 25p.
View | Files available | DOI
 
[222]
2015 | Technical Report | IST-REx-ID: 5432
Chatterjee K, Ibsen-Jensen R, Nowak M. 2015. The complexity of evolutionary games on graphs, IST Austria, 29p.
View | Files available | DOI
 
[221]
2015 | Conference Paper | IST-REx-ID: 1714
Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. 2015. A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. Real-Time Systems Symposium. RTSS: Real-Time Systems Symposium, Proceedings - Real-Time Systems Symposium , vol. 2015. 118–127.
View | Files available | DOI
 
[220]
2015 | Journal Article | IST-REx-ID: 1873   OA
Chatterjee K, Chmelik M. 2015. POMDPs under probabilistic semantics. Artificial Intelligence. 221, 46–72.
View | DOI | Download (ext.) | arXiv
 
[219]
2015 | Conference Paper | IST-REx-ID: 1481
Ahmed U, Chatterjee K, Gulwani S. 2015. Automatic generation of alternative starting positions for simple traditional board games. AAAI: Conference on Artificial Intelligence, Proceedings of the National Conference on Artificial Intelligence, vol. 2. 745–752.
View | Files available | Download (ext.)
 
[218]
2015 | Conference Paper | IST-REx-ID: 1657
Chatterjee K, Komárková Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes. , 244–256.
View | Files available | DOI
 
[217]
2015 | Technical Report | IST-REx-ID: 5438   OA
Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2015. Edit distance for pushdown automata, IST Austria, 15p.
View | Files available | DOI
 
[216]
2015 | Journal Article | IST-REx-ID: 1501
Chatterjee K, Chmelik M, Daca P. 2015. CEGAR for compositional analysis of qualitative properties in Markov decision processes. Formal Methods in System Design. 47(2), 230–264.
View | Files available | DOI | Download (ext.)
 
[215]
2015 | Technical Report | IST-REx-ID: 5440
Chatterjee K, Ibsen-Jensen R, Nowak M. 2015. The complexity of evolutionary games on graphs, IST Austria, 18p.
View | Files available | DOI
 
[214]
2015 | Journal Article | IST-REx-ID: 1602
Chatterjee K, Ibsen-Jensen R, Pavlogiannis A, Goyal P. 2015. Faster algorithms for algebraic path properties in recursive state machines with constant treewidth. ACM SIGPLAN Notices. 50(1), 97–109.
View | Files available | DOI | Download (ext.) | arXiv
 
[213]
2015 | Conference Paper | IST-REx-ID: 1607
Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2015. Faster algorithms for quantitative verification in constant treewidth graphs. CAV: Computer Aided Verification, LNCS, vol. 9206. 140–157.
View | Files available | DOI | Download (ext.)
 
[212]
2015 | Conference Paper | IST-REx-ID: 1689   OA
Svoreňová M, Kretinsky J, Chmelik M, Chatterjee K, Cěrná I, Belta C. 2015. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control 259–268.
View | Files available | DOI | Download (ext.)
 
[211]
2015 | Conference Paper | IST-REx-ID: 1691
Svoreňová M, Chmelik M, Leahy K, Eniser H, Chatterjee K, Cěrná I, Belta C. 2015. Temporal logic motion planning using POMDPs with parity objectives: Case study paper. Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control 233–238.
View | DOI
 
[210]
2015 | Journal Article | IST-REx-ID: 1709   OA
Reiter J, Kanodia A, Gupta R, Nowak M, Chatterjee K. 2015. Biological auctions with multiple rewards. Proceedings of the Royal Society of London Series B Biological Sciences. 282(1812).
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 
[209]
2015 | Conference Paper | IST-REx-ID: 1610
Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2015. Edit distance for pushdown automata. 9135(Part II), 121–133.
View | Files available | DOI
 
[208]
2015 | Conference Paper | IST-REx-ID: 1603
Brázdil T, Chatterjee K, Chmelik M, Fellner A, Kretinsky J. 2015. Counterexample explanation by learning small strategies in Markov decision processes. CAV: Computer Aided Verification, LNCS, vol. 9206. 158–177.
View | Files available | DOI | Download (ext.)
 
[207]
2015 | Technical Report | IST-REx-ID: 5441
Chatterjee K, Ibsen-Jensen R, Goharshady A, Pavlogiannis A. 2015. Algorithms for algebraic path properties in concurrent systems of constant treewidth components, IST Austria, 24p.
View | Files available | DOI
 
[206]
2014 | Journal Article | IST-REx-ID: 1375   OA
Chatterjee K, Henzinger M, Krinninger S, Loitzenbauer V, Raskin M. 2014. Approximating the minimum cycle mean. Theoretical Computer Science. 547(C), 104–116.
View | DOI | Download (ext.)
 
[205]
2014 | Journal Article | IST-REx-ID: 2234   OA
Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. 2014. Markov decision processes with multiple long-run average objectives. Logical Methods in Computer Science. 10(1).
View | Files available | DOI | Download (ext.)
 
[204]
2014 | Journal Article | IST-REx-ID: 535   OA
Chatterjee K, Henzinger M, Krinninger S, Nanongkai D. 2014. Polynomial time algorithms for energy games with special weight structures. Algorithmica. 70(3), 457–492.
View | DOI | Download (ext.)
 
[203]
2014 | Technical Report | IST-REx-ID: 5423   OA
Chatterjee K, Kössler A, Pavlogiannis A, Schmid U. 2014. A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks, IST Austria, 14p.
View | Files available | DOI
 
[202]
2014 | Technical Report | IST-REx-ID: 5428   OA
Chatterjee K, Henzinger TA, Otop J, Velner Y. 2014. Quantitative fair simulation games, IST Austria, 26p.
View | Files available | DOI
 
[201]
2014 | Conference Paper | IST-REx-ID: 2063
Chatterjee K, Chmelik M, Daca P. 2014. CEGAR for qualitative analysis of probabilistic systems. CAV: Computer Aided Verification, LNCS, vol. 8559. 473–490.
View | Files available | DOI
 
[200]
2014 | Journal Article | IST-REx-ID: 2716   OA
Chatterjee K, Randour M, Raskin J. 2014. Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica. 51(3–4), 129–163.
View | DOI | Download (ext.)
 
[199]
2014 | Journal Article | IST-REx-ID: 2141
Chatterjee K, Henzinger M. 2014. Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. Journal of the ACM. 61(3).
View | Files available | DOI | Download (ext.)
 
[198]
2014 | Journal Article | IST-REx-ID: 2038
Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2014. Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). 15(4), 27.
View | Files available | DOI
 
[197]
2014 | Journal Article | IST-REx-ID: 2211
Chatterjee K, Doyen L. 2014. Partial-observation stochastic games: How to win when belief fails. ACM Transactions on Computational Logic (TOCL). 15(2), 16.
View | Files available | DOI | Download (ext.) | arXiv
 
[196]
2014 | Conference Paper | IST-REx-ID: 1903
Chatterjee K. 2014. Partial-observation stochastic reachability and parity games. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 8634. 1–4.
View | Files available | DOI
 
[195]
2014 | Conference Paper | IST-REx-ID: 2216
Chatterjee K, Ibsen-Jensen R, Majumdar R. 2014. Edit distance for timed automata. HSCC: Hybrid Systems - Computation and Control 303–312.
View | Files available | DOI | Download (ext.)
 
[194]
2014 | Technical Report | IST-REx-ID: 5412
Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 31p.
View | Files available | DOI
 
[193]
2014 | Technical Report | IST-REx-ID: 5424
Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2014. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications, IST Austria, 12p.
View | Files available | DOI
 
[192]
2014 | Conference Paper | IST-REx-ID: 1853
Jha S, Tripakis S, Seshia S, Chatterjee K. 2014. Game theoretic secure localization in wireless sensor networks. IOT: Internet of Things 85–90.
View | DOI
 
[191]
2014 | Conference Paper | IST-REx-ID: 2027   OA
Brázdil T, Chatterjee K, Chmelik M, Forejt V, Kretinsky J, Kwiatkowska M, Parker D, Ujma M. 2014. Verification of markov decision processes using learning algorithms. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ALENEX: Algorithm Engineering and Experiments, LNCS, vol. 8837. 98–114.
View | DOI | Download (ext.)
 
[190]
2014 | Conference Paper | IST-REx-ID: 2212
Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. 2014. Perfect-information stochastic mean-payoff parity games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 8412. 210–225.
View | Files available | DOI
 
[189]
2014 | Technical Report | IST-REx-ID: 5413
Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 33p.
View | Files available | DOI
 
[188]
2014 | Technical Report | IST-REx-ID: 5418   OA
Chatterjee K, Doyen L. 2014. Games with a weak adversary, IST Austria, 18p.
View | Files available | DOI
 
[187]
2014 | Technical Report | IST-REx-ID: 5420   OA
Chatterjee K, Ibsen-Jensen R. 2014. The value 1 problem for concurrent mean-payoff games, IST Austria, 49p.
View | Files available | DOI
 
[186]
2014 | Journal Article | IST-REx-ID: 2039   OA
Chatterjee K, Pavlogiannis A, Adlam B, Nowak M. 2014. The time scale of evolutionary innovation. PLoS Computational Biology. 10(9).
View | Files available | DOI
 
[185]
2014 | Conference Paper | IST-REx-ID: 2054
Chatterjee K. 2014. Qualitative concurrent parity games: Bounded rationality. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). CONCUR: Concurrency Theory, LNCS, vol. 8704. 544–559.
View | Files available | DOI
 
[184]
2014 | Conference Paper | IST-REx-ID: 2213
Chatterjee K, Doyen L, Nain S, Vardi M. 2014. The complexity of partial-observation stochastic parity games with finite-memory strategies. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 8412. 242–257.
View | Files available | DOI | Download (ext.) | arXiv
 
[183]
2014 | Conference Paper | IST-REx-ID: 2162
Chatterjee K, Ibsen-Jensen R. 2014. The complexity of ergodic mean payoff games. ICST: International Conference on Software Testing, Verification and Validation, LNCS, vol. 8573. 122–133.
View | Files available | DOI | Download (ext.) | arXiv
 
[182]
2014 | Technical Report | IST-REx-ID: 5426   OA
Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2014. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications, IST Austria, 10p.
View | Files available | DOI
 
[181]
2014 | Technical Report | IST-REx-ID: 5419   OA
Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2014. Improved algorithms for reachability and shortest path on low tree-width graphs, IST Austria, 34p.
View | Files available | DOI
 
[180]
2014 | Technical Report | IST-REx-ID: 5414   OA
Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 33p.
View | Files available | DOI
 
[179]
2014 | Technical Report | IST-REx-ID: 5421   OA
Chatterjee K, Ibsen-Jensen R, Nowak M. 2014. The complexity of evolution on graphs, IST Austria, 27p.
View | Files available | DOI
 
[178]
2014 | Journal Article | IST-REx-ID: 2187   OA
Bloem R, Chatterjee K, Greimel K, Henzinger TA, Hofferek G, Jobstmann B, Könighofer B, Könighofer R. 2014. Synthesizing robust systems. Acta Informatica. 51(3–4), 193–220.
View | Files available | DOI
 
[177]
2014 | Conference Paper | IST-REx-ID: 2163
Chatterjee K, Doyen L. 2014. Games with a weak adversary. Lecture Notes in Computer Science. ICALP: Automata, Languages and Programming, LNCS, vol. 8573. 110–121.
View | Files available | DOI | Download (ext.) | arXiv
 
[176]
2014 | Technical Report | IST-REx-ID: 5427   OA
Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2014. Optimal tree-decomposition balancing and reachability on low treewidth graphs, IST Austria, 24p.
View | Files available | DOI
 
[175]
2014 | Technical Report | IST-REx-ID: 5415
Chatterjee K, Henzinger TA, Otop J. 2014. Nested weighted automata, IST Austria, 27p.
View | Files available | DOI
 
[174]
2013 | Journal Article | IST-REx-ID: 2816   OA
Božić I, Reiter J, Allen B, Antal T, Chatterjee K, Shah P, Moon Y, Yaqubie A, Kelly N, Le D, Lipson E, Chapman P, Diaz L, Vogelstein B, Nowak M. 2013. Evolutionary dynamics of cancer in response to targeted combination therapy. eLife. 2.
View | Files available | DOI
 
[173]
2013 | Journal Article | IST-REx-ID: 2854   OA
Chatterjee K, De Alfaro L, Henzinger TA. 2013. Strategy improvement for concurrent reachability and turn based stochastic safety games. Journal of Computer and System Sciences. 79(5), 640–657.
View | Files available | DOI
 
[172]
2013 | Technical Report | IST-REx-ID: 5404   OA
Chatterjee K, Ibsen-Jensen R. 2013. The complexity of ergodic games, IST Austria, 29p.
View | Files available | DOI
 
[171]
2013 | Technical Report | IST-REx-ID: 5409   OA
Chatterjee K, Ibsen-Jensen R, Majumdar R. 2013. Edit distance for timed automata, IST Austria, 12p.
View | Files available | DOI
 
[170]
2013 | Journal Article | IST-REx-ID: 2247   OA
Zagorsky B, Reiter J, Chatterjee K, Nowak M. 2013. Forgiver triumphs in alternating prisoner’s dilemma . PLoS One. 8(12).
View | Files available | DOI
 
[169]
2013 | Conference (Editor) | IST-REx-ID: 2292
Chatterjee K, Sgall J eds. 2013. Mathematical Foundations of Computer Science 2013, Springer,p.
View | DOI
 
[168]
2013 | Conference Paper | IST-REx-ID: 2444   OA
Chatterjee K, Ła̧Cki J. 2013. Faster algorithms for Markov decision processes with low treewidth. 8044, 543–558.
View | DOI | Download (ext.) | arXiv
 
[167]
2013 | Conference Paper | IST-REx-ID: 2305   OA
Brázdil T, Chatterjee K, Forejt V, Kučera A. 2013. Trading performance for stability in Markov decision processes. 28th Annual ACM/IEEE Symposium. LICS: Logic in Computer Science 331–340.
View | Files available | DOI | Download (ext.) | arXiv
 
[166]
2013 | Journal Article | IST-REx-ID: 2824
Chatterjee K, Prabhu V. 2013. Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems. Information and Computation. 228–229, 83–119.
View | DOI
 
[165]
2013 | Journal Article | IST-REx-ID: 2831   OA
Chatterjee K, Henzinger M, Joglekar M, Shah N. 2013. Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. Formal Methods in System Design. 42(3), 301–327.
View | DOI | Download (ext.) | arXiv
 
[164]
2013 | Journal Article | IST-REx-ID: 2836   OA
Chatterjee K, Raman V. 2013. Assume-guarantee synthesis for digital contract signing. Formal Aspects of Computing. 26(4), 825–859.
View | DOI | Download (ext.) | arXiv
 
[163]
2013 | Journal Article | IST-REx-ID: 2817   OA
Novak S, Chatterjee K, Nowak M. 2013. Density games. Journal of Theoretical Biology. 334, 26–34.
View | Files available | DOI
 
[162]
2013 | Technical Report | IST-REx-ID: 5400   OA
Chatterjee K, Chmelik M, Tracol M. 2013. What is decidable about partially observable Markov decision processes with ω-regular objectives, IST Austria, 41p.
View | Files available | DOI
 
[161]
2013 | Conference Paper | IST-REx-ID: 1376
Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. 2013. Distributed synthesis for LTL fragments. 13th International Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design 18–25.
View | Files available | DOI
 
[160]
2013 | Technical Report | IST-REx-ID: 5405   OA
Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. 2013. Perfect-information stochastic mean-payoff parity games, IST Austria, 22p.
View | Files available | DOI
 
[159]
2013 | Conference Paper | IST-REx-ID: 2329
Chatterjee K, Velner Y. 2013. Hyperplane separation technique for multidimensional mean-payoff games. 8052, 500–515.
View | Files available | DOI | Download (ext.) | arXiv
 
[158]
2013 | Conference Paper | IST-REx-ID: 2279
Chatterjee K, Doyen L, Randour M, Raskin J. 2013. Looking at mean-payoff and total-payoff through windows. 8172, 118–132.
View | Files available | DOI | Download (ext.)
 
[157]
2013 | Technical Report | IST-REx-ID: 5406   OA
Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. 2013. Distributed synthesis for LTL Fragments, IST Austria, 11p.
View | Files available | DOI
 
[156]
2013 | Conference Paper | IST-REx-ID: 2820
Chatterjee K, Kößler A, Schmid U. 2013. Automated analysis of real-time scheduling using graph games. Proceedings of the 16th International conference on Hybrid systems: Computation and control. HSCC: Hybrid Systems - Computation and Control 163–172.
View | Files available | DOI
 
[155]
2013 | Conference Paper | IST-REx-ID: 2446   OA
Chatterjee K, Gaiser A, Kretinsky J. 2013. Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis. 8044, 559–575.
View | DOI | Download (ext.) | arXiv
 
[154]
2013 | Journal Article | IST-REx-ID: 2299   OA
Godhal Y, Chatterjee K, Henzinger TA. 2013. Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer. 15(5–6), 585–601.
View | Files available | DOI
 
[153]
2013 | Journal Article | IST-REx-ID: 2814   OA
Chatterjee K, Alfaro L, Majumdar R. 2013. The complexity of coverage. International Journal of Foundations of Computer Science. 24(2), 165–185.
View | DOI | Download (ext.) | arXiv
 
[152]
2013 | Conference Paper | IST-REx-ID: 2819   OA
Chatterjee K, Prabhu V. 2013. Quantitative timed simulation functions and refinement metrics for real-time systems. Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control vol. 1. 273–282.
View | DOI | Download (ext.)
 
[151]
2013 | Technical Report | IST-REx-ID: 5399   OA
Reiter J, Bozic I, Chatterjee K, Nowak M. 2013. TTP: Tool for Tumor Progression, IST Austria, 17p.
View | Files available | DOI
 
[150]
2013 | Conference Paper | IST-REx-ID: 1374   OA
Chatterjee K, Fijalkow N. 2013. Infinite-state games with finitary conditions. 22nd EACSL Annual Conference on Computer Science Logic. CSL: Computer Science LogicLeibniz International Proceedings in Informatics, LIPIcs, vol. 23. 181–196.
View | Files available | DOI
 
[149]
2013 | Conference Paper | IST-REx-ID: 2238
Chatterjee K, Forejt V, Wojtczak D. 2013. Multi-objective discounted reward verification in graphs and MDPs. 8312, 228–242.
View | DOI
 
[148]
2013 | Journal Article | IST-REx-ID: 2858   OA
Reiter J, Božić I, Allen B, Chatterjee K, Nowak M. 2013. The effect of one additional driver mutation on tumor progression. Evolutionary Applications. 6(1), 34–45.
View | Files available | DOI
 
[147]
2013 | Journal Article | IST-REx-ID: 3116
Chatterjee K, De Alfaro L, Faella M, Majumdar R, Raman V. 2013. Code aware resource management. Formal Methods in System Design. 42(2), 142–174.
View | DOI
 
[146]
2013 | Conference Paper | IST-REx-ID: 2295
Chatterjee K, Chmelik M, Tracol M. 2013. What is decidable about partially observable Markov decision processes with omega-regular objectives. 23, 165–180.
View | Files available | DOI
 
[145]
2013 | Technical Report | IST-REx-ID: 5403   OA
Chatterjee K, Ibsen-Jensen R. 2013. Qualitative analysis of concurrent mean-payoff games, IST Austria, 33p.
View | Files available | DOI
 
[144]
2013 | Conference Paper | IST-REx-ID: 2000
Reiter J, Božić I, Chatterjee K, Nowak M. 2013. TTP: Tool for tumor progression. Proceedings of 25th Int. Conf. on Computer Aided Verification. CAV: Computer Aided VerificationLecture Notes in Computer Science, LNCS, vol. 8044. 101–106.
View | Files available | DOI | Download (ext.) | arXiv
 
[143]
2013 | Technical Report | IST-REx-ID: 5410   OA
Ahmed U, Chatterjee K, Gulwani S. 2013. Automatic generation of alternative starting positions for traditional board games, IST Austria, 13p.
View | Files available | DOI
 
[142]
2013 | Technical Report | IST-REx-ID: 5408   OA
Chatterjee K, Doyen L, Nain S, Vardi M. 2013. The complexity of partial-observation stochastic parity games with finite-memory strategies, IST Austria, 17p.
View | Files available | DOI
 
[141]
2012 | Conference Paper | IST-REx-ID: 2715   OA
Chatterjee K, Joglekar M, Shah N. 2012. Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 18. 461–473.
View | Files available | DOI
 
[140]
2012 | Conference Paper | IST-REx-ID: 2936   OA
Chatterjee K, Henzinger TA, Prabhu V. 2012. Finite automata with time delay blocks. roceedings of the tenth ACM international conference on Embedded software. EMSOFT: Embedded Software 43–52.
View | DOI | Download (ext.)
 
[139]
2012 | Journal Article | IST-REx-ID: 3314
Chatterjee K, Majumdar R. 2012. Discounting and averaging in games across time scales. International Journal of Foundations of Computer Science. 23(3), 609–625.
View | DOI
 
[138]
2012 | Conference Paper | IST-REx-ID: 2955
Chatterjee K, Doyen L. 2012. Partial-observation stochastic games: How to win when belief fails. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science 6280436.
View | Files available | DOI | Download (ext.) | arXiv
 
[137]
2012 | Technical Report | IST-REx-ID: 5377   OA
Chatterjee K, Velner Y. 2012. Mean-payoff pushdown games, IST Austria, 33p.
View | Files available | DOI
 
[136]
2012 | Journal Article | IST-REx-ID: 2848   OA
Chatterjee K, Zufferey D, Nowak M. 2012. Evolutionary game dynamics in populations with different learners. Journal of Theoretical Biology. 301, 161–173.
View | DOI | Download (ext.) | PubMed | Europe PMC
 
[135]
2012 | Conference Paper | IST-REx-ID: 3252   OA
Chatterjee K, Raman V. 2012. Synthesizing protocols for digital contract signing. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 7148. 152–168.
View | DOI | Download (ext.)
 
[134]
2012 | Journal Article | IST-REx-ID: 3846   OA
Chatterjee K, Henzinger TA. 2012. A survey of stochastic ω regular games. Journal of Computer and System Sciences. 78(2), 394–413.
View | Files available | DOI
 
[133]
2012 | Conference Paper | IST-REx-ID: 497
Chatterjee K, Chaubal S, Kamath P. 2012. Faster algorithms for alternating refinement relations. EACSL: European Association for Computer Science Logic, LIPIcs, vol. 16. 167–182.
View | Files available | DOI
 
[132]
2012 | Conference Paper | IST-REx-ID: 2956
Chatterjee K, Velner Y. 2012. Mean payoff pushdown games. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science
View | Files available | DOI
 
[131]
2012 | Technical Report | IST-REx-ID: 5378   OA
Chatterjee K, Chaubal S, Kamath P. 2012. Faster algorithms for alternating refinement relations, IST Austria, 21p.
View | Files available | DOI
 
[130]
2012 | Conference Paper | IST-REx-ID: 3341
Chatterjee K. 2012. Robustness of structurally equivalent concurrent parity games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 7213. 270–285.
View | Files available | DOI | Download (ext.) | arXiv
 
[129]
2012 | Journal Article | IST-REx-ID: 3260   OA
Chatterjee K, Reiter J, Nowak M. 2012. Evolutionary dynamics of biological auctions. Theoretical Population Biology. 81(1), 69–80.
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 
[128]
2012 | Conference Paper | IST-REx-ID: 2957
Chatterjee K, Tracol M. 2012. Decidable problems for probabilistic automata on infinite words. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science 6280437.
View | Files available | DOI | Download (ext.) | arXiv
 
[127]
2012 | Journal Article | IST-REx-ID: 2972   OA
Chatterjee K, Doyen L. 2012. Energy parity games. Theoretical Computer Science. 458, 49–60.
View | Files available | DOI
 
[126]
2012 | Journal Article | IST-REx-ID: 3254
Chatterjee K. 2012. The complexity of stochastic Müller games. Information and Computation. 211, 29–48.
View | DOI | Download (ext.)
 
[125]
2012 | Conference Paper | IST-REx-ID: 3165
Chatterjee K, Henzinger M. 2012. An O(n2) time algorithm for alternating Büchi games. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms 1386–1399.
View | Files available | DOI
 
[124]
2012 | Conference Paper | IST-REx-ID: 2947   OA
Chatterjee K, Chmelik M, Majumdar R. 2012. Equivalence of games with probabilistic uncertainty and partial observation games. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 7561. 385–399.
View | DOI | Download (ext.)
 
[123]
2012 | Conference Paper | IST-REx-ID: 3135   OA
Brázdil B, Chatterjee K, Kučera A, Novotny P. 2012. Efficient controller synthesis for consumption games with multiple resource types. CAV: Computer Aided Verification, LNCS, vol. 7358. 23–38.
View | DOI | Download (ext.)
 
[122]
2012 | Journal Article | IST-REx-ID: 3128   OA
Chatterjee K, Doyen L, Henzinger TA. 2012. A survey of partial-observation stochastic parity games. Formal Methods in System Design. 43(2), 268–284.
View | Files available | DOI
 
[121]
2012 | Conference Paper | IST-REx-ID: 3255
Chatterjee K, Doyen L. 2012. Games and Markov decision processes with mean payoff parity and energy parity objectives. MEMICS: Mathematical and Engineering Methods in Computer Science, LNCS, vol. 7119. 37–46.
View | DOI
 
[120]
2011 | Conference Paper | IST-REx-ID: 3357
Chatterjee K, Henzinger TA, Horn F. 2011. The complexity of request-response games. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638. 227–237.
View | DOI
 
[119]
2011 | Conference Paper | IST-REx-ID: 3345
Chatterjee K, Doyen L. 2011. Energy and mean-payoff parity Markov Decision Processes. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6907. 206–218.
View | Files available | DOI | Download (ext.) | arXiv
 
[118]
2011 | Technical Report | IST-REx-ID: 5384   OA
Chatterjee K, Tracol M. 2011. Decidable problems for probabilistic automata on infinite words, IST Austria, 30p.
View | Files available | DOI
 
[117]
2011 | Journal Article | IST-REx-ID: 3338
Chatterjee K. 2011. Bounded rationality in concurrent parity games. CoRR: Computing Research Repository., 1–51.
View | Files available | Download (ext.) | arXiv
 
[116]
2011 | Conference Paper | IST-REx-ID: 3346   OA
Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. 2011. Two views on multiple mean payoff objectives in Markov Decision Processes. LICS: Logic in Computer Science
View | DOI | Download (ext.)
 
[115]
2011 | Journal Article | IST-REx-ID: 3339   OA
Chatterjee K, De Alfaro L, Pritam R. 2011. Magnifying lens abstraction for stochastic games with discounted and long-run average objectives. CoRR: Computing Research Repository.
View | Download (ext.) | arXiv
 
[114]
2011 | Conference Paper | IST-REx-ID: 3365   OA
Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2011. QUASY: quantitative synthesis tool. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 6605. 267–271.
View | Files available | DOI
 
[113]
2011 | Journal Article | IST-REx-ID: 3315
Chatterjee K, Henzinger TA, Prabhu V. 2011. Timed parity games: Complexity and robustness. Logical Methods in Computer Science. 7(4).
View | Files available | DOI
 
[112]
2011 | Technical Report | IST-REx-ID: 5380   OA
Chatterjee K. 2011. Bounded rationality in concurrent parity games, IST Austria, 53p.
View | Files available | DOI
 
[111]
2011 | Technical Report | IST-REx-ID: 5385   OA
Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values, IST Austria, 14p.
View | Files available | DOI
 
[110]
2011 | Conference Paper | IST-REx-ID: 3347   OA
Chatterjee K, Fijalkow N. 2011. Finitary languages. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638. 216–226.
View | DOI | Download (ext.)
 
[109]
2011 | Conference Paper | IST-REx-ID: 3342   OA
Chatterjee K, Henzinger M, Joglekar M, Nisarg S. 2011. Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. CAV: Computer Aided Verification, LNCS, vol. 6806. 260–276.
View | DOI | Download (ext.) | arXiv
 
[108]
2011 | Journal Article | IST-REx-ID: 3354
Chatterjee K, De Alfaro L, Henzinger TA. 2011. Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL). 12(4).
View | Files available | DOI
 
[107]
2011 | Conference Paper | IST-REx-ID: 3316
Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. 2011. Specification-centered robustness. SIES: International Symposium on Industrial Embedded Systems 176–185.
View | DOI
 
[106]
2011 | Conference Paper | IST-REx-ID: 3361   OA
Cerny P, Chatterjee K, Henzinger TA. 2011. The complexity of quantitative information flow problems. CSF: Computer Security Foundations 205–217.
View | Files available | DOI
 
[105]
2011 | Technical Report | IST-REx-ID: 5381   OA
Chatterjee K, Doyen L. 2011. Partial-observation stochastic games: How to win when belief fails, IST Austria, 43p.
View | Files available | DOI
 
[104]
2011 | Technical Report | IST-REx-ID: 5379   OA
Chatterjee K, Henzinger M. 2011. An O(n2) time algorithm for alternating Büchi games, IST Austria, 20p.
View | Files available | DOI
 
[103]
2011 | Conference Paper | IST-REx-ID: 3366
Cerny P, Chatterjee K, Henzinger TA, Radhakrishna A, Singh R. 2011. Quantitative synthesis for concurrent programs. CAV: Computer Aided Verification, LNCS, vol. 6806. 243–259.
View | Files available | DOI
 
[102]
2011 | Conference Paper | IST-REx-ID: 3348   OA
Chatterjee K, Prabhu V. 2011. Synthesis of memory efficient real time controllers for safety objectives. HSCC: Hybrid Systems - Computation and Control 221–230.
View | DOI | Download (ext.)
 
[101]
2011 | Conference Paper | IST-REx-ID: 3350
Chatterjee K, Majumdar R. 2011. Minimum attention controller synthesis for omega regular objectives. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 6919. 145–159.
View | DOI
 
[100]
2011 | Conference Paper | IST-REx-ID: 3343   OA
Chatterjee K, Henzinger M. 2011. Faster and dynamic algorithms for maximal end component decomposition and related graph problems in probabilistic verification. SODA: Symposium on Discrete Algorithms 1318–1336.
View | DOI | Download (ext.)
 
[99]
2011 | Technical Report | IST-REx-ID: 5382   OA
Chatterjee K. 2011. Robustness of structurally equivalent concurrent parity games, IST Austria, 18p.
View | Files available | DOI
 
[98]
2011 | Technical Report | IST-REx-ID: 5387   OA
Chatterjee K, Doyen L. 2011. Energy and mean-payoff parity Markov decision processes, IST Austria, 20p.
View | Files available | DOI
 
[97]
2011 | Preprint | IST-REx-ID: 3363   OA
Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words.
View | Download (ext.) | arXiv
 
[96]
2011 | Conference Paper | IST-REx-ID: 3349   OA
Chatterjee K, Fijalkow N. 2011. A reduction from parity games to simple stochastic games. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 54. 74–86.
View | DOI | Download (ext.)
 
[95]
2011 | Conference Paper | IST-REx-ID: 3351   OA
Chatterjee K, Doyen L, Singh R. 2011. On memoryless quantitative objectives. FCT: Fundamentals of Computation Theory, LNCS, vol. 6914. 148–159.
View | DOI | Download (ext.)
 
[94]
2011 | Conference Paper | IST-REx-ID: 3344
Chatterjee K. 2011. Graph games with reachability objectives. RP: Reachability Problems, LNCS, vol. 6945. 1–1.
View | DOI
 
[93]
2011 | Conference Paper | IST-REx-ID: 3356
Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values. LICS: Logic in Computer Science
View | Files available | DOI
 
[92]
2010 | Conference Paper | IST-REx-ID: 3852   OA
Chatterjee K, Majumdar R. 2010. Discounting in games across time scales. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 25. 22–29.
View | Files available | DOI | Download (ext.) | arXiv
 
[91]
2010 | Conference Paper | IST-REx-ID: 3864   OA
Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2010. Measuring and synthesizing systems in probabilistic environments. CAV: Computer Aided Verification, LNCS, vol. 6174. 380–395.
View | Files available | DOI | Download (ext.)
 
[90]
2010 | Conference Paper | IST-REx-ID: 3857
Chatterjee K, Henzinger TA. 2010. Probabilistic Automata on infinite words: decidability and undecidability results. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 6252. 1–16.
View | Files available | DOI
 
[89]
2010 | Conference Paper | IST-REx-ID: 3853   OA
Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. 2010. Mean-payoff automaton expressions. CONCUR: Concurrency Theory, LNCS, vol. 6269. 269–283.
View | Files available | DOI
 
[88]
2010 | Conference Paper | IST-REx-ID: 3858
Chatterjee K, Doyen L. 2010. The complexity of partial-observation parity games. LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, LNCS, vol. 6397. 1–14.
View | DOI
 
[87]
2010 | Conference Paper | IST-REx-ID: 3865
Chatterjee K, De Alfaro L, Raman V, Sánchez C. 2010. Analyzing the impact of change in multi-threaded programs. FASE: Fundamental Approaches To Software Engineering, LNCS, vol. 6013. 293–307.
View | DOI
 
[86]
2010 | Conference Paper | IST-REx-ID: 3860   OA
Chatterjee K, Doyen L, Henzinger TA, Raskin J. 2010. Generalized mean-payoff and energy games. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 8. 505–516.
View | Files available | DOI
 
[85]
2010 | Conference Paper | IST-REx-ID: 3854
Chatterjee K, Horn F, Löding C. 2010. Obliging games. CONCUR: Concurrency Theory, LNCS, vol. 6269. 284–296.
View | DOI
 
[84]
2010 | Conference Paper | IST-REx-ID: 3866   OA
Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. 2010. Robustness in the presence of liveness. CAV: Computer Aided Verification, LNCS, vol. 6174. 410–424.
View | Files available | DOI
 
[83]
2010 | Journal Article | IST-REx-ID: 3861
Chatterjee K, Henzinger TA, Piterman N. 2010. Strategy logic. Information and Computation. 208(6), 677–693.
View | Files available | DOI
 
[82]
2010 | Conference (Editor) | IST-REx-ID: 3859
Chatterjee K, Henzinger TA eds. 2010. FORMATS: Formal modeling and analysis of timed systems, Springer,p.
View | DOI
 
[81]
2010 | Conference Paper | IST-REx-ID: 4388
Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. 2010. GIST: A solver for probabilistic games. CAV: Computer Aided Verification, LNCS, vol. 6174. 665–669.
View | Files available | DOI | Download (ext.) | arXiv
 
[80]
2010 | Journal Article | IST-REx-ID: 3862   OA
Chatterjee K, Doyen L, Henzinger TA. 2010. Quantitative languages. ACM Transactions on Computational Logic (TOCL). 11(4), 23.
View | Files available | DOI
 
[79]
2010 | Conference Paper | IST-REx-ID: 3855
Chatterjee K, Doyen L, Henzinger TA. 2010. Qualitative analysis of partially-observable Markov Decision Processes. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281. 258–269.
View | Files available | DOI
 
[78]
2010 | Journal Article | IST-REx-ID: 3867
Chatterjee K, Doyen L, Henzinger TA. 2010. Expressiveness and closure properties for quantitative languages. Logical Methods in Computer Science. 6(3), 1–23.
View | Files available | DOI
 
[77]
2010 | Conference Paper | IST-REx-ID: 3851   OA
Chatterjee K, Doyen L. 2010. Energy parity games. ICALP: Automata, Languages and Programming, 37th International Colloquium, LNCS, vol. 6199. 599–610.
View | DOI | Download (ext.) | arXiv
 
[76]
2010 | Conference Paper | IST-REx-ID: 3856   OA
Chatterjee K, Doyen L, Gimbert H, Henzinger TA. 2010. Randomness for free. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281. 246–257.
View | Files available | DOI | Download (ext.)
 
[75]
2010 | Journal Article | IST-REx-ID: 3868   OA
Chatterjee K, De Alfaro L, Majumdar R, Raman V. 2010. Algorithms for game metrics. Logical Methods in Computer Science. 6(3), 1–27.
View | Files available | DOI
 
[74]
2010 | Journal Article | IST-REx-ID: 3863
Berwanger D, Chatterjee K, De Wulf M, Doyen L, Henzinger TA. 2010. Strategy construction for parity games with imperfect information. Information and Computation. 208(10), 1206–1220.
View | Files available | DOI
 
[73]
2010 | Technical Report | IST-REx-ID: 5388   OA
Chatterjee K, Cerny P, Henzinger TA, Radhakrishna A, Singh R. 2010. Quantitative synthesis for concurrent programs, IST Austria, 17p.
View | Files available | DOI
 
[72]
2010 | Technical Report | IST-REx-ID: 5390   OA
Chatterjee K, Fijalkow N. 2010. Topological, automata-theoretic and logical characterization of finitary languages, IST Austria, 21p.
View | Files available | DOI
 
[71]
2009 | Journal Article | IST-REx-ID: 3869
Chatterjee K, De Alfaro L, Faella M, Legay A. 2009. Qualitative logics and equivalences for probabilistic systems. Logical Methods in Computer Science. 5(2).
View | DOI
 
[70]
2009 | Conference Paper | IST-REx-ID: 3871   OA
Chatterjee K, Doyen L, Henzinger TA. 2009. Probabilistic weighted automata. CONCUR: Concurrency Theory, LNCS, vol. 5710. 244–258.
View | Files available | DOI
 
[69]
2009 | Conference Paper | IST-REx-ID: 4545   OA
Chatterjee K, Doyen L, Henzinger TA. 2009. A survey of stochastic games with limsup and liminf objectives. ICALP: Automata, Languages and Programming, LNCS, vol. 5556. 1–15.
View | Files available | DOI
 
[68]
2009 | Conference Paper | IST-REx-ID: 4569   OA
Bloem R, Chatterjee K, Henzinger TA, Jobstmann B. 2009. Better quality in synthesis through quantitative objectives. CAV: Computer Aided Verification, LNCS, vol. 5643. 140–156.
View | DOI | Download (ext.) | arXiv
 
[67]
2009 | Conference Paper | IST-REx-ID: 4540
Chatterjee K, Doyen L, Henzinger TA. 2009. Expressiveness and closure properties for quantitative languages. LICS: Logic in Computer Science 199–208.
View | Files available | DOI
 
[66]
2009 | Technical Report | IST-REx-ID: 5392   OA
Chatterjee K. 2009. Probabilistic automata on infinite words: Decidability and undecidability results, IST Austria, 17p.
View | Files available | DOI
 
[65]
2009 | Conference Paper | IST-REx-ID: 4580   OA
Berwanger D, Chatterjee K, De Wulf M, Doyen L, Henzinger TA. 2009. Alpaga: A tool for solving parity games with imperfect information. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 5505. 58–61.
View | Files available | DOI | Download (ext.)
 
[64]
2009 | Conference Paper | IST-REx-ID: 4542   OA
Chatterjee K, Doyen L, Henzinger TA. 2009. Alternating weighted automata. FCT: Fundamentals of Computation Theory, LNCS, vol. 5699. 3–13.
View | Files available | DOI
 
[63]
2009 | Technical Report | IST-REx-ID: 5393   OA
Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. 2009. Gist: A solver for probabilistic games, IST Austria, 12p.
View | Files available | DOI
 
[62]
2009 | Conference Paper | IST-REx-ID: 4543
Chatterjee K, Henzinger TA, Horn F. 2009. Stochastic games with finitary objectives. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 5734. 34–54.
View | DOI
 
[61]
2009 | Technical Report | IST-REx-ID: 5394   OA
Chatterjee K, Henzinger TA, Horn F. 2009. Improved lower bounds for request-response and finitary Streett games, IST Austria, 11p.
View | Files available | DOI
 
[60]
2009 | Conference Paper | IST-REx-ID: 3503   OA
Chatterjee K, Henzinger TA. 2009. Probabilistic systems with limsup and liminf objectives. ILC: Infinity in Logic and Computation, LNCS, vol. 5489. 32–45.
View | DOI | Download (ext.)
 
[59]
2009 | Journal Article | IST-REx-ID: 3870   OA
Chatterjee K, Henzinger TA, Horn F. 2009. Finitary winning in omega-regular games. ACM Transactions on Computational Logic (TOCL). 11(1).
View | Files available | DOI
 
[58]
2009 | Conference Paper | IST-REx-ID: 4544   OA
Chatterjee K, De Alfaro L, Henzinger TA. 2009. Termination criteria for solving concurrent safety and reachability games. SODA: Symposium on Discrete Algorithms 197–206.
View | Files available | DOI | Download (ext.)
 
[57]
2009 | Technical Report | IST-REx-ID: 5395   OA
Chatterjee K, Doyen L, Henzinger TA. 2009. Qualitative analysis of partially-observable Markov decision processes, IST Austria, 20p.
View | Files available | DOI
 
[56]
2008 | Conference Paper | IST-REx-ID: 3876
Chatterjee K, Henzinger TA, Prabhu V. 2008. Timed parity games: complexity and robustness. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 5215. 124–140.
View | Files available | DOI
 
[55]
2008 | Conference Paper | IST-REx-ID: 3504
Chatterjee K, De Alfaro L, Majumdar R, Raman V. 2008. Algorithms for game metrics. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 2. 107–118.
View | Files available | DOI
 
[54]
2008 | Conference Paper | IST-REx-ID: 3877
Chatterjee K, Henzinger TA, Jobstmann B. 2008. Environment assumptions for synthesis. CONCUR: Concurrency Theory, LNCS, vol. 5201. 147–161.
View | DOI
 
[53]
2008 | Book Chapter | IST-REx-ID: 3872
Chatterjee K, Henzinger TA. 2008. Value iteration. 25 Years in Model Checking. , LNCS, vol. 5000. 107–138.
View | DOI
 
[52]
2008 | Journal Article | IST-REx-ID: 4534
Chatterjee K, Henzinger TA. 2008. Reduction of stochastic parity to stochastic mean-payoff games. Information Processing Letters. 106(1), 1–7.
View | DOI | Download (ext.)
 
[51]
2008 | Conference Paper | IST-REx-ID: 4546
Chatterjee K, Ghosal A, Henzinger TA, Iercan D, Kirsch C, Pinello C, Sangiovanni Vincentelli A. 2008. Logical reliability of interacting real-time tasks. DATE: Design, Automation and Test in Europe 909–914.
View | DOI | Download (ext.)
 
[50]
2008 | Conference Paper | IST-REx-ID: 3501
Adler BT, Chatterjee K, De Alfaro L, Faella M, Pye I, Raman V. 2008. Assigning trust to Wikipedia content. WikiSym: International Symposium on Wikis
View | DOI
 
[49]
2008 | Conference Paper | IST-REx-ID: 3873
Chatterjee K, Majumdar R, Henzinger TA. 2008. Controller synthesis with budget constraints. HSCC: Hybrid Systems - Computation and Control, LNCS, vol. 4981. 72–86.
View | DOI
 
[48]
2008 | Conference Paper | IST-REx-ID: 3878   OA
Chatterjee K, De Alfaro L, Majumdar R. 2008. The complexity of coverage. APLAS: Asian Symposium on Programming Languages and Systems, LNCS, vol. 5356. 91–106.
View | DOI | Download (ext.)
 
[47]
2008 | Conference Paper | IST-REx-ID: 3880
Berwanger D, Chatterjee K, Doyen L, Henzinger TA, Raje S. 2008. Strategy construction for parity games with imperfect information. CONCUR: Concurrency Theory, LNCS, vol. 5201. 325–339.
View | Files available | DOI
 
[46]
2008 | Conference Paper | IST-REx-ID: 3502
Chatterjee K, De Alfaro L, Pye I. 2008. Robust content-driven reputation. AISec: Artificial Intelligence and Security 33–42.
View | DOI
 
[45]
2008 | Conference Paper | IST-REx-ID: 3874
Chatterjee K, Henzinger TA, Prabhu V. 2008. Trading infinite memory for uniform randomness in timed games. HSCC: Hybrid Systems - Computation and Control, LNCS, vol. 4981. 87–100.
View | DOI
 
[44]
2008 | Conference Paper | IST-REx-ID: 3879
Chatterjee K, Doyen L, Henzinger TA. 2008. Quantitative languages. CSL: Computer Science Logic, LNCS, vol. 5213. 385–400.
View | DOI
 
[43]
2008 | Journal Article | IST-REx-ID: 4548
Chatterjee K, Majumdar R, Henzinger TA. 2008. Stochastic limit-average games are in EXPTIME. International Journal of Game Theory. 37(2), 219–234.
View | DOI | Download (ext.)
 
[42]
2008 | Conference Paper | IST-REx-ID: 3875
Chatterjee K, Henzinger TA, Sen K. 2008. Model-checking omega-regular properties of interval Markov chains. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 4962. 302–317.
View | DOI
 
[41]
2007 | Conference Paper | IST-REx-ID: 3883
Chatterjee K, Henzinger TA, Piterman N. 2007. Generalized parity games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 4423. 153–167.
View | DOI
 
[40]
2007 | Conference Paper | IST-REx-ID: 3884
Chatterjee K, Henzinger TA, Piterman N. 2007. Strategy logic. CONCUR: Concurrency Theory, LNCS, vol. 4703. 59–73.
View | Files available | DOI
 
[39]
2007 | Conference Paper | IST-REx-ID: 3885
Chatterjee K. 2007. Optimal strategy synthesis in stochastic Müller games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS , vol. 4423. 138–152.
View | DOI
 
[38]
2007 | Journal Article | IST-REx-ID: 4547
Chatterjee K, Doyen L, Henzinger TA, Raskin J. 2007. Algorithms for omega-regular games with imperfect information. Logical Methods in Computer Science. 3(184), 1–23.
View | DOI
 
[37]
2007 | Thesis | IST-REx-ID: 4559
Chatterjee K. 2007. Stochastic ω-Regular Games, University of California, Berkeley,p.
View | Download (ext.)
 
[36]
2007 | Conference Paper | IST-REx-ID: 3886
Chatterjee K. 2007. Stochastic Müller games are PSPACE-complete. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LNCS, vol. 4855. 436–448.
View | DOI
 
[35]
2007 | Conference Paper | IST-REx-ID: 3881
De Alfaro L, Chatterjee K, Faella M, Legay A. 2007. Qualitative logics and equivalences for probabilistic systems. QEST: Quantitative Evaluation of Systems 237–248.
View | DOI
 
[34]
2007 | Conference Paper | IST-REx-ID: 3887
Chatterjee K. 2007. Markov decision processes with multiple long-run average objectives. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LNCS , vol. 4855. 473–484.
View | DOI
 
[33]
2007 | Journal Article | IST-REx-ID: 3882
Chatterjee K. 2007. Concurrent games with tail objectives. Theoretical Computer Science. 388(1–3), 181–198.
View | DOI
 
[32]
2007 | Conference Paper | IST-REx-ID: 4537
Chatterjee K, Henzinger TA. 2007. Assume-guarantee synthesis. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 4424. 261–275.
View | DOI
 
[31]
2006 | Conference Paper | IST-REx-ID: 3888
Chatterjee K, Henzinger TA. 2006. Strategy improvement for stochastic Rabin and Streett games. CONCUR: Concurrency Theory, LNCS, vol. 4137. 375–389.
View | DOI
 
[30]
2006 | Conference Paper | IST-REx-ID: 3890
Chatterjee K, De Alfaro L, Henzinger TA. 2006. The complexity of quantitative concurrent parity games. SODA: Symposium on Discrete Algorithms 678–687.
View | DOI
 
[29]
2006 | Conference Paper | IST-REx-ID: 4552
Chatterjee K, De Alfaro L, Henzinger TA. 2006. Strategy improvement for concurrent reachability games. QEST: Quantitative Evaluation of Systems 291–300.
View | DOI
 
[28]
2006 | Conference Paper | IST-REx-ID: 4538
Chatterjee K, Henzinger TA. 2006. Strategy improvement and randomized subexponential algorithms for stochastic parity games. STACS: Theoretical Aspects of Computer Science, LNCS, vol. 3884. 512–523.
View | DOI
 
[27]
2006 | Conference Paper | IST-REx-ID: 3500
Chatterjee K, Henzinger TA, Piterman N. 2006. Algorithms for Büchi Games. GDV: Games in Design and Verification
View | Download (ext.)
 
[26]
2006 | Conference Paper | IST-REx-ID: 3889
Chatterjee K, Doyen L, Henzinger TA, Raskin J. 2006. Algorithms for omega-regular games with imperfect information. CSL: Computer Science Logic, LNCS, vol. 4207. 287–302.
View | DOI
 
[25]
2006 | Conference Paper | IST-REx-ID: 3891
Chatterjee K. 2006. Concurrent games with tail objectives. CSL: Computer Science Logic, LNCS , vol. 4207. 256–270.
View | DOI
 
[24]
2006 | Conference Paper | IST-REx-ID: 4539
Chatterjee K, Henzinger TA. 2006. Finitary winning in omega-regular games. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 3920. 257–271.
View | DOI
 
[23]
2006 | Conference Paper | IST-REx-ID: 3449
Chatterjee K, Jagadeesan R, Pitcher C. 2006. Games for controls. CSF: Computer Security Foundations 70–82.
View | DOI
 
[22]
2006 | Conference Paper | IST-REx-ID: 3499
Chatterjee K. 2006. Nash equilibrium for upward-closed objectives. CSL: Computer Science Logic, LNCS , vol. 4207. 271–286.
View | DOI
 
[21]
2006 | Journal Article | IST-REx-ID: 4550
Chatterjee K, Henzinger TA, Jurdziński M. 2006. Games with secure equilibria. Theoretical Computer Science. 365(1–2), 67–82.
View | DOI
 
[20]
2006 | Conference Paper | IST-REx-ID: 4549
Chatterjee K, De Alfaro L, Faella M, Henzinger TA, Majumdar R, Stoelinga M. 2006. Compositional quantitative reasoning. QEST: Quantitative Evaluation of Systems 179–188.
View | DOI
 
[19]
2006 | Conference Paper | IST-REx-ID: 4551
Chatterjee K, Majumdar R, Henzinger TA. 2006. Markov decision processes with multiple objectives. STACS: Theoretical Aspects of Computer Science, LNCS, vol. 3884. 325–336.
View | DOI
 
[18]
2005 | Conference Paper | IST-REx-ID: 4557
Chatterjee K, Henzinger TA, Jhala R, Majumdar R. 2005. Counterexample-guided planning. UAI: Uncertainty in Artificial Intelligence 104–111.
View | Download (ext.)
 
[17]
2005 | Conference Paper | IST-REx-ID: 3896
Chatterjee K, Dasgupta P, Chakrabarti P. 2005. Complexity of compositional model checking of computation tree logic on simple structures. IWDC: International Workshop on Distributed Computing , LNCS, vol. 3326. 89–102.
View | DOI
 
[16]
2005 | Conference Paper | IST-REx-ID: 4541
Chatterjee K, Henzinger TA. 2005. Semiperfect-information games. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LNCS, vol. 3821. 1–18.
View | DOI
 
[15]
2005 | Conference Paper | IST-REx-ID: 4553
Chatterjee K, De Alfaro L, Henzinger TA. 2005. The complexity of stochastic Rabin and Streett games. ICALP: Automata, Languages and Programming, LNCS, vol. 3580. 878–890.
View | DOI
 
[14]
2005 | Conference Paper | IST-REx-ID: 4560
Chakrabarti A, Chatterjee K, Henzinger TA, Kupferman O, Majumdar R. 2005. Verifying quantitative properties using bound functions. CHARME: Correct Hardware Design and Verification Methods, LNCS, vol. 3725. 50–64.
View | DOI
 
[13]
2005 | Conference Paper | IST-REx-ID: 3892
Chatterjee K, Henzinger TA, Jurdziński M. 2005. Games with secure equilibria. FMCO: Formal Methods for Components and Objects, LNCS, vol. 3657. 141–161.
View | DOI
 
[12]
2005 | Conference Paper | IST-REx-ID: 4554
Chatterjee K, Henzinger TA, Jurdziński M. 2005. Mean-payoff parity games. LICS: Logic in Computer Science 178–187.
View | DOI
 
[11]
2005 | Conference Paper | IST-REx-ID: 3893
Chatterjee K. 2005. Two-player nonzero-sum ω-regular games. CONCUR: Concurrency Theory, LNCS , vol. 3653. 413–427.
View | DOI
 
[10]
2004 | Conference Paper | IST-REx-ID: 3895
Chatterjee K, Henzinger TA, Jurdziński M. 2004. Games with secure equilibria. LICS: Logic in Computer Science 160–169.
View | DOI
 
[9]
2004 | Conference Paper | IST-REx-ID: 4558
Chatterjee K, Jurdziński M, Henzinger TA. 2004. Quantitative stochastic parity games. SODA: Symposium on Discrete Algorithms 121–130.
View
 
[8]
2004 | Conference Paper | IST-REx-ID: 4555
Chatterjee K, De Alfaro L, Henzinger TA. 2004. Trading memory for randomness. QEST: Quantitative Evaluation of Systems 206–217.
View | DOI
 
[7]
2004 | Conference Paper | IST-REx-ID: 3894
Chatterjee K, Majumdar R, Jurdziński M. 2004. On Nash equilibria in stochastic games. CSL: Computer Science Logic, LNCS , vol. 3210. 26–40.
View | DOI
 
[6]
2004 | Journal Article | IST-REx-ID: 4556
Chatterjee K, Ma D, Majumdar R, Zhao T, Henzinger TA, Palsberg J. 2004. Stack size analysis for interrupt-driven programs. Information and Computation. 194(2), 144–174.
View | DOI
 
[5]
2003 | Journal Article | IST-REx-ID: 3593
Chatterjee K, Dasgupta P, Chakrabarti P. 2003. A branching time temporal framework for quantitative reasoning. Journal of Automated Reasoning. 30(2), 205–232.
View | DOI
 
[4]
2003 | Conference Paper | IST-REx-ID: 3897
Chatterjee K, Jurdziński M, Henzinger TA. 2003. Simple stochastic parity games. CSL: Computer Science Logic, LNCS, vol. 2803. 100–113.
View | DOI
 
[3]
2003 | Conference Paper | IST-REx-ID: 3898
Chatterjee K, Ma D, Majumdar R, Zhao T, Henzinger TA, Palsberg J. 2003. Stack size analysis for interrupt-driven programs. SAS: Static Analysis Symposium, LNCS, vol. 2694. 109–126.
View | DOI
 
[2]
2002 | Conference Paper | IST-REx-ID: 3448
Mallick S, Chatterjee K, Merchant A, Dasgupta P. 2002. Implementation of shape grammar for plan analysis. IT-Built: Information Technology For Built Environment
View
 
[1]
2001 | Conference Paper | IST-REx-ID: 3447
Chatterjee K, Dasgupta P, Chakrabarti P. 2001. Weighted quantified computation tree logic. CIT: Conference on Information Technology
View
 

Search

Filter Publications

Display / Sort

Citation Style: IST Annual Report

Export / Embed