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


2015 | Journal Article | IST-REx-ID: 1559 | OA
R. Ibsen-Jensen, K. Chatterjee, and M. Nowak, “Computational complexity of ecological and evolutionary spatial dynamics,” PNAS, vol. 112, no. 51. National Academy of Sciences, pp. 15636–15641, 2015.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | PubMed | Europe PMC
 

2015 | Conference Paper | IST-REx-ID: 1594
V. Forejt, J. Krčál, and J. Kretinsky, “Controller synthesis for MDPs and frequency LTL\GU,” presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Suva, Fiji, 2015, vol. 9450, pp. 162–177.
View | DOI
 

2015 | Conference Paper | IST-REx-ID: 1601 | OA
T. Babiak et al., “The Hanoi omega-automata format,” presented at the CAV: Computer Aided Verification, San Francisco, CA, United States, 2015, vol. 9206, pp. 479–486.
[Submitted Version] View | Files available | DOI
 

2015 | Conference Paper | IST-REx-ID: 1609 | OA
K. Chatterjee, L. Doyen, and M. Vardi, “The complexity of synthesis from probabilistic components,” in 42nd International Colloquium, Kyoto, Japan, 2015, vol. 9135, pp. 108–120.
[Preprint] View | DOI | Download Preprint (ext.)
 

2015 | Journal Article | IST-REx-ID: 1624 | OA
A. Pavlogiannis, K. Chatterjee, B. Adlam, and M. Nowak, “Cellular cooperation with shift updating and repulsion,” Scientific Reports, vol. 5. Nature Publishing Group, 2015.
[Published Version] View | Files available | DOI
 

2015 | Conference Paper | IST-REx-ID: 1660 | OA
T. Brázdil, S. Kiefer, A. Kučera, and P. Novotný, “Long-run average behaviour of probabilistic vector addition systems,” presented at the LICS: Logic in Computer Science, Kyoto, Japan, 2015, pp. 44–55.
[Preprint] View | DOI | Download Preprint (ext.)
 

2015 | Journal Article | IST-REx-ID: 1665 | OA
Landau D, Tausch E, Taylor Weiner A, Stewart C, Reiter J, Bahlo J, Kluth S, Božić I, Lawrence M, Böttcher S, Carter S, Cibulskis K, Mertens D, Sougnez C, Rosenberg M, Hess J, Edelmann J, Kless S, Kneba M, Ritgen M, Fink A, Fischer K, Gabriel S, Lander E, Nowak M, Döhner H, Hallek M, Neuberg D, Getz G, Stilgenbauer S, Wu C. 2015. Mutations driving CLL and their evolution in progression and relapse. Nature. 526(7574), 525–530.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | PubMed | Europe PMC
 

2015 | Conference Paper | IST-REx-ID: 1667 | OA
T. Brázdil, L. Korenčiak, J. Krčál, P. Novotný, and V. Řehák, “Optimizing performance of continuous-time stochastic systems using timeout synthesis,” vol. 9259. Springer, pp. 141–159, 2015.
[Preprint] View | DOI | Download Preprint (ext.)
 

2015 | Journal Article | IST-REx-ID: 1673 | OA
B. Adlam, K. Chatterjee, and M. Nowak, “Amplifiers of selection,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 471, no. 2181. Royal Society of London, 2015.
[Published Version] View | Files available | DOI
 

2015 | Conference Paper | IST-REx-ID: 1691
M. Svoreňová et al., “Temporal logic motion planning using POMDPs with parity objectives: Case study paper,” in Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, Seattle, WA, United States, 2015, pp. 233–238.
View | DOI
 

2015 | Journal Article | IST-REx-ID: 1694
K. Chatterjee and V. Prabhu, “Quantitative temporal simulation and refinement distances for timed systems,” IEEE Transactions on Automatic Control, vol. 60, no. 9. IEEE, pp. 2291–2306, 2015.
View | DOI
 

2015 | Journal Article | IST-REx-ID: 1698 | OA
Y. Velner, K. Chatterjee, L. Doyen, T. A. Henzinger, A. Rabinovich, and J. Raskin, “The complexity of multi-mean-payoff and multi-energy games,” Information and Computation, vol. 241, no. 4. Elsevier, pp. 177–196, 2015.
[Preprint] View | DOI | Download Preprint (ext.)
 

2015 | Conference Paper | IST-REx-ID: 1820 | OA
K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Optimal cost almost-sure reachability in POMDPs,” in Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence , Austin, TX, USA, 2015, vol. 5, pp. 3496–3502.
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 

2015 | Conference Paper | IST-REx-ID: 1838 | OA
R. Bloem, K. Chatterjee, S. Jacobs, and R. Könighofer, “Assume-guarantee synthesis for concurrent reactive programs with partial information,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, London, United Kingdom, 2015, vol. 9035, pp. 517–532.
[Preprint] View | DOI | Download Preprint (ext.)
 

2015 | Conference Paper | IST-REx-ID: 1839 | OA
T. Brázdil, K. Chatterjee, V. Forejt, and A. Kučera, “Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives,” vol. 9035. Springer, pp. 181–187, 2015.
[Preprint] View | DOI | Download Preprint (ext.)
 

2015 | Journal Article | IST-REx-ID: 1846 | OA
N. Beneš, J. Kretinsky, K. Larsen, M. Möller, S. Sickert, and J. Srba, “Refinement checking on parametric modal transition systems,” Acta Informatica, vol. 52, no. 2–3. Springer, pp. 269–297, 2015.
[Submitted Version] View | Files available | DOI
 

2015 | Journal Article | IST-REx-ID: 1851 | OA
T. Priklopil, E. Kisdi, and M. Gyllenberg, “Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating,” Evolution, vol. 69, no. 4. Wiley, pp. 1015–1026, 2015.
[Submitted Version] View | Files available | DOI | PubMed | Europe PMC
 

2015 | Journal Article | IST-REx-ID: 1873 | OA
K. Chatterjee and M. Chmelik, “POMDPs under probabilistic semantics,” Artificial Intelligence, vol. 221. Elsevier, pp. 46–72, 2015.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2015 | Conference Paper | IST-REx-ID: 1882 | OA
U. Fahrenberg, J. Kretinsky, A. Legay, and L. Traonouez, “Compositionality for quantitative specifications,” presented at the FACS: Formal Aspects of Component Software, Bertinoro, Italy, 2015, vol. 8997, pp. 306–324.
[Preprint] View | DOI | Download Preprint (ext.)
 

2015 | Journal Article | IST-REx-ID: 2034 | OA
B. Bérard, K. Chatterjee, and N. Sznajder, “Probabilistic opacity for Markov decision processes,” Information Processing Letters, vol. 115, no. 1. Elsevier, pp. 52–59, 2015.
[Preprint] View | DOI | Download Preprint (ext.)
 

2015 | Journal Article | IST-REx-ID: 1598 | OA
K. Chatterjee, M. Joglekar, and N. Shah, “Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives,” Theoretical Computer Science, vol. 573, no. 3. Elsevier, pp. 71–89, 2015.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2015 | Journal Article | IST-REx-ID: 1731 | OA
K. Chatterjee, L. Doyen, H. Gimbert, and T. A. Henzinger, “Randomness for free,” Information and Computation, vol. 245, no. 12. Elsevier, pp. 3–16, 2015.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 

2015 | Journal Article | IST-REx-ID: 1856 | OA
K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “Measuring and synthesizing systems in probabilistic environments,” Journal of the ACM, vol. 62, no. 1. ACM, 2015.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 

2015 | Conference Paper | IST-REx-ID: 1661 | OA
K. Chatterjee, M. H. Henzinger, and V. Loitzenbauer, “Improved algorithms for one-pair and k-pair Streett objectives,” in Proceedings - Symposium on Logic in Computer Science, Kyoto, Japan, 2015, vol. 2015–July.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 

2015 | Journal Article | IST-REx-ID: 523 | OA
K. Chatterjee, L. Doyen, M. Randour, and J. Raskin, “Looking at mean-payoff and total-payoff through windows,” Information and Computation, vol. 242, no. 6. Elsevier, pp. 25–52, 2015.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 

2015 | Journal Article | IST-REx-ID: 524 | OA
K. Chatterjee and R. Ibsen-Jensen, “Qualitative analysis of concurrent mean payoff games,” Information and Computation, vol. 242, no. 6. Elsevier, pp. 2–24, 2015.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2015 | Conference Paper | IST-REx-ID: 1481 | OA
U. Ahmed, K. Chatterjee, and S. Gulwani, “Automatic generation of alternative starting positions for simple traditional board games,” in Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, Austin, TX, USA, 2015, vol. 2, pp. 745–752.
View | Files available | Download None (ext.)
 

2015 | Conference Paper | IST-REx-ID: 1732 | OA
K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Qualitative analysis of POMDPs with temporal logic specifications for robotics applications,” presented at the ICRA: International Conference on Robotics and Automation, Seattle, WA, United States, 2015, pp. 325–330.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2015 | Technical Report | IST-REx-ID: 5431 | OA
K. Chatterjee, R. Ibsen-Jensen, and K. Hansen, The patience of concurrent stochastic games with safety and reachability objectives. IST Austria, 2015.
[Published Version] View | Files available | DOI
 

2015 | Conference Paper | IST-REx-ID: 1657
K. Chatterjee, Z. Komárková, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes.” IEEE, pp. 244–256, 2015.
View | Files available | DOI
 

2015 | Conference Paper | IST-REx-ID: 1656
K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” in Proceedings - Symposium on Logic in Computer Science, Kyoto, Japan, 2015, vol. 2015–July.
View | Files available | DOI | arXiv
 

2015 | Technical Report | IST-REx-ID: 5429 | OA
K. Chatterjee, Z. Komarkova, and J. Kretinsky, Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria, 2015.
[Published Version] View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5435 | OA
K. Chatterjee, Z. Komarkova, and J. Kretinsky, Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria, 2015.
[Published Version] View | Files available | DOI
 

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

2015 | Conference Paper | IST-REx-ID: 1610 | OA
K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” in 42nd International Colloquium, Kyoto, Japan, 2015, vol. 9135, no. Part II, pp. 121–133.
View | Files available | DOI | Download None (ext.) | arXiv
 

2015 | Technical Report | IST-REx-ID: 5437 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015.
[Published Version] View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5430 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015.
[Published Version] View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5438 | OA
K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, Edit distance for pushdown automata. IST Austria, 2015.
[Published Version] View | Files available | DOI
 

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

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

2015 | Technical Report | IST-REx-ID: 5444 | OA
J. Reiter et al., Reconstructing robust phylogenies of metastatic cancers. IST Austria, 2015.
[Published Version] View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5443 | OA
K. Chatterjee, M. Chmelik, and J. Davies, A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs. IST Austria, 2015.
[Published Version] View | Files available | DOI
 

2015 | Journal Article | IST-REx-ID: 1709 | OA
J. Reiter, A. Kanodia, R. Gupta, M. Nowak, and K. Chatterjee, “Biological auctions with multiple rewards,” Proceedings of the Royal Society of London Series B Biological Sciences, vol. 282, no. 1812. Royal Society, 2015.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | PubMed | Europe PMC
 

2015 | Thesis | IST-REx-ID: 1400
J. Reiter, “The subclonal evolution of cancer,” Institute of Science and Technology Austria, 2015.
View | Files available
 

2015 | Conference Paper | IST-REx-ID: 1502 | OA
N. Beneš, P. Daca, T. A. Henzinger, J. Kretinsky, and D. Nickovic, “Complete composition operators for IOCO-testing theory,” presented at the CBSE: Component-Based Software Engineering , Montreal, QC, Canada, 2015, pp. 101–110.
[Submitted Version] View | Files available | DOI
 

2015 | Journal Article | IST-REx-ID: 1501 | OA
K. Chatterjee, M. Chmelik, and P. Daca, “CEGAR for compositional analysis of qualitative properties in Markov decision processes,” Formal Methods in System Design, vol. 47, no. 2. Springer, pp. 230–264, 2015.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 

2015 | Journal Article | IST-REx-ID: 1602 | OA
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, and P. Goyal, “Faster algorithms for algebraic path properties in recursive state machines with constant treewidth,” ACM SIGPLAN Notices, vol. 50, no. 1. ACM, pp. 97–109, 2015.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2015 | Journal Article | IST-REx-ID: 1604
K. Chatterjee, A. Pavlogiannis, and Y. Velner, “Quantitative interprocedural analysis,” Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT , vol. 50, no. 1. ACM, pp. 539–551, 2015.
View | Files available | DOI
 

2015 | Conference Paper | IST-REx-ID: 1607 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for quantitative verification in constant treewidth graphs,” presented at the CAV: Computer Aided Verification, San Francisco, CA, USA, 2015, vol. 9206, pp. 140–157.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 

2015 | Conference Paper | IST-REx-ID: 1714
K. Chatterjee, A. Pavlogiannis, A. Kößler, and U. Schmid, “A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks,” in Real-Time Systems Symposium, Rome, Italy, 2015, vol. 2015, no. January, pp. 118–127.
View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5441 | OA
K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, Algorithms for algebraic path properties in concurrent systems of constant treewidth components. IST Austria, 2015.
[Published Version] View | Files available | DOI
 

2015 | Conference Paper | IST-REx-ID: 1689 | OA
M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, and C. Belta, “Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games,” in Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, Seattle, WA, United States, 2015, pp. 259–268.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 

2015 | Journal Article | IST-REx-ID: 1681 | OA
T. Priklopil and K. Chatterjee, “Evolution of decisions in population games with sequentially searching individuals,” Games, vol. 6, no. 4. MDPI, pp. 413–437, 2015.
[Published Version] View | Files available | DOI
 

2015 | Conference Paper | IST-REx-ID: 1603 | OA
T. Brázdil, K. Chatterjee, M. Chmelik, A. Fellner, and J. Kretinsky, “Counterexample explanation by learning small strategies in Markov decision processes,” presented at the CAV: Computer Aided Verification, San Francisco, CA, United States, 2015, vol. 9206, pp. 158–177.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 

2015 | Research Data | IST-REx-ID: 5549 | OA
A. Fellner, “Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.” Institute of Science and Technology Austria, 2015.
[Published Version] View | Files available | DOI
 

2014 | Conference Paper | IST-REx-ID: 10884 | OA
B. Aminof, S. Jacobs, A. Khalimov, and S. Rubin, “Parameterized model checking of token-passing systems,” in Verification, Model Checking, and Abstract Interpretation, San Diego, CA, United States, 2014, vol. 8318, pp. 262–281.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2014 | Journal Article | IST-REx-ID: 1375 | OA
K. Chatterjee, M. H. Henzinger, S. Krinninger, V. Loitzenbauer, and M. Raskin, “Approximating the minimum cycle mean,” Theoretical Computer Science, vol. 547, no. C. Elsevier, pp. 104–116, 2014.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2014 | Conference Paper | IST-REx-ID: 1853
S. Jha, S. Tripakis, S. Seshia, and K. Chatterjee, “Game theoretic secure localization in wireless sensor networks,” presented at the IOT: Internet of Things, Cambridge, USA, 2014, pp. 85–90.
View | DOI
 

2014 | Journal Article | IST-REx-ID: 1884
D. Landau et al., “Novel putative driver gene mutations in chronic lymphocytic leukemia (CLL): results from a combined analysis of whole exome sequencing of 262 primary CLL aamples,” Blood, vol. 124, no. 21. American Society of Hematology, pp. 1952–1952, 2014.
View | Download None (ext.)
 

2014 | Conference Paper | IST-REx-ID: 2027 | OA
T. Brázdil et al., “Verification of markov decision processes using learning algorithms,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Sydney, Australia, 2014, vol. 8837, pp. 98–114.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2014 | Conference Paper | IST-REx-ID: 2053 | OA
H. Hermanns, J. Krčál, and J. Kretinsky, “Probabilistic bisimulation: Naturally on distributions,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Rome, Italy, 2014, vol. 8704, pp. 249–265.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2014 | Conference Paper | IST-REx-ID: 2052
B. Aminof, T. Kotek, S. Rubin, F. Spegni, and H. Veith, “Parameterized model checking of rendezvous systems,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Rome, Italy, 2014, vol. 8704, pp. 109–124.
View | DOI
 

2014 | Journal Article | IST-REx-ID: 2187 | OA
R. Bloem et al., “Synthesizing robust systems,” Acta Informatica, vol. 51, no. 3–4. Springer, pp. 193–220, 2014.
[Submitted Version] View | Files available | DOI
 

2014 | Conference Paper | IST-REx-ID: 2190 | OA
J. Esparza and J. Kretinsky, “From LTL to deterministic automata: A safraless compositional approach,” presented at the CAV: Computer Aided Verification, 2014, vol. 8559, pp. 192–208.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2014 | Journal Article | IST-REx-ID: 2234 | OA
T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, and A. Kučera, “Markov decision processes with multiple long-run average objectives,” Logical Methods in Computer Science, vol. 10, no. 1. International Federation of Computational Logic, 2014.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

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
 

Filters and Search Terms

department=KrCh

Search

Filter Publications