44 Publications

Mark all

[44]
2022 | Published | Conference Paper | IST-REx-ID: 12101 | OA
Chatterjee, Krishnendu, Complexity of spatial games. 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science 250. 2022
[Published Version] View | Files available | DOI
 
[43]
2021 | Published | Conference Paper | IST-REx-ID: 10629 | OA
Chatterjee, Krishnendu, et al. “Quantitative Verification on Product Graphs of Small Treewidth.” 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 213, 42, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.FSTTCS.2021.42.
[Published Version] View | Files available | DOI
 
[42]
2021 | Published | Journal Article | IST-REx-ID: 9393 | OA
Chatterjee, Krishnendu, et al. “Faster Algorithms for Quantitative Verification in Bounded Treewidth Graphs.” Formal Methods in System Design, vol. 57, Springer, 2021, pp. 401–28, doi:10.1007/s10703-021-00373-5.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[41]
2020 | Published | Conference Paper | IST-REx-ID: 8533 | OA
Chatterjee, Krishnendu, Simplified game of life: Algorithms and complexity. 45th International Symposium on Mathematical Foundations of Computer Science 170. 2020
[Published Version] View | Files available | DOI | arXiv
 
[40]
2020 | Published | Journal Article | IST-REx-ID: 9197
Avni, Guy, et al. “All-Pay Bidding Games on Graphs.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 02, Association for the Advancement of Artificial Intelligence, 2020, pp. 1798–805, doi:10.1609/aaai.v34i02.5546.
[Preprint] View | DOI | arXiv
 
[39]
2020 | Research Data Reference | IST-REx-ID: 9814 | OA
Ibsen-Jensen, Rasmus, et al. Data and Mathematica Notebooks for Plotting Figures from Language Learning with Communication between Learners from Language Acquisition with Communication between Learners. Royal Society, 2020, doi:10.6084/m9.figshare.5973013.v1.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[38]
2020 | Published | Conference Paper | IST-REx-ID: 7810 | OA
Chatterjee, Krishnendu, et al. “Optimal and Perfectly Parallel Algorithms for On-Demand Data-Flow Analysis.” European Symposium on Programming, vol. 12075, Springer Nature, 2020, pp. 112–40, doi:10.1007/978-3-030-44914-8_5.
[Published Version] View | Files available | DOI | WoS
 
[37]
2019 | Published | Conference Paper | IST-REx-ID: 6822 | OA
Avni, Guy, et al. “Bidding Games on Markov Decision Processes.” Proceedings of the 13th International Conference of Reachability Problems, vol. 11674, Springer, 2019, pp. 1–12, doi:10.1007/978-3-030-30806-3_1.
[Submitted Version] View | Files available | DOI
 
[36]
2019 | Published | Journal Article | IST-REx-ID: 7158 | OA
Chatterjee, Krishnendu, et al. “Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4, 23, ACM, 2019, doi:10.1145/3363525.
[Submitted Version] View | Files available | DOI | WoS
 
[35]
2018 | Conference Paper | IST-REx-ID: 5788 | OA
Avni, Guy, et al. Infinite-Duration Poorman-Bidding Games. Vol. 11316, Springer, 2018, pp. 21–36, doi:10.1007/978-3-030-04612-5_2.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[34]
2018 | Published | Journal Article | IST-REx-ID: 198 | OA
Ibsen-Jensen, Rasmus, et al. “Language Acquisition with Communication between Learners.” Journal of the Royal Society Interface, vol. 15, no. 140, 20180073, The Royal Society, 2018, doi:10.1098/rsif.2018.0073.
[Submitted Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[33]
2018 | Published | Conference Paper | IST-REx-ID: 5967 | OA
Hansen, Kristoffer Arnsfelt, et al. “The Big Match with a Clock and a Bit of Memory.” Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18, ACM, 2018, pp. 149–50, doi:10.1145/3219166.3219198.
[Submitted Version] View | Files available | DOI | WoS
 
[32]
2018 | Published | Conference Paper | IST-REx-ID: 66 | OA
Chatterjee, Krishnendu, et al. Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies. Vol. 118, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.CONCUR.2018.11.
[Published Version] View | Files available | DOI | arXiv
 
[31]
2018 | Published | Journal Article | IST-REx-ID: 6009 | OA
Chatterjee, Krishnendu, et al. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.” ACM Transactions on Programming Languages and Systems, vol. 40, no. 3, 9, Association for Computing Machinery, 2018, doi:10.1145/3210257.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[30]
2017 | Published | Conference Paper | IST-REx-ID: 551 | OA
Chatterjee, Krishnendu, Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. Leibniz International Proceedings in Informatics 83. 2017
[Published Version] View | Files available | DOI
 
[29]
2017 | Published | Journal Article | IST-REx-ID: 465 | OA
Chatterjee, Krishnendu, Edit distance for pushdown automata. Logical Methods in Computer Science 13 (3). 2017
[Published Version] View | Files available | DOI
 
[28]
2017 | Published | 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.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 
[27]
2016 | Published | Conference Paper | IST-REx-ID: 478 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Complexity of Deciding Legality of a Single Step of Magic: The Gathering. Vol. 285, IOS Press, 2016, pp. 1432–39, doi:10.3233/978-1-61499-672-9-1432.
[Published Version] View | Files available | DOI
 
[26]
2016 | Published | Conference Paper | IST-REx-ID: 1182 | OA
Chatterjee, Krishnendu, et al. Robust Draws in Balanced Knockout Tournaments. Vol. 2016–January, AAAI Press, 2016, pp. 172–79.
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 
[25]
2016 | Published | Conference Paper | IST-REx-ID: 1071 | OA
Chatterjee, Krishnendu, et al. Optimal Reachability and a Space Time Tradeoff for Distance Queries in Constant Treewidth Graphs. Vol. 57, 28, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPIcs.ESA.2016.28.
[Published Version] View | Files available | DOI
 
[24]
2016 | Published | Conference Paper | IST-REx-ID: 1340 | OA
Hansen, Kristoffer, et al. The Big Match in Small Space. Vol. 9928, Springer, 2016, pp. 64–76, doi:10.1007/978-3-662-53354-3_6.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[23]
2016 | Published | Conference Paper | IST-REx-ID: 1437 | OA
Chatterjee, Krishnendu, et al. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. Vol. 20–22, ACM, 2016, pp. 733–47, doi:10.1145/2837614.2837624.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[22]
2015 | Published | Journal Article | IST-REx-ID: 524 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “Qualitative Analysis of Concurrent Mean Payoff Games.” Information and Computation, vol. 242, no. 6, Elsevier, 2015, pp. 2–24, doi:10.1016/j.ic.2015.03.009.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[21]
2015 | Published | Technical Report | IST-REx-ID: 5431 | OA
Chatterjee, Krishnendu, et al. The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives. IST Austria, 2015, doi:10.15479/AT:IST-2015-322-v1-1.
[Published Version] View | Files available | DOI
 
[20]
2015 | Published | Technical Report | IST-REx-ID: 5432 | OA
Chatterjee, Krishnendu, et al. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015, doi:10.15479/AT:IST-2015-323-v1-1.
[Published Version] View | Files available | DOI
 
[19]
2015 | Published | Technical Report | IST-REx-ID: 5440 | OA
Chatterjee, Krishnendu, et al. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015, doi:10.15479/AT:IST-2015-323-v2-2.
[Published Version] View | Files available | DOI
 
[18]
2015 | Published | Journal Article | IST-REx-ID: 1559 | OA
Ibsen-Jensen, Rasmus, et al. “Computational Complexity of Ecological and Evolutionary Spatial Dynamics.” PNAS, vol. 112, no. 51, National Academy of Sciences, 2015, pp. 15636–41, doi:10.1073/pnas.1511366112.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | PubMed | Europe PMC
 
[17]
2015 | Published | Journal Article | IST-REx-ID: 1602 | OA
Chatterjee, Krishnendu, et al. “Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth.” ACM SIGPLAN Notices, vol. 50, no. 1, ACM, 2015, pp. 97–109, doi:10.1145/2676726.2676979.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[16]
2015 | Published | Technical Report | IST-REx-ID: 5441 | OA
Chatterjee, Krishnendu, et al. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. IST Austria, 2015, doi:10.15479/AT:IST-2015-340-v1-1.
[Published Version] View | Files available | DOI
 
[15]
2015 | Published | Conference Paper | IST-REx-ID: 1610 | OA
Chatterjee, Krishnendu, Edit distance for pushdown automata. 42nd International Colloquium 9135 (Part II). 2015
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[14]
2015 | Published | Technical Report | IST-REx-ID: 5438 | OA
Chatterjee, Krishnendu, et al. Edit Distance for Pushdown Automata. IST Austria, 2015, doi:10.15479/AT:IST-2015-334-v1-1.
[Published Version] View | Files available | DOI
 
[13]
2015 | Published | Conference Paper | IST-REx-ID: 1607 | OA
Chatterjee, Krishnendu, et al. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. Vol. 9206, Springer, 2015, pp. 140–57, doi:10.1007/978-3-319-21690-4_9.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[12]
2015 | Published | Technical Report | IST-REx-ID: 5437 | OA
Chatterjee, Krishnendu, et al. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015, doi:10.15479/AT:IST-2015-330-v2-1.
[Published Version] View | Files available | DOI
 
[11]
2015 | Published | Technical Report | IST-REx-ID: 5430 | OA
Chatterjee, Krishnendu, et al. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015, doi:10.15479/AT:IST-2015-319-v1-1.
[Published Version] View | Files available | DOI
 
[10]
2015 | Published | Conference Paper | IST-REx-ID: 10796 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Value 1 Problem under Finite-Memory Strategies for Concurrent Mean-Payoff Games.” Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 2015, no. 1, SIAM, 2015, pp. 1018–29, doi:10.1137/1.9781611973730.69.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[9]
2014 | Published | Technical Report | IST-REx-ID: 5419 | OA
Chatterjee, Krishnendu, et al. Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs. IST Austria, 2014, doi:10.15479/AT:IST-2014-187-v1-1.
[Published Version] View | Files available | DOI
 
[8]
2014 | Published | Technical Report | IST-REx-ID: 5420 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Value 1 Problem for Concurrent Mean-Payoff Games. IST Austria, 2014, doi:10.15479/AT:IST-2014-191-v1-1.
[Published Version] View | Files available | DOI
 
[7]
2014 | Published | Technical Report | IST-REx-ID: 5421 | OA
Chatterjee, Krishnendu, et al. The Complexity of Evolution on Graphs. IST Austria, 2014, doi:10.15479/AT:IST-2014-190-v2-2.
[Published Version] View | Files available | DOI
 
[6]
2014 | Published | Technical Report | IST-REx-ID: 5427 | OA
Chatterjee, Krishnendu, et al. Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs. IST Austria, 2014, doi:10.15479/AT:IST-2014-314-v1-1.
[Published Version] View | Files available | DOI
 
[5]
2014 | Published | Conference Paper | IST-REx-ID: 2216 | OA
Chatterjee, Krishnendu, et al. Edit Distance for Timed Automata. Springer, 2014, pp. 303–12, doi:10.1145/2562059.2562141.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[4]
2014 | Published | Conference Paper | IST-REx-ID: 2162 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Complexity of Ergodic Mean Payoff Games. Vol. 8573, no. Part 2, Springer, 2014, pp. 122–33, doi:10.1007/978-3-662-43951-7_11.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[3]
2013 | Published | Technical Report | IST-REx-ID: 5403 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. Qualitative Analysis of Concurrent Mean-Payoff Games. IST Austria, 2013, doi:10.15479/AT:IST-2013-126-v1-1.
[Published Version] View | Files available | DOI
 
[2]
2013 | Published | Technical Report | IST-REx-ID: 5409 | OA
Chatterjee, Krishnendu, et al. Edit Distance for Timed Automata. IST Austria, 2013, doi:10.15479/AT:IST-2013-144-v1-1.
[Published Version] View | Files available | DOI
 
[1]
2013 | Published | Technical Report | IST-REx-ID: 5404 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Complexity of Ergodic Games. IST Austria, 2013, doi:10.15479/AT:IST-2013-127-v1-1.
[Published Version] View | Files available | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed

Grants


44 Publications

Mark all

[44]
2022 | Published | Conference Paper | IST-REx-ID: 12101 | OA
Chatterjee, Krishnendu, Complexity of spatial games. 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science 250. 2022
[Published Version] View | Files available | DOI
 
[43]
2021 | Published | Conference Paper | IST-REx-ID: 10629 | OA
Chatterjee, Krishnendu, et al. “Quantitative Verification on Product Graphs of Small Treewidth.” 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 213, 42, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.FSTTCS.2021.42.
[Published Version] View | Files available | DOI
 
[42]
2021 | Published | Journal Article | IST-REx-ID: 9393 | OA
Chatterjee, Krishnendu, et al. “Faster Algorithms for Quantitative Verification in Bounded Treewidth Graphs.” Formal Methods in System Design, vol. 57, Springer, 2021, pp. 401–28, doi:10.1007/s10703-021-00373-5.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[41]
2020 | Published | Conference Paper | IST-REx-ID: 8533 | OA
Chatterjee, Krishnendu, Simplified game of life: Algorithms and complexity. 45th International Symposium on Mathematical Foundations of Computer Science 170. 2020
[Published Version] View | Files available | DOI | arXiv
 
[40]
2020 | Published | Journal Article | IST-REx-ID: 9197
Avni, Guy, et al. “All-Pay Bidding Games on Graphs.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 02, Association for the Advancement of Artificial Intelligence, 2020, pp. 1798–805, doi:10.1609/aaai.v34i02.5546.
[Preprint] View | DOI | arXiv
 
[39]
2020 | Research Data Reference | IST-REx-ID: 9814 | OA
Ibsen-Jensen, Rasmus, et al. Data and Mathematica Notebooks for Plotting Figures from Language Learning with Communication between Learners from Language Acquisition with Communication between Learners. Royal Society, 2020, doi:10.6084/m9.figshare.5973013.v1.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[38]
2020 | Published | Conference Paper | IST-REx-ID: 7810 | OA
Chatterjee, Krishnendu, et al. “Optimal and Perfectly Parallel Algorithms for On-Demand Data-Flow Analysis.” European Symposium on Programming, vol. 12075, Springer Nature, 2020, pp. 112–40, doi:10.1007/978-3-030-44914-8_5.
[Published Version] View | Files available | DOI | WoS
 
[37]
2019 | Published | Conference Paper | IST-REx-ID: 6822 | OA
Avni, Guy, et al. “Bidding Games on Markov Decision Processes.” Proceedings of the 13th International Conference of Reachability Problems, vol. 11674, Springer, 2019, pp. 1–12, doi:10.1007/978-3-030-30806-3_1.
[Submitted Version] View | Files available | DOI
 
[36]
2019 | Published | Journal Article | IST-REx-ID: 7158 | OA
Chatterjee, Krishnendu, et al. “Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4, 23, ACM, 2019, doi:10.1145/3363525.
[Submitted Version] View | Files available | DOI | WoS
 
[35]
2018 | Conference Paper | IST-REx-ID: 5788 | OA
Avni, Guy, et al. Infinite-Duration Poorman-Bidding Games. Vol. 11316, Springer, 2018, pp. 21–36, doi:10.1007/978-3-030-04612-5_2.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[34]
2018 | Published | Journal Article | IST-REx-ID: 198 | OA
Ibsen-Jensen, Rasmus, et al. “Language Acquisition with Communication between Learners.” Journal of the Royal Society Interface, vol. 15, no. 140, 20180073, The Royal Society, 2018, doi:10.1098/rsif.2018.0073.
[Submitted Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[33]
2018 | Published | Conference Paper | IST-REx-ID: 5967 | OA
Hansen, Kristoffer Arnsfelt, et al. “The Big Match with a Clock and a Bit of Memory.” Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18, ACM, 2018, pp. 149–50, doi:10.1145/3219166.3219198.
[Submitted Version] View | Files available | DOI | WoS
 
[32]
2018 | Published | Conference Paper | IST-REx-ID: 66 | OA
Chatterjee, Krishnendu, et al. Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies. Vol. 118, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.CONCUR.2018.11.
[Published Version] View | Files available | DOI | arXiv
 
[31]
2018 | Published | Journal Article | IST-REx-ID: 6009 | OA
Chatterjee, Krishnendu, et al. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.” ACM Transactions on Programming Languages and Systems, vol. 40, no. 3, 9, Association for Computing Machinery, 2018, doi:10.1145/3210257.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[30]
2017 | Published | Conference Paper | IST-REx-ID: 551 | OA
Chatterjee, Krishnendu, Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. Leibniz International Proceedings in Informatics 83. 2017
[Published Version] View | Files available | DOI
 
[29]
2017 | Published | Journal Article | IST-REx-ID: 465 | OA
Chatterjee, Krishnendu, Edit distance for pushdown automata. Logical Methods in Computer Science 13 (3). 2017
[Published Version] View | Files available | DOI
 
[28]
2017 | Published | 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.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 
[27]
2016 | Published | Conference Paper | IST-REx-ID: 478 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Complexity of Deciding Legality of a Single Step of Magic: The Gathering. Vol. 285, IOS Press, 2016, pp. 1432–39, doi:10.3233/978-1-61499-672-9-1432.
[Published Version] View | Files available | DOI
 
[26]
2016 | Published | Conference Paper | IST-REx-ID: 1182 | OA
Chatterjee, Krishnendu, et al. Robust Draws in Balanced Knockout Tournaments. Vol. 2016–January, AAAI Press, 2016, pp. 172–79.
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 
[25]
2016 | Published | Conference Paper | IST-REx-ID: 1071 | OA
Chatterjee, Krishnendu, et al. Optimal Reachability and a Space Time Tradeoff for Distance Queries in Constant Treewidth Graphs. Vol. 57, 28, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPIcs.ESA.2016.28.
[Published Version] View | Files available | DOI
 
[24]
2016 | Published | Conference Paper | IST-REx-ID: 1340 | OA
Hansen, Kristoffer, et al. The Big Match in Small Space. Vol. 9928, Springer, 2016, pp. 64–76, doi:10.1007/978-3-662-53354-3_6.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[23]
2016 | Published | Conference Paper | IST-REx-ID: 1437 | OA
Chatterjee, Krishnendu, et al. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. Vol. 20–22, ACM, 2016, pp. 733–47, doi:10.1145/2837614.2837624.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[22]
2015 | Published | Journal Article | IST-REx-ID: 524 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “Qualitative Analysis of Concurrent Mean Payoff Games.” Information and Computation, vol. 242, no. 6, Elsevier, 2015, pp. 2–24, doi:10.1016/j.ic.2015.03.009.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[21]
2015 | Published | Technical Report | IST-REx-ID: 5431 | OA
Chatterjee, Krishnendu, et al. The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives. IST Austria, 2015, doi:10.15479/AT:IST-2015-322-v1-1.
[Published Version] View | Files available | DOI
 
[20]
2015 | Published | Technical Report | IST-REx-ID: 5432 | OA
Chatterjee, Krishnendu, et al. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015, doi:10.15479/AT:IST-2015-323-v1-1.
[Published Version] View | Files available | DOI
 
[19]
2015 | Published | Technical Report | IST-REx-ID: 5440 | OA
Chatterjee, Krishnendu, et al. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015, doi:10.15479/AT:IST-2015-323-v2-2.
[Published Version] View | Files available | DOI
 
[18]
2015 | Published | Journal Article | IST-REx-ID: 1559 | OA
Ibsen-Jensen, Rasmus, et al. “Computational Complexity of Ecological and Evolutionary Spatial Dynamics.” PNAS, vol. 112, no. 51, National Academy of Sciences, 2015, pp. 15636–41, doi:10.1073/pnas.1511366112.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | PubMed | Europe PMC
 
[17]
2015 | Published | Journal Article | IST-REx-ID: 1602 | OA
Chatterjee, Krishnendu, et al. “Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth.” ACM SIGPLAN Notices, vol. 50, no. 1, ACM, 2015, pp. 97–109, doi:10.1145/2676726.2676979.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[16]
2015 | Published | Technical Report | IST-REx-ID: 5441 | OA
Chatterjee, Krishnendu, et al. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. IST Austria, 2015, doi:10.15479/AT:IST-2015-340-v1-1.
[Published Version] View | Files available | DOI
 
[15]
2015 | Published | Conference Paper | IST-REx-ID: 1610 | OA
Chatterjee, Krishnendu, Edit distance for pushdown automata. 42nd International Colloquium 9135 (Part II). 2015
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[14]
2015 | Published | Technical Report | IST-REx-ID: 5438 | OA
Chatterjee, Krishnendu, et al. Edit Distance for Pushdown Automata. IST Austria, 2015, doi:10.15479/AT:IST-2015-334-v1-1.
[Published Version] View | Files available | DOI
 
[13]
2015 | Published | Conference Paper | IST-REx-ID: 1607 | OA
Chatterjee, Krishnendu, et al. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. Vol. 9206, Springer, 2015, pp. 140–57, doi:10.1007/978-3-319-21690-4_9.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[12]
2015 | Published | Technical Report | IST-REx-ID: 5437 | OA
Chatterjee, Krishnendu, et al. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015, doi:10.15479/AT:IST-2015-330-v2-1.
[Published Version] View | Files available | DOI
 
[11]
2015 | Published | Technical Report | IST-REx-ID: 5430 | OA
Chatterjee, Krishnendu, et al. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015, doi:10.15479/AT:IST-2015-319-v1-1.
[Published Version] View | Files available | DOI
 
[10]
2015 | Published | Conference Paper | IST-REx-ID: 10796 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Value 1 Problem under Finite-Memory Strategies for Concurrent Mean-Payoff Games.” Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 2015, no. 1, SIAM, 2015, pp. 1018–29, doi:10.1137/1.9781611973730.69.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[9]
2014 | Published | Technical Report | IST-REx-ID: 5419 | OA
Chatterjee, Krishnendu, et al. Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs. IST Austria, 2014, doi:10.15479/AT:IST-2014-187-v1-1.
[Published Version] View | Files available | DOI
 
[8]
2014 | Published | Technical Report | IST-REx-ID: 5420 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Value 1 Problem for Concurrent Mean-Payoff Games. IST Austria, 2014, doi:10.15479/AT:IST-2014-191-v1-1.
[Published Version] View | Files available | DOI
 
[7]
2014 | Published | Technical Report | IST-REx-ID: 5421 | OA
Chatterjee, Krishnendu, et al. The Complexity of Evolution on Graphs. IST Austria, 2014, doi:10.15479/AT:IST-2014-190-v2-2.
[Published Version] View | Files available | DOI
 
[6]
2014 | Published | Technical Report | IST-REx-ID: 5427 | OA
Chatterjee, Krishnendu, et al. Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs. IST Austria, 2014, doi:10.15479/AT:IST-2014-314-v1-1.
[Published Version] View | Files available | DOI
 
[5]
2014 | Published | Conference Paper | IST-REx-ID: 2216 | OA
Chatterjee, Krishnendu, et al. Edit Distance for Timed Automata. Springer, 2014, pp. 303–12, doi:10.1145/2562059.2562141.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[4]
2014 | Published | Conference Paper | IST-REx-ID: 2162 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Complexity of Ergodic Mean Payoff Games. Vol. 8573, no. Part 2, Springer, 2014, pp. 122–33, doi:10.1007/978-3-662-43951-7_11.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[3]
2013 | Published | Technical Report | IST-REx-ID: 5403 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. Qualitative Analysis of Concurrent Mean-Payoff Games. IST Austria, 2013, doi:10.15479/AT:IST-2013-126-v1-1.
[Published Version] View | Files available | DOI
 
[2]
2013 | Published | Technical Report | IST-REx-ID: 5409 | OA
Chatterjee, Krishnendu, et al. Edit Distance for Timed Automata. IST Austria, 2013, doi:10.15479/AT:IST-2013-144-v1-1.
[Published Version] View | Files available | DOI
 
[1]
2013 | Published | Technical Report | IST-REx-ID: 5404 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Complexity of Ergodic Games. IST Austria, 2013, doi:10.15479/AT:IST-2013-127-v1-1.
[Published Version] View | Files available | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed