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.

350 Publications


2018 | Conference Paper | IST-REx-ID: 35 | OA
Chatterjee, Krishnendu, et al. “Algorithms and Conditional Lower Bounds for Planning Problems.” 28th International Conference on Automated Planning and Scheduling , AAAI Press, 2018.
View | Download None (ext.) | arXiv
 

2018 | Conference Paper | IST-REx-ID: 25 | OA
Horák, Karel, et al. “Goal-HSVI: Heuristic Search Value Iteration for Goal-POMDPs.” Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, vol. 2018–July, IJCAI, 2018, pp. 4764–70, doi:10.24963/ijcai.2018/662.
View | DOI | Download Published Version (ext.)
 

2017 | Journal Article | IST-REx-ID: 716 | OA
Chatterjee, Krishnendu, and Yaron Velner. “The Complexity of Mean-Payoff Pushdown Games.” Journal of the ACM, vol. 64, no. 5, ACM, 2017, p. 34, doi:10.1145/3121408.
View | DOI | Download Preprint (ext.) | arXiv
 

2017 | Journal Article | IST-REx-ID: 717 | OA
Chatterjee, Krishnendu, and Yaron Velner. “Hyperplane Separation Technique for Multidimensional Mean-Payoff Games.” Journal of Computer and System Sciences, vol. 88, Academic Press, 2017, pp. 236–59, doi:10.1016/j.jcss.2017.04.005.
View | Files available | DOI | Download Preprint (ext.)
 

2017 | Journal Article | IST-REx-ID: 719
Chatterjee, Krishnendu, and Rüdiger Ehlers. “Special Issue: Synthesis and SYNT 2014.” Acta Informatica, vol. 54, no. 6, Springer, 2017, pp. 543–44, doi:10.1007/s00236-017-0299-0.
View | DOI
 

2017 | Journal Article | IST-REx-ID: 744 | OA
Priklopil, Tadeas, et al. “Optional Interactions and Suspicious Behaviour Facilitates Trustful Cooperation in Prisoners Dilemma.” Journal of Theoretical Biology, vol. 433, Elsevier, 2017, pp. 64–72, doi:10.1016/j.jtbi.2017.08.025.
View | Files available | DOI | PubMed | Europe PMC
 

2017 | Journal Article | IST-REx-ID: 464 | OA
Chatterjee, Krishnendu, et al. “Improved Algorithms for Parity and Streett Objectives.” Logical Methods in Computer Science, vol. 13, no. 3, 26, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(3:26)2017.
View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 465 | OA
Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.” Logical Methods in Computer Science, vol. 13, no. 3, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(3:23)2017.
View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 466 | OA
Chatterjee, Krishnendu, et al. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” Logical Methods in Computer Science, vol. 13, no. 2, 15, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(2:15)2017.
View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 467 | OA
Chatterjee, Krishnendu, et al. “Nested Weighted Automata.” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 4, 31, ACM, 2017, doi:10.1145/3152769.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2017 | Journal Article | IST-REx-ID: 512 | OA
Pavlogiannis, Andreas, et al. “Amplification on Undirected Population Structures: Comets Beat Stars.” Scientific Reports, vol. 7, no. 1, 82, Nature Publishing Group, 2017, doi:10.1038/s41598-017-00107-w.
View | Files available | DOI
 

2017 | Technical Report | IST-REx-ID: 5455 | OA
Chatterjee, Krishnendu, et al. Optimal Dyck Reachability for Data-Dependence and Alias Analysis. IST Austria, 2017, doi:10.15479/AT:IST-2017-870-v1-1.
View | Files available | DOI
 

2017 | Technical Report | IST-REx-ID: 5456 | OA
Chalupa, Marek, et al. Data-Centric Dynamic Partial Order Reduction. IST Austria, 2017, doi:10.15479/AT:IST-2017-872-v1-1.
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 551 | OA
Chatterjee, Krishnendu, et al. “Faster Monte Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs.” Leibniz International Proceedings in Informatics, vol. 83, 61, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.61.
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 552 | OA
Chatterjee, Krishnendu, et al. “Faster Algorithms for Mean Payoff Parity Games.” Leibniz International Proceedings in Informatics, vol. 83, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.39.
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 553 | OA
Chatterjee, Krishnendu, et al. “Strategy Complexity of Concurrent Safety Games.” Leibniz International Proceedings in Informatics, vol. 83, 55, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.55.
View | Files available | DOI | Download Published Version (ext.)
 

2017 | Research Data | IST-REx-ID: 5559 | OA
Pavlogiannis, Andreas, et al. Strong Amplifiers of Natural Selection. IST Austria, 2017, doi:10.15479/AT:ISTA:51.
View | Files available | DOI
 

2017 | Book Chapter | IST-REx-ID: 625 | OA
Chatterjee, Krishnendu, et al. “The Cost of Exactness in Quantitative Reachability.” Models, Algorithms, Logics and Tools, edited by Luca Aceto et al., vol. 10460, Springer, 2017, pp. 367–81, doi:10.1007/978-3-319-63121-9_18.
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 628 | OA
Chatterjee, Krishnendu, et al. Automated Recurrence Analysis for Almost Linear Expected Runtime Bounds. Edited by Rupak Majumdar and Viktor Kunčak, vol. 10426, Springer, 2017, pp. 118–39, doi:10.1007/978-3-319-63387-9_6.
View | DOI | Download Submitted Version (ext.)
 

2017 | Conference Paper | IST-REx-ID: 645 | OA
Ashok, Pranav, et al. Value Iteration for Long Run Average Reward in Markov Decision Processes. Edited by Rupak Majumdar and Viktor Kunčak, vol. 10426, Springer, 2017, pp. 201–21, doi:10.1007/978-3-319-63387-9_10.
View | DOI | Download Submitted Version (ext.)
 

Filters and Search Terms

department=KrCh

Search

Filter Publications