Please note that IST 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.

331 Publications


2017 | Conference Paper | IST-REx-ID: 1194   OA
Stochastic invariants for probabilistic termination
K. Chatterjee, P. Novotny, D. Zikelic, in:, ACM, 2017, pp. 145–160.
View | DOI | Download (ext.)
 

2017 | Technical Report | IST-REx-ID: 5456   OA
Data-centric dynamic partial order reduction
M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, K. Vaidya, Data-Centric Dynamic Partial Order Reduction, IST Austria, 2017.
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 551   OA
Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 645   OA
Value iteration for long run average reward in markov decision processes
P. Ashok, K. Chatterjee, P. Daca, J. Kretinsky, T. Meggendorfer, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 201–221.
View | DOI | Download (ext.)
 

2017 | Journal Article | IST-REx-ID: 671   OA
Memory-n strategies of direct reciprocity
C. Hilbe, V. Martinez, K. Chatterjee, M. Nowak, PNAS 114 (2017) 4715–4720.
View | DOI | Download (ext.) | PubMed | Europe PMC
 

2017 | Journal Article | IST-REx-ID: 467   OA
Nested weighted automata
K. Chatterjee, T.A. Henzinger, J. Otop, ACM Transactions on Computational Logic (TOCL) 18 (2017) 31.
View | Files available | DOI | Download (ext.) | arXiv
 

2017 | Conference Paper | IST-REx-ID: 950   OA
Infinite-duration bidding games
G. Avni, T.A. Henzinger, V.K. Chonev, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 17.
View | Files available | DOI | arXiv
 

2017 | Conference Paper | IST-REx-ID: 552   OA
Faster algorithms for mean payoff parity games
K. Chatterjee, M. Henzinger, A. Svozil, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 639   OA
Non-polynomial worst case analysis of recursive programs
K. Chatterjee, H. Fu, A. Goharshady, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 41–63.
View | DOI | Download (ext.)
 

2017 | Journal Article | IST-REx-ID: 653
Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer
A. Makohon Moore, M. Zhang, J. Reiter, I. Božić, B. Allen, D. Kundu, K. Chatterjee, F. Wong, Y. Jiao, Z. Kohutek, J. Hong, M. Attiyeh, B. Javier, L. Wood, R. Hruban, M. Nowak, N. Papadopoulos, K. Kinzler, B. Vogelstein, C. Iacobuzio Donahue, Nature Genetics 49 (2017) 358–366.
View | DOI
 

2017 | Journal Article | IST-REx-ID: 684   OA
Obligation blackwell games and p-automata
K. Chatterjee, N. Piterman, Journal of Symbolic Logic 82 (2017) 420–452.
View | DOI | Download (ext.)
 

2017 | Conference Paper | IST-REx-ID: 711   OA
Bidirectional nested weighted automata
K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 716
The complexity of mean-payoff pushdown games
K. Chatterjee, Y. Velner, Journal of the ACM 64 (2017) 34.
View | DOI
 

2017 | Conference Paper | IST-REx-ID: 949   OA
JTDec: A tool for tree decompositions in soot
K. Chatterjee, A. Goharshady, A. Pavlogiannis, in:, D. D’Souza (Ed.), Springer, 2017, pp. 59–66.
View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 464   OA
Improved algorithms for parity and Streett objectives
K. Chatterjee, M. Henzinger, V. Loitzenbauer, Logical Methods in Computer Science 13 (2017).
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 553   OA
Strategy complexity of concurrent safety games
K. Chatterjee, K. Hansen, R. Ibsen-Jensen, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
View | Files available | DOI | Download (ext.)
 

2017 | Conference Paper | IST-REx-ID: 628   OA
Automated recurrence analysis for almost linear expected runtime bounds
K. Chatterjee, H. Fu, A. Murhekar, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 118–139.
View | DOI | Download (ext.)
 

2017 | Conference Paper | IST-REx-ID: 6519   OA
Improved set-based symbolic algorithms for parity games
K. Chatterjee, W. Dvorák, M. Henzinger, V. Loitzenbauer, in:, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017, p. 18.
View | Files available | DOI
 

2017 | Research Data | IST-REx-ID: 5559
Strong amplifiers of natural selection
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak , Strong Amplifiers of Natural Selection, IST Austria, 2017.
View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 717
Hyperplane separation technique for multidimensional mean-payoff games
K. Chatterjee, Y. Velner, Journal of Computer and System Sciences 88 (2017) 236–259.
View | Files available | DOI | Download (ext.)
 
 

2016 | Conference Paper | IST-REx-ID: 1325   OA
Stability in graphs and games
T. Brázdil, V. Forejt, A. Kučera, P. Novotny, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.
View | Files available | DOI
 

2016 | Journal Article | IST-REx-ID: 1426   OA
Coevolutionary interactions between farmers and mafia induce host acceptance of avian brood parasites
M. Chakra, C. Hilbe, A. Traulsen, Royal Society Open Science 3 (2016).
View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1166
A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps
K. Chatterjee, M. Chmelik, J. Davies, in:, Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, AAAI Press, 2016, pp. 3225–3232.
View | Files available
 

2016 | Conference Paper | IST-REx-ID: 1438
Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
K. Chatterjee, H. Fu, P. Novotny, R. Hasheminezhad, in:, ACM, 2016, pp. 327–342.
View | Files available | DOI | Download (ext.) | arXiv
 

2016 | Conference Paper | IST-REx-ID: 1326   OA
Optimizing the expected mean payoff in Energy Markov Decision Processes
T. Brázdil, A. Kučera, P. Novotny, in:, Springer, 2016, pp. 32–49.
View | DOI | Download (ext.)
 

2016 | Journal Article | IST-REx-ID: 1333   OA
Humans choose representatives who enforce cooperation in social dilemmas through extortion
M. Milinski, C. Hilbe, D. Semmann, R. Sommerfeld, J. Marotzke, Nature Communications 7 (2016).
View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1340   OA
The big match in small space
K. Hansen, R. Ibsen-Jensen, M. Koucký, in:, Springer, 2016, pp. 64–76.
View | DOI | Download (ext.)
 

2016 | Conference Paper | IST-REx-ID: 478   OA
The complexity of deciding legality of a single step of magic: The gathering
K. Chatterjee, R. Ibsen-Jensen, in:, IOS Press, 2016, pp. 1432–1439.
View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 480   OA
Perfect-information stochastic games with generalized mean-payoff objectives
K. Chatterjee, L. Doyen, in:, IEEE, 2016, pp. 247–256.
View | DOI | Download (ext.)
 

2016 | Journal Article | IST-REx-ID: 1477
What is decidable about partially observable Markov decision processes with ω-regular objectives
K. Chatterjee, M. Chmelik, M. Tracol, Journal of Computer and System Sciences 82 (2016) 878–911.
View | Files available | DOI | Download (ext.) | arXiv
 

2016 | Conference Paper | IST-REx-ID: 1182   OA
Robust draws in balanced knockout tournaments
K. Chatterjee, R. Ibsen-Jensen, J. Tkadlec, in:, AAAI Press, 2016, pp. 172–179.
View | Files available | Download (ext.)
 

2016 | Conference Paper | IST-REx-ID: 1245
Game-theoretic models identify useful principles for peer collaboration in online learning platforms
V. Pandey, K. Chatterjee, in:, Proceedings of the ACM Conference on Computer Supported Cooperative Work, ACM, 2016, pp. 365–368.
View | DOI
 

2016 | Journal Article | IST-REx-ID: 1322   OA
Asymmetric power boosts extortion in an economic experiment
C. Hilbe, K. Hagel, M. Milinski, PLoS One 11 (2016).
View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1327   OA
Stochastic shortest path with energy constraints in POMDPs
T. Brázdil, K. Chatterjee, M. Chmelik, A. Gupta, P. Novotny, in:, Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems, ACM, 2016, pp. 1465–1466.
View | Download (ext.)
 

2016 | Conference Paper | IST-REx-ID: 1389   OA
On recurrent reachability for continuous linear dynamical systems
V.K. Chonev, J. Ouaknine, J. Worrell, in:, LICS ’16, IEEE, 2016, pp. 515–524.
View | DOI | Download (ext.)
 

2016 | Journal Article | IST-REx-ID: 1423   OA
Comparing reactive and memory-one strategies of direct reciprocity
S. Baek, H. Jeong, C. Hilbe, M. Nowak, Scientific Reports 6 (2016).
View | Files available | DOI
 

2016 | Journal Article | IST-REx-ID: 1529
Optimal cost almost-sure reachability in POMDPs
K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, Artificial Intelligence 234 (2016) 26–48.
View | Files available | DOI | Download (ext.) | arXiv
 

2016 | Technical Report | IST-REx-ID: 5451   OA
Strong amplifiers of natural selection
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Strong Amplifiers of Natural Selection, IST Austria, 2016.
View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1093
Linear distances between Markov chains
P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.
View | Files available | DOI
 

2016 | Technical Report | IST-REx-ID: 5449
Amplification on undirected population structures: Comets beat stars
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Amplification on Undirected Population Structures: Comets Beat Stars, IST Austria, 2016.
View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1068   OA
Conditionally optimal algorithms for generalized Büchi Games
K. Chatterjee, W. Dvorák, M. Henzinger, V. Loitzenbauer, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.
View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1070   OA
Computation tree logic for synchronization properties
K. Chatterjee, L. Doyen, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.
View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1138   OA
Quantitative automata under probabilistic semantics
K. Chatterjee, T.A. Henzinger, J. Otop, in:, Proceedings of the 31st Annual ACM/IEEE Symposium, IEEE, 2016, pp. 76–85.
View | DOI | Download (ext.)
 

2016 | Conference Paper | IST-REx-ID: 1140   OA
Model and objective separation with conditional lower bounds disjunction is harder than conjunction
K. Chatterjee, W. Dvoák, M. Henzinger, V. Loitzenbauer, in:, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2016, pp. 197–206.
View | DOI | Download (ext.)
 

2016 | Conference Paper | IST-REx-ID: 1335   OA
Quantitative monitor automata
K. Chatterjee, T.A. Henzinger, J. Otop, in:, Springer, 2016, pp. 23–38.
View | DOI | Download (ext.)
 

2016 | Thesis | IST-REx-ID: 1397
Algorithms for partially observable markov decision processes
M. Chmelik, Algorithms for Partially Observable Markov Decision Processes, IST Austria, 2016.
View
 

2016 | Journal Article | IST-REx-ID: 1380   OA
On the complexity of the orbit problem
V.K. Chonev, J. Ouaknine, J. Worrell, Journal of the ACM 63 (2016).
View | DOI | Download (ext.)
 

2016 | Journal Article | IST-REx-ID: 1518   OA
Efficient strategies for calculating blockwise likelihoods under the coalescent
K. Lohse, M. Chmelik, S. Martin, N.H. Barton, Genetics 202 (2016) 775–786.
View | Files available | DOI
 

2016 | Technical Report | IST-REx-ID: 5445   OA
Quantitative interprocedural analysis
K. Chatterjee, A. Pavlogiannis, Y. Velner, Quantitative Interprocedural Analysis, IST Austria, 2016.
View | Files available | DOI
 

2016 | Technical Report | IST-REx-ID: 5452
Arbitrarily strong amplifiers of natural selection
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Arbitrarily Strong Amplifiers of Natural Selection, IST Austria, 2016.
View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1090   OA
Nested weighted limit-average automata of bounded width
K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.
View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1069   OA
On the skolem problem for continuous linear dynamical systems
V.K. Chonev, J. Ouaknine, J. Worrell, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.
View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1324
Indefinite-horizon reachability in Goal-DEC-POMDPs
K. Chatterjee, M. Chmelik, in:, Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling, AAAI Press, 2016, pp. 88–96.
View | Download (ext.)
 

2016 | Conference Paper | IST-REx-ID: 1386   OA
Termination analysis of probabilistic programs through Positivstellensatz's
K. Chatterjee, H. Fu, A. Goharshady, in:, Springer, 2016, pp. 3–22.
View | DOI | Download (ext.)
 

2016 | Technical Report | IST-REx-ID: 5453   OA
Arbitrarily strong amplifiers of natural selection
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Arbitrarily Strong Amplifiers of Natural Selection, IST Austria, 2016.
View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1071
Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.
View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1437
Algorithms for algebraic path properties in concurrent systems of constant treewidth components
K. Chatterjee, A. Goharshady, R. Ibsen-Jensen, A. Pavlogiannis, in:, ACM, 2016, pp. 733–747.
View | Files available | DOI | Download (ext.) | arXiv
 

2015 | Conference Paper | IST-REx-ID: 1609   OA
The complexity of synthesis from probabilistic components
K. Chatterjee, L. Doyen, M. Vardi, 9135 (2015) 108–120.
View | DOI | Download (ext.)
 

2015 | Journal Article | IST-REx-ID: 1673   OA
Amplifiers of selection
B. Adlam, K. Chatterjee, M. Nowak, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 471 (2015) 20150114.
View | Files available | DOI
 

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

2015 | Conference Paper | IST-REx-ID: 1882   OA
Compositionality for quantitative specifications
U. Fahrenberg, J. Kretinsky, A. Legay, L. Traonouez, in:, Springer, 2015, pp. 306–324.
View | DOI | Download (ext.)
 

2015 | Journal Article | IST-REx-ID: 1851 View | DOI
 

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

2015 | Journal Article | IST-REx-ID: 1731
Randomness for free
K. Chatterjee, L. Doyen, H. Gimbert, T.A. Henzinger, Information and Computation 245 (2015) 3–16.
View | Files available | DOI | Download (ext.)
 

2015 | Conference Paper | IST-REx-ID: 1661
Improved algorithms for one-pair and k-pair Streett objectives
K. Chatterjee, M. Henzinger, V. Loitzenbauer, in:, Proceedings - Symposium on Logic in Computer Science, IEEE, 2015, p. 7174888.
View | Files available | DOI | Download (ext.)
 

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

2015 | Technical Report | IST-REx-ID: 5430
Faster algorithms for quantitative verification in constant treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015.
View | Files available | DOI
 

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

2015 | Technical Report | IST-REx-ID: 5435
Unifying two views on multiple mean-payoff objectives in Markov decision processes
K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.
View | Files available | DOI
 

2015 | Journal Article | IST-REx-ID: 1559   OA
Computational complexity of ecological and evolutionary spatial dynamics
R. Ibsen-Jensen, K. Chatterjee, M. Nowak, PNAS 112 (2015) 15636–15641.
View | DOI | Download (ext.) | PubMed | Europe PMC
 

2015 | Journal Article | IST-REx-ID: 1624   OA
Cellular cooperation with shift updating and repulsion
A. Pavlogiannis, K. Chatterjee, B. Adlam, M. Nowak, Scientific Reports 5 (2015).
View | Files available | DOI
 

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

2015 | Journal Article | IST-REx-ID: 1681   OA
Evolution of decisions in population games with sequentially searching individuals
T. Priklopil, K. Chatterjee, Games 6 (2015) 413–437.
View | Files available | DOI
 

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

2015 | Conference Paper | IST-REx-ID: 1838   OA
Assume-guarantee synthesis for concurrent reactive programs with partial information
R. Bloem, K. Chatterjee, S. Jacobs, R. Könighofer, in:, Springer, 2015, pp. 517–532.
View | DOI | Download (ext.)
 

2015 | Journal Article | IST-REx-ID: 524
Qualitative analysis of concurrent mean payoff games
K. Chatterjee, R. Ibsen-Jensen, Information and Computation 242 (2015) 2–24.
View | Files available | DOI | Download (ext.) | arXiv
 

2015 | Conference Paper | IST-REx-ID: 1732
Qualitative analysis of POMDPs with temporal logic specifications for robotics applications
K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, in:, IEEE, 2015, pp. 325–330.
View | Files available | DOI | Download (ext.) | arXiv
 

2015 | Technical Report | IST-REx-ID: 5443   OA
A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs
K. Chatterjee, M. Chmelik, J. Davies, A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs, IST Austria, 2015.
View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5431   OA
The patience of concurrent stochastic games with safety and reachability objectives
K. Chatterjee, R. Ibsen-Jensen, K. Hansen, The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives, IST Austria, 2015.
View | Files available | DOI
 

2015 | Research Data | IST-REx-ID: 5549   OA
Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes
A. Fellner, Experimental Part of CAV 2015 Publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes, IST Austria, 2015.
View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5429
Unifying two views on multiple mean-payoff objectives in Markov decision processes
K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.
View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5436
Nested weighted automata
K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria, 2015.
View | Files available | DOI
 

2015 | Conference Paper | IST-REx-ID: 1601
The Hanoi omega-automata format
T. Babiak, F. Blahoudek, A. Duret Lutz, J. Klein, J. Kretinsky, D. Mueller, D. Parker, J. Strejček, in:, Springer, 2015, pp. 479–486.
View | DOI
 

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

2015 | Journal Article | IST-REx-ID: 1846
Refinement checking on parametric modal transition systems
N. Beneš, J. Kretinsky, K. Larsen, M. Möller, S. Sickert, J. Srba, Acta Informatica 52 (2015) 269–297.
View | DOI
 

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

2015 | Journal Article | IST-REx-ID: 2034   OA
Probabilistic opacity for Markov decision processes
B. Bérard, K. Chatterjee, N. Sznajder, Information Processing Letters 115 (2015) 52–59.
View | DOI | Download (ext.)
 

2015 | Journal Article | IST-REx-ID: 1598
Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives
K. Chatterjee, M. Joglekar, N. Shah, Theoretical Computer Science 573 (2015) 71–89.
View | Files available | DOI | Download (ext.)
 

2015 | Technical Report | IST-REx-ID: 5437   OA
Faster algorithms for quantitative verification in constant treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015.
View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5444   OA
Reconstructing robust phylogenies of metastatic cancers
J. Reiter, A. Makohon-Moore, J. Gerold, I. Bozic, K. Chatterjee, C. Iacobuzio-Donahue, B. Vogelstein, M. Nowak, Reconstructing Robust Phylogenies of Metastatic Cancers, IST Austria, 2015.
View | Files available | DOI
 

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

2015 | Technical Report | IST-REx-ID: 5432
The complexity of evolutionary games on graphs
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.
View | Files available | DOI
 

2015 | Conference Paper | IST-REx-ID: 1656
Nested weighted automata
K. Chatterjee, T.A. Henzinger, J. Otop, in:, Proceedings - Symposium on Logic in Computer Science, IEEE, 2015, p. 7174926.
View | Files available | DOI | arXiv
 

2015 | Conference Paper | IST-REx-ID: 1594
Controller synthesis for MDPs and frequency LTL\GU
V. Forejt, J. Krčál, J. Kretinsky, in:, Springer, 2015, pp. 162–177.
View | DOI
 

2015 | Journal Article | IST-REx-ID: 1873   OA
POMDPs under probabilistic semantics
K. Chatterjee, M. Chmelik, Artificial Intelligence 221 (2015) 46–72.
View | DOI | Download (ext.) | arXiv
 

2015 | Conference Paper | IST-REx-ID: 1481
Automatic generation of alternative starting positions for simple traditional board games
U. Ahmed, K. Chatterjee, S. Gulwani, in:, AAAI Press, 2015, pp. 745–752.
View | Files available | Download (ext.)
 

2015 | Journal Article | IST-REx-ID: 1501
CEGAR for compositional analysis of qualitative properties in Markov decision processes
K. Chatterjee, M. Chmelik, P. Daca, Formal Methods in System Design 47 (2015) 230–264.
View | Files available | DOI | Download (ext.)
 

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

2015 | Conference Paper | IST-REx-ID: 1607
Faster algorithms for quantitative verification in constant treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, Springer, 2015, pp. 140–157.
View | Files available | DOI | Download (ext.)
 

Filters and Search Terms

department=KrCh

Search

Filter Publications

Display / Sort

Citation Style: Default

Export / Embed