Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

459 Publications


2014 | Journal Article | IST-REx-ID: 2246 | OA
A. Grinshpun, P. Phalitnonkiat, S. Rubin, and A. Tarfulea, “Alternating traps in Muller and parity games,” Theoretical Computer Science, vol. 521. Elsevier, pp. 73–91, 2014.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2014 | Journal Article | IST-REx-ID: 2716 | OA
K. Chatterjee, M. Randour, and J. Raskin, “Strategy synthesis for multi-dimensional quantitative objectives,” Acta Informatica, vol. 51, no. 3–4. Springer, pp. 129–163, 2014.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2014 | Journal Article | IST-REx-ID: 1733 | OA
P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface simulation distances,” Theoretical Computer Science, vol. 560, no. 3. Elsevier, pp. 348–363, 2014.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 

2014 | Journal Article | IST-REx-ID: 2141 | OA
K. Chatterjee and M. H. Henzinger, “Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition,” Journal of the ACM, vol. 61, no. 3. ACM, 2014.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 

2014 | Conference Paper | IST-REx-ID: 2054
K. Chatterjee, “Qualitative concurrent parity games: Bounded rationality,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Rome, Italy, 2014, vol. 8704, pp. 544–559.
View | Files available | DOI
 

2014 | Conference Paper | IST-REx-ID: 475 | OA
B. Aminof and S. Rubin, “First cycle games,” in Electronic Proceedings in Theoretical Computer Science, EPTCS, Grenoble, France, 2014, vol. 146, pp. 83–90.
[Published Version] View | Files available | DOI
 

2014 | Conference Paper | IST-REx-ID: 1903
K. Chatterjee, “Partial-observation stochastic reachability and parity games,” presented at the MFCS: Mathematical Foundations of Computer Science, Budapest, Hungary, 2014, vol. 8634, no. PART 1, pp. 1–4.
View | Files available | DOI
 

2014 | Journal Article | IST-REx-ID: 2211 | OA
K. Chatterjee and L. Doyen, “Partial-observation stochastic games: How to win when belief fails,” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 2. ACM, 2014.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2014 | Journal Article | IST-REx-ID: 2038 | OA
U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 4. ACM, 2014.
[Submitted Version] View | Files available | DOI
 

2014 | Conference Paper | IST-REx-ID: 2162 | OA
K. Chatterjee and R. Ibsen-Jensen, “The complexity of ergodic mean payoff games,” presented at the ICST: International Conference on Software Testing, Verification and Validation, Copenhagen, Denmark, 2014, vol. 8573, no. Part 2, pp. 122–133.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2014 | Conference Paper | IST-REx-ID: 2213 | OA
K. Chatterjee, L. Doyen, S. Nain, and M. Vardi, “The complexity of partial-observation stochastic parity games with finite-memory strategies,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France, 2014, vol. 8412, pp. 242–257.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2014 | Conference Paper | IST-REx-ID: 2212
K. Chatterjee, L. Doyen, H. Gimbert, and Y. Oualhadj, “Perfect-information stochastic mean-payoff parity games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France, 2014, vol. 8412, pp. 210–225.
View | Files available | DOI
 

2014 | Conference Paper | IST-REx-ID: 2216 | OA
K. Chatterjee, R. Ibsen-Jensen, and R. Majumdar, “Edit distance for timed automata,” presented at the HSCC: Hybrid Systems - Computation and Control, Berlin, Germany, 2014, pp. 303–312.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 

2014 | Technical Report | IST-REx-ID: 5413 | OA
K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis of probabilistic systems. IST Austria, 2014.
[Published Version] View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5414 | OA
K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis of probabilistic systems. IST Austria, 2014.
[Published Version] View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5412 | OA
K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis of probabilistic systems. IST Austria, 2014.
[Published Version] View | Files available | DOI
 

2014 | Conference Paper | IST-REx-ID: 2163 | OA
K. Chatterjee and L. Doyen, “Games with a weak adversary,” in Lecture Notes in Computer Science, Copenhagen, Denmark, 2014, vol. 8573, no. Part 2, pp. 110–121.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2014 | Technical Report | IST-REx-ID: 5419 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Improved algorithms for reachability and shortest path on low tree-width graphs. IST Austria, 2014.
[Published Version] View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5418 | OA
K. Chatterjee and L. Doyen, Games with a weak adversary. IST Austria, 2014.
[Published Version] View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5420 | OA
K. Chatterjee and R. Ibsen-Jensen, The value 1 problem for concurrent mean-payoff games. IST Austria, 2014.
[Published Version] View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5424 | OA
K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria, 2014.
[Published Version] View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5426 | OA
K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria, 2014.
[Published Version] View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5423 | OA
K. Chatterjee, A. Kössler, A. Pavlogiannis, and U. Schmid, A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. IST Austria, 2014.
[Published Version] View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5427 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Optimal tree-decomposition balancing and reachability on low treewidth graphs. IST Austria, 2014.
[Published Version] View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5415 | OA
K. Chatterjee, T. A. Henzinger, and J. Otop, Nested weighted automata. IST Austria, 2014.
[Published Version] View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5421 | OA
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolution on graphs. IST Austria, 2014.
[Published Version] View | Files available | DOI
 

2014 | Conference Paper | IST-REx-ID: 10885
K. Chatterjee, L. Doyen, E. Filiot, and J.-F. Raskin, “Doomsday equilibria for omega-regular games,” in VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, San Diego, CA, United States, 2014, vol. 8318, pp. 78–97.
[Preprint] View | Files available | DOI | arXiv
 

2014 | Journal Article | IST-REx-ID: 2039 | OA
K. Chatterjee, A. Pavlogiannis, B. Adlam, and M. Nowak, “The time scale of evolutionary innovation,” PLoS Computational Biology, vol. 10, no. 9. Public Library of Science, 2014.
[Published Version] View | Files available | DOI
 

2014 | Research Data Reference | IST-REx-ID: 9739
K. Chatterjee, A. Pavlogiannis, B. Adlam, and M. Novak, “Detailed proofs for ‘The time scale of evolutionary innovation.’” Public Library of Science, 2014.
[Published Version] View | Files available | DOI
 

2014 | Journal Article | IST-REx-ID: 535 | OA
K. Chatterjee, M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial-time algorithms for energy games with special weight structures,” Algorithmica, vol. 70, no. 3. Springer, pp. 457–492, 2014.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2014 | Conference Paper | IST-REx-ID: 2063
K. Chatterjee, M. Chmelik, and P. Daca, “CEGAR for qualitative analysis of probabilistic systems,” presented at the CAV: Computer Aided Verification, Vienna, Austria, 2014, vol. 8559, pp. 473–490.
View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5428 | OA
K. Chatterjee, T. A. Henzinger, J. Otop, and Y. Velner, Quantitative fair simulation games. IST Austria, 2014.
[Published Version] View | Files available | DOI
 

2013 | Conference Paper | IST-REx-ID: 1374 | OA
K. Chatterjee and N. Fijalkow, “Infinite-state games with finitary conditions,” in 22nd EACSL Annual Conference on Computer Science Logic, Torino, Italy, 2013, vol. 23, pp. 181–196.
[Published Version] View | Files available | DOI
 

2013 | Conference Paper | IST-REx-ID: 2238
K. Chatterjee, V. Forejt, and D. Wojtczak, “Multi-objective discounted reward verification in graphs and MDPs,” vol. 8312. Springer, pp. 228–242, 2013.
View | DOI
 

2013 | Conference (Editor) | IST-REx-ID: 2292
K. Chatterjee and J. Sgall, Eds., Mathematical Foundations of Computer Science 2013, vol. 8087. Springer, 2013, p. VI-854.
View | DOI
 

2013 | Journal Article | IST-REx-ID: 2299 | OA
Y. Godhal, K. Chatterjee, and T. A. Henzinger, “Synthesis of AMBA AHB from formal specification: A case study,” International Journal on Software Tools for Technology Transfer, vol. 15, no. 5–6. Springer, pp. 585–601, 2013.
[Submitted Version] View | Files available | DOI
 

2013 | Conference Paper | IST-REx-ID: 2446 | OA
K. Chatterjee, A. Gaiser, and J. Kretinsky, “Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis,” vol. 8044. Springer, pp. 559–575, 2013.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2013 | Conference Paper | IST-REx-ID: 2444 | OA
K. Chatterjee and J. Ła̧Cki, “Faster algorithms for Markov decision processes with low treewidth,” vol. 8044. Springer, pp. 543–558, 2013.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2013 | Journal Article | IST-REx-ID: 2814 | OA
K. Chatterjee, L. Alfaro, and R. Majumdar, “The complexity of coverage,” International Journal of Foundations of Computer Science, vol. 24, no. 2. World Scientific Publishing, pp. 165–185, 2013.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2013 | Journal Article | IST-REx-ID: 2817 | OA
S. Novak, K. Chatterjee, and M. Nowak, “Density games,” Journal of Theoretical Biology, vol. 334. Elsevier, pp. 26–34, 2013.
[Published Version] View | Files available | DOI
 

2013 | Conference Paper | IST-REx-ID: 2819 | OA
K. Chatterjee and V. Prabhu, “Quantitative timed simulation functions and refinement metrics for real-time systems,” in Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control, Philadelphia, PA USA, 2013, vol. 1, pp. 273–282.
[Preprint] View | DOI | Download Preprint (ext.)
 

2013 | Journal Article | IST-REx-ID: 2824
K. Chatterjee and V. Prabhu, “Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems,” Information and Computation, vol. 228–229. Elsevier, pp. 83–119, 2013.
View | DOI
 

2013 | Journal Article | IST-REx-ID: 2836 | OA
K. Chatterjee and V. Raman, “Assume-guarantee synthesis for digital contract signing,” Formal Aspects of Computing, vol. 26, no. 4. Springer, pp. 825–859, 2013.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2013 | Journal Article | IST-REx-ID: 2854 | OA
K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Strategy improvement for concurrent reachability and turn based stochastic safety games,” Journal of Computer and System Sciences, vol. 79, no. 5. Elsevier, pp. 640–657, 2013.
[Published Version] View | Files available | DOI
 

2013 | Conference Paper | IST-REx-ID: 2886 | OA
M. Chmelik and V. Řehák, “Controllable-choice message sequence graphs,” vol. 7721. Springer, pp. 118–130, 2013.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2013 | Journal Article | IST-REx-ID: 3116
K. Chatterjee, L. De Alfaro, M. Faella, R. Majumdar, and V. Raman, “Code aware resource management,” Formal Methods in System Design, vol. 42, no. 2. Springer, pp. 142–174, 2013.
View | DOI
 

2013 | Journal Article | IST-REx-ID: 2831 | OA
K. Chatterjee, M. H. Henzinger, M. Joglekar, and N. Shah, “Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives,” Formal Methods in System Design, vol. 42, no. 3. Springer, pp. 301–327, 2013.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2013 | Conference Paper | IST-REx-ID: 2279 | OA
K. Chatterjee, L. Doyen, M. Randour, and J. Raskin, “Looking at mean-payoff and total-payoff through windows,” vol. 8172. Springer, pp. 118–132, 2013.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 

2013 | Technical Report | IST-REx-ID: 5399 | OA
J. Reiter, I. Bozic, K. Chatterjee, and M. Nowak, TTP: Tool for Tumor Progression. IST Austria, 2013.
[Published Version] View | Files available | DOI
 

2013 | Conference Paper | IST-REx-ID: 2295 | OA
K. Chatterjee, M. Chmelik, and M. Tracol, “What is decidable about partially observable Markov decision processes with omega-regular objectives,” vol. 23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 165–180, 2013.
[Published Version] View | Files available | DOI
 

Filters and Search Terms

department=KrCh

Search

Filter Publications