35 Publications

Mark all

[35]
2019 | Conference Paper | IST-REx-ID: 6822   OA
Avni, Guy, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Petr Novotny. “Bidding Games on Markov Decision Processes.” In Proceedings of the 13th International Conference of Reachability Problems. Springer, n.d.
View | Files available
 
[34]
2018 | Journal Article | IST-REx-ID: 198   OA
Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Language Acquisition with Communication between Learners.” Journal of the Royal Society Interface 15, no. 140 (2018). https://doi.org/10.1098/rsif.2018.0073.
View | Files available | DOI
 
[33]
2018 | Conference Paper | IST-REx-ID: 5788   OA
Avni, Guy, Thomas A Henzinger, and Rasmus Ibsen-Jensen. “Infinite-Duration Poorman-Bidding Games,” 11316:21–36. Springer, 2018. https://doi.org/10.1007/978-3-030-04612-5_2.
View | DOI | Download (ext.) | arXiv
 
[32]
2018 | Conference Paper | IST-REx-ID: 66   OA
Chatterjee, Krishnendu, Amir Goharshady, Rasmus Ibsen-Jensen, and Yaron Velner. “Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies.,” 118:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.CONCUR.2018.11.
View | Files available | DOI | Download (ext.) | arXiv
 
[31]
2018 | Conference Paper | IST-REx-ID: 5967
Hansen, Kristoffer Arnsfelt, Rasmus Ibsen-Jensen, and Abraham Neyman. “The Big Match with a Clock and a Bit of Memory.” In Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18, 149–50. ACM Press, 2018. https://doi.org/10.1145/3219166.3219198.
View | DOI
 
[30]
2018 | Journal Article | IST-REx-ID: 6009   OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.” ACM Transactions on Programming Languages and Systems 40, no. 3 (2018): 9. https://doi.org/10.1145/3210257.
View | Files available | DOI | Download (ext.) | arXiv
 
[29]
2017 | Journal Article | IST-REx-ID: 465
Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” Logical Methods in Computer Science 13, no. 3 (2017). https://doi.org/10.23638/LMCS-13(3:23)2017.
View | Files available | DOI
 
[28]
2017 | Conference Paper | IST-REx-ID: 551   OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. “Faster Monte Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.61.
View | Files available | DOI
 
[27]
2017 | Conference Paper | IST-REx-ID: 553   OA
Chatterjee, Krishnendu, Kristofer Hansen, and Rasmus Ibsen-Jensen. “Strategy Complexity of Concurrent Safety Games.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.55.
View | Files available | DOI | Download (ext.)
 
[26]
2016 | Conference Paper | IST-REx-ID: 1340   OA
Hansen, Kristoffer, Rasmus Ibsen-Jensen, and Michal Koucký. “The Big Match in Small Space,” 9928:64–76. Springer, 2016. https://doi.org/10.1007/978-3-662-53354-3_6.
View | DOI | Download (ext.)
 
[25]
2016 | 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,” 285:1432–39. IOS Press, 2016. https://doi.org/10.3233/978-1-61499-672-9-1432.
View | Files available | DOI
 
[24]
2016 | Conference Paper | IST-REx-ID: 1182   OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Josef Tkadlec. “Robust Draws in Balanced Knockout Tournaments,” 2016–January:172–79. AAAI Press, 2016.
View | Files available | Download (ext.)
 
[23]
2016 | Conference Paper | IST-REx-ID: 1071
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Optimal Reachability and a Space Time Tradeoff for Distance Queries in Constant Treewidth Graphs,” Vol. 57. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016. https://doi.org/10.4230/LIPIcs.ESA.2016.28.
View | Files available | DOI
 
[22]
2016 | Conference Paper | IST-REx-ID: 1437
Chatterjee, Krishnendu, Amir Goharshady, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components,” 20–22:733–47. ACM, 2016. https://doi.org/10.1145/2837614.2837624.
View | Files available | DOI | Download (ext.) | arXiv
 
[21]
2015 | Technical Report | IST-REx-ID: 5430
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-319-v1-1.
View | Files available | DOI
 
[20]
2015 | Journal Article | IST-REx-ID: 1559   OA
Ibsen-Jensen, Rasmus, Krishnendu Chatterjee, and Martin Nowak. “Computational Complexity of Ecological and Evolutionary Spatial Dynamics.” PNAS 112, no. 51 (2015): 15636–41. https://doi.org/10.1073/pnas.1511366112.
View | DOI | Download (ext.) | PubMed | Europe PMC
 
[19]
2015 | Journal Article | IST-REx-ID: 524
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “Qualitative Analysis of Concurrent Mean Payoff Games.” Information and Computation 242, no. 6 (2015): 2–24. https://doi.org/10.1016/j.ic.2015.03.009.
View | Files available | DOI | Download (ext.) | arXiv
 
[18]
2015 | Technical Report | IST-REx-ID: 5431   OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Kristoffer Hansen. The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-322-v1-1.
View | Files available | DOI
 
[17]
2015 | Technical Report | IST-REx-ID: 5437   OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-330-v2-1.
View | Files available | DOI
 
[16]
2015 | Technical Report | IST-REx-ID: 5432
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-323-v1-1.
View | Files available | DOI
 
[15]
2015 | Technical Report | IST-REx-ID: 5438   OA
Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. Edit Distance for Pushdown Automata. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-334-v1-1.
View | Files available | DOI
 
[14]
2015 | Journal Article | IST-REx-ID: 1602
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, and Prateesh Goyal. “Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth.” ACM SIGPLAN Notices 50, no. 1 (2015): 97–109. https://doi.org/10.1145/2676726.2676979.
View | Files available | DOI | Download (ext.) | arXiv
 
[13]
2015 | Conference Paper | IST-REx-ID: 1607
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs,” 9206:140–57. Springer, 2015. https://doi.org/10.1007/978-3-319-21690-4_9.
View | Files available | DOI | Download (ext.)
 
[12]
2015 | Technical Report | IST-REx-ID: 5440
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-323-v2-2.
View | Files available | DOI
 
[11]
2015 | Conference Paper | IST-REx-ID: 1610
Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-662-47666-6_10.
View | Files available | DOI
 
[10]
2015 | Technical Report | IST-REx-ID: 5441
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Goharshady, and Andreas Pavlogiannis. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-340-v1-1.
View | Files available | DOI
 
[9]
2014 | Conference Paper | IST-REx-ID: 2216
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Ritankar Majumdar. “Edit Distance for Timed Automata,” 303–12. Springer, 2014. https://doi.org/10.1145/2562059.2562141.
View | Files available | DOI | Download (ext.)
 
[8]
2014 | 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. https://doi.org/10.15479/AT:IST-2014-191-v1-1.
View | Files available | DOI
 
[7]
2014 | Conference Paper | IST-REx-ID: 2162
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Complexity of Ergodic Mean Payoff Games,” 8573:122–33. Springer, 2014. https://doi.org/10.1007/978-3-662-43951-7_11.
View | Files available | DOI | Download (ext.) | arXiv
 
[6]
2014 | Technical Report | IST-REx-ID: 5419   OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-187-v1-1.
View | Files available | DOI
 
[5]
2014 | Technical Report | IST-REx-ID: 5421   OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity of Evolution on Graphs. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-190-v2-2.
View | Files available | DOI
 
[4]
2014 | Technical Report | IST-REx-ID: 5427   OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-314-v1-1.
View | Files available | DOI
 
[3]
2013 | Technical Report | IST-REx-ID: 5404   OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Complexity of Ergodic Games. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-127-v1-1.
View | Files available | DOI
 
[2]
2013 | Technical Report | IST-REx-ID: 5409   OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Rupak Majumdar. Edit Distance for Timed Automata. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-144-v1-1.
View | Files available | DOI
 
[1]
2013 | Technical Report | IST-REx-ID: 5403   OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. Qualitative Analysis of Concurrent Mean-Payoff Games. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-126-v1-1.
View | Files available | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed

35 Publications

Mark all

[35]
2019 | Conference Paper | IST-REx-ID: 6822   OA
Avni, Guy, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Petr Novotny. “Bidding Games on Markov Decision Processes.” In Proceedings of the 13th International Conference of Reachability Problems. Springer, n.d.
View | Files available
 
[34]
2018 | Journal Article | IST-REx-ID: 198   OA
Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Language Acquisition with Communication between Learners.” Journal of the Royal Society Interface 15, no. 140 (2018). https://doi.org/10.1098/rsif.2018.0073.
View | Files available | DOI
 
[33]
2018 | Conference Paper | IST-REx-ID: 5788   OA
Avni, Guy, Thomas A Henzinger, and Rasmus Ibsen-Jensen. “Infinite-Duration Poorman-Bidding Games,” 11316:21–36. Springer, 2018. https://doi.org/10.1007/978-3-030-04612-5_2.
View | DOI | Download (ext.) | arXiv
 
[32]
2018 | Conference Paper | IST-REx-ID: 66   OA
Chatterjee, Krishnendu, Amir Goharshady, Rasmus Ibsen-Jensen, and Yaron Velner. “Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies.,” 118:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.CONCUR.2018.11.
View | Files available | DOI | Download (ext.) | arXiv
 
[31]
2018 | Conference Paper | IST-REx-ID: 5967
Hansen, Kristoffer Arnsfelt, Rasmus Ibsen-Jensen, and Abraham Neyman. “The Big Match with a Clock and a Bit of Memory.” In Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18, 149–50. ACM Press, 2018. https://doi.org/10.1145/3219166.3219198.
View | DOI
 
[30]
2018 | Journal Article | IST-REx-ID: 6009   OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.” ACM Transactions on Programming Languages and Systems 40, no. 3 (2018): 9. https://doi.org/10.1145/3210257.
View | Files available | DOI | Download (ext.) | arXiv
 
[29]
2017 | Journal Article | IST-REx-ID: 465
Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” Logical Methods in Computer Science 13, no. 3 (2017). https://doi.org/10.23638/LMCS-13(3:23)2017.
View | Files available | DOI
 
[28]
2017 | Conference Paper | IST-REx-ID: 551   OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. “Faster Monte Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.61.
View | Files available | DOI
 
[27]
2017 | Conference Paper | IST-REx-ID: 553   OA
Chatterjee, Krishnendu, Kristofer Hansen, and Rasmus Ibsen-Jensen. “Strategy Complexity of Concurrent Safety Games.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.55.
View | Files available | DOI | Download (ext.)
 
[26]
2016 | Conference Paper | IST-REx-ID: 1340   OA
Hansen, Kristoffer, Rasmus Ibsen-Jensen, and Michal Koucký. “The Big Match in Small Space,” 9928:64–76. Springer, 2016. https://doi.org/10.1007/978-3-662-53354-3_6.
View | DOI | Download (ext.)
 
[25]
2016 | 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,” 285:1432–39. IOS Press, 2016. https://doi.org/10.3233/978-1-61499-672-9-1432.
View | Files available | DOI
 
[24]
2016 | Conference Paper | IST-REx-ID: 1182   OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Josef Tkadlec. “Robust Draws in Balanced Knockout Tournaments,” 2016–January:172–79. AAAI Press, 2016.
View | Files available | Download (ext.)
 
[23]
2016 | Conference Paper | IST-REx-ID: 1071
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Optimal Reachability and a Space Time Tradeoff for Distance Queries in Constant Treewidth Graphs,” Vol. 57. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016. https://doi.org/10.4230/LIPIcs.ESA.2016.28.
View | Files available | DOI
 
[22]
2016 | Conference Paper | IST-REx-ID: 1437
Chatterjee, Krishnendu, Amir Goharshady, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components,” 20–22:733–47. ACM, 2016. https://doi.org/10.1145/2837614.2837624.
View | Files available | DOI | Download (ext.) | arXiv
 
[21]
2015 | Technical Report | IST-REx-ID: 5430
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-319-v1-1.
View | Files available | DOI
 
[20]
2015 | Journal Article | IST-REx-ID: 1559   OA
Ibsen-Jensen, Rasmus, Krishnendu Chatterjee, and Martin Nowak. “Computational Complexity of Ecological and Evolutionary Spatial Dynamics.” PNAS 112, no. 51 (2015): 15636–41. https://doi.org/10.1073/pnas.1511366112.
View | DOI | Download (ext.) | PubMed | Europe PMC
 
[19]
2015 | Journal Article | IST-REx-ID: 524
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “Qualitative Analysis of Concurrent Mean Payoff Games.” Information and Computation 242, no. 6 (2015): 2–24. https://doi.org/10.1016/j.ic.2015.03.009.
View | Files available | DOI | Download (ext.) | arXiv
 
[18]
2015 | Technical Report | IST-REx-ID: 5431   OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Kristoffer Hansen. The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-322-v1-1.
View | Files available | DOI
 
[17]
2015 | Technical Report | IST-REx-ID: 5437   OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-330-v2-1.
View | Files available | DOI
 
[16]
2015 | Technical Report | IST-REx-ID: 5432
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-323-v1-1.
View | Files available | DOI
 
[15]
2015 | Technical Report | IST-REx-ID: 5438   OA
Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. Edit Distance for Pushdown Automata. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-334-v1-1.
View | Files available | DOI
 
[14]
2015 | Journal Article | IST-REx-ID: 1602
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, and Prateesh Goyal. “Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth.” ACM SIGPLAN Notices 50, no. 1 (2015): 97–109. https://doi.org/10.1145/2676726.2676979.
View | Files available | DOI | Download (ext.) | arXiv
 
[13]
2015 | Conference Paper | IST-REx-ID: 1607
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs,” 9206:140–57. Springer, 2015. https://doi.org/10.1007/978-3-319-21690-4_9.
View | Files available | DOI | Download (ext.)
 
[12]
2015 | Technical Report | IST-REx-ID: 5440
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-323-v2-2.
View | Files available | DOI
 
[11]
2015 | Conference Paper | IST-REx-ID: 1610
Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-662-47666-6_10.
View | Files available | DOI
 
[10]
2015 | Technical Report | IST-REx-ID: 5441
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Goharshady, and Andreas Pavlogiannis. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-340-v1-1.
View | Files available | DOI
 
[9]
2014 | Conference Paper | IST-REx-ID: 2216
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Ritankar Majumdar. “Edit Distance for Timed Automata,” 303–12. Springer, 2014. https://doi.org/10.1145/2562059.2562141.
View | Files available | DOI | Download (ext.)
 
[8]
2014 | 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. https://doi.org/10.15479/AT:IST-2014-191-v1-1.
View | Files available | DOI
 
[7]
2014 | Conference Paper | IST-REx-ID: 2162
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Complexity of Ergodic Mean Payoff Games,” 8573:122–33. Springer, 2014. https://doi.org/10.1007/978-3-662-43951-7_11.
View | Files available | DOI | Download (ext.) | arXiv
 
[6]
2014 | Technical Report | IST-REx-ID: 5419   OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-187-v1-1.
View | Files available | DOI
 
[5]
2014 | Technical Report | IST-REx-ID: 5421   OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity of Evolution on Graphs. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-190-v2-2.
View | Files available | DOI
 
[4]
2014 | Technical Report | IST-REx-ID: 5427   OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-314-v1-1.
View | Files available | DOI
 
[3]
2013 | Technical Report | IST-REx-ID: 5404   OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Complexity of Ergodic Games. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-127-v1-1.
View | Files available | DOI
 
[2]
2013 | Technical Report | IST-REx-ID: 5409   OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Rupak Majumdar. Edit Distance for Timed Automata. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-144-v1-1.
View | Files available | DOI
 
[1]
2013 | Technical Report | IST-REx-ID: 5403   OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. Qualitative Analysis of Concurrent Mean-Payoff Games. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-126-v1-1.
View | Files available | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed