35 Publications

Mark all

[35]
2019 | Conference Paper | IST-REx-ID: 6822   OA
G. Avni, T. A. Henzinger, R. Ibsen-Jensen, and P. Novotny, “Bidding games on Markov decision processes,” in Proceedings of the 13th International Conference of Reachability Problems, Brussels, Belgium.
View | Files available
 
[34]
2018 | Journal Article | IST-REx-ID: 198   OA
R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, and M. Nowak, “Language acquisition with communication between learners,” Journal of the Royal Society Interface, vol. 15, no. 140, 2018.
View | Files available | DOI
 
[33]
2018 | Conference Paper | IST-REx-ID: 5788   OA
G. Avni, T. A. Henzinger, and R. Ibsen-Jensen, “Infinite-duration poorman-bidding games,” presented at the 14th International Conference on Web and Internet Economics, WINE, Oxford, UK, 2018, vol. 11316, pp. 21–36.
View | DOI | Download (ext.) | arXiv
 
[32]
2018 | Conference Paper | IST-REx-ID: 66   OA
K. Chatterjee, A. Goharshady, R. Ibsen-Jensen, and Y. Velner, “Ergodic mean-payoff games for the analysis of attacks in crypto-currencies.,” presented at the CONCUR: Conference on Concurrency Theory, Beijing, China, 2018, vol. 118, p. 11.
View | Files available | DOI | Download (ext.) | arXiv
 
[31]
2018 | Conference Paper | IST-REx-ID: 5967
K. A. Hansen, R. Ibsen-Jensen, and A. 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, Ithaca, NY, United States, 2018, pp. 149–150.
View | DOI
 
[30]
2018 | Journal Article | IST-REx-ID: 6009   OA
K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” ACM Transactions on Programming Languages and Systems, vol. 40, no. 3, p. 9, 2018.
View | Files available | DOI | Download (ext.) | arXiv
 
[29]
2017 | Journal Article | IST-REx-ID: 465
K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” Logical Methods in Computer Science, vol. 13, no. 3, 2017.
View | Files available | DOI
 
[28]
2017 | Conference Paper | IST-REx-ID: 551   OA
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, “Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.
View | Files available | DOI
 
[27]
2017 | Conference Paper | IST-REx-ID: 553   OA
K. Chatterjee, K. Hansen, and R. Ibsen-Jensen, “Strategy complexity of concurrent safety games,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.
View | Files available | DOI | Download (ext.)
 
[26]
2016 | Conference Paper | IST-REx-ID: 1340   OA
K. Hansen, R. Ibsen-Jensen, and M. Koucký, “The big match in small space,” presented at the SAGT: Symposium on Algorithmic Game Theory, Liverpool, United Kingdom, 2016, vol. 9928, pp. 64–76.
View | DOI | Download (ext.)
 
[25]
2016 | Conference Paper | IST-REx-ID: 478   OA
K. Chatterjee and R. Ibsen-Jensen, “The complexity of deciding legality of a single step of magic: The gathering,” presented at the ECAI: European Conference on Artificial Intelligence, The Hague, Netherlands, 2016, vol. 285, pp. 1432–1439.
View | Files available | DOI
 
[24]
2016 | Conference Paper | IST-REx-ID: 1182   OA
K. Chatterjee, R. Ibsen-Jensen, and J. Tkadlec, “Robust draws in balanced knockout tournaments,” presented at the IJCAI: International Joint Conference on Artificial Intelligence, New York, NY, USA, 2016, vol. 2016–January, pp. 172–179.
View | Files available | Download (ext.)
 
[23]
2016 | Conference Paper | IST-REx-ID: 1071
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs,” presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark, 2016, vol. 57.
View | Files available | DOI
 
[22]
2016 | Conference Paper | IST-REx-ID: 1437
K. Chatterjee, A. Goharshady, R. Ibsen-Jensen, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA, 2016, vol. 20–22, pp. 733–747.
View | Files available | DOI | Download (ext.) | arXiv
 
[21]
2015 | Technical Report | IST-REx-ID: 5430
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015.
View | Files available | DOI
 
[20]
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, pp. 15636–15641, 2015.
View | DOI | Download (ext.) | PubMed | Europe PMC
 
[19]
2015 | Journal Article | IST-REx-ID: 524
K. Chatterjee and R. Ibsen-Jensen, “Qualitative analysis of concurrent mean payoff games,” Information and Computation, vol. 242, no. 6, pp. 2–24, 2015.
View | Files available | DOI | Download (ext.) | arXiv
 
[18]
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.
View | Files available | DOI
 
[17]
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.
View | Files available | DOI
 
[16]
2015 | Technical Report | IST-REx-ID: 5432
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolutionary games on graphs. IST Austria, 2015.
View | Files available | DOI
 
[15]
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.
View | Files available | DOI
 
[14]
2015 | Journal Article | IST-REx-ID: 1602
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, pp. 97–109, 2015.
View | Files available | DOI | Download (ext.) | arXiv
 
[13]
2015 | Conference Paper | IST-REx-ID: 1607
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.
View | Files available | DOI | Download (ext.)
 
[12]
2015 | Technical Report | IST-REx-ID: 5440
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolutionary games on graphs. IST Austria, 2015.
View | Files available | DOI
 
[11]
2015 | Conference Paper | IST-REx-ID: 1610
K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” vol. 9135, no. Part II. Springer, pp. 121–133, 2015.
View | Files available | DOI
 
[10]
2015 | Technical Report | IST-REx-ID: 5441
K. Chatterjee, R. Ibsen-Jensen, A. Goharshady, and A. Pavlogiannis, Algorithms for algebraic path properties in concurrent systems of constant treewidth components. IST Austria, 2015.
View | Files available | DOI
 
[9]
2014 | Conference Paper | IST-REx-ID: 2216
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.
View | Files available | DOI | Download (ext.)
 
[8]
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.
View | Files available | DOI
 
[7]
2014 | Conference Paper | IST-REx-ID: 2162
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.
View | Files available | DOI | Download (ext.) | arXiv
 
[6]
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.
View | Files available | DOI
 
[5]
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.
View | Files available | DOI
 
[4]
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.
View | Files available | DOI
 
[3]
2013 | Technical Report | IST-REx-ID: 5404   OA
K. Chatterjee and R. Ibsen-Jensen, The complexity of ergodic games. IST Austria, 2013.
View | Files available | DOI
 
[2]
2013 | Technical Report | IST-REx-ID: 5409   OA
K. Chatterjee, R. Ibsen-Jensen, and R. Majumdar, Edit distance for timed automata. IST Austria, 2013.
View | Files available | DOI
 
[1]
2013 | Technical Report | IST-REx-ID: 5403   OA
K. Chatterjee and R. Ibsen-Jensen, Qualitative analysis of concurrent mean-payoff games. IST Austria, 2013.
View | Files available | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed

35 Publications

Mark all

[35]
2019 | Conference Paper | IST-REx-ID: 6822   OA
G. Avni, T. A. Henzinger, R. Ibsen-Jensen, and P. Novotny, “Bidding games on Markov decision processes,” in Proceedings of the 13th International Conference of Reachability Problems, Brussels, Belgium.
View | Files available
 
[34]
2018 | Journal Article | IST-REx-ID: 198   OA
R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, and M. Nowak, “Language acquisition with communication between learners,” Journal of the Royal Society Interface, vol. 15, no. 140, 2018.
View | Files available | DOI
 
[33]
2018 | Conference Paper | IST-REx-ID: 5788   OA
G. Avni, T. A. Henzinger, and R. Ibsen-Jensen, “Infinite-duration poorman-bidding games,” presented at the 14th International Conference on Web and Internet Economics, WINE, Oxford, UK, 2018, vol. 11316, pp. 21–36.
View | DOI | Download (ext.) | arXiv
 
[32]
2018 | Conference Paper | IST-REx-ID: 66   OA
K. Chatterjee, A. Goharshady, R. Ibsen-Jensen, and Y. Velner, “Ergodic mean-payoff games for the analysis of attacks in crypto-currencies.,” presented at the CONCUR: Conference on Concurrency Theory, Beijing, China, 2018, vol. 118, p. 11.
View | Files available | DOI | Download (ext.) | arXiv
 
[31]
2018 | Conference Paper | IST-REx-ID: 5967
K. A. Hansen, R. Ibsen-Jensen, and A. 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, Ithaca, NY, United States, 2018, pp. 149–150.
View | DOI
 
[30]
2018 | Journal Article | IST-REx-ID: 6009   OA
K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” ACM Transactions on Programming Languages and Systems, vol. 40, no. 3, p. 9, 2018.
View | Files available | DOI | Download (ext.) | arXiv
 
[29]
2017 | Journal Article | IST-REx-ID: 465
K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” Logical Methods in Computer Science, vol. 13, no. 3, 2017.
View | Files available | DOI
 
[28]
2017 | Conference Paper | IST-REx-ID: 551   OA
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, “Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.
View | Files available | DOI
 
[27]
2017 | Conference Paper | IST-REx-ID: 553   OA
K. Chatterjee, K. Hansen, and R. Ibsen-Jensen, “Strategy complexity of concurrent safety games,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.
View | Files available | DOI | Download (ext.)
 
[26]
2016 | Conference Paper | IST-REx-ID: 1340   OA
K. Hansen, R. Ibsen-Jensen, and M. Koucký, “The big match in small space,” presented at the SAGT: Symposium on Algorithmic Game Theory, Liverpool, United Kingdom, 2016, vol. 9928, pp. 64–76.
View | DOI | Download (ext.)
 
[25]
2016 | Conference Paper | IST-REx-ID: 478   OA
K. Chatterjee and R. Ibsen-Jensen, “The complexity of deciding legality of a single step of magic: The gathering,” presented at the ECAI: European Conference on Artificial Intelligence, The Hague, Netherlands, 2016, vol. 285, pp. 1432–1439.
View | Files available | DOI
 
[24]
2016 | Conference Paper | IST-REx-ID: 1182   OA
K. Chatterjee, R. Ibsen-Jensen, and J. Tkadlec, “Robust draws in balanced knockout tournaments,” presented at the IJCAI: International Joint Conference on Artificial Intelligence, New York, NY, USA, 2016, vol. 2016–January, pp. 172–179.
View | Files available | Download (ext.)
 
[23]
2016 | Conference Paper | IST-REx-ID: 1071
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs,” presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark, 2016, vol. 57.
View | Files available | DOI
 
[22]
2016 | Conference Paper | IST-REx-ID: 1437
K. Chatterjee, A. Goharshady, R. Ibsen-Jensen, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA, 2016, vol. 20–22, pp. 733–747.
View | Files available | DOI | Download (ext.) | arXiv
 
[21]
2015 | Technical Report | IST-REx-ID: 5430
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015.
View | Files available | DOI
 
[20]
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, pp. 15636–15641, 2015.
View | DOI | Download (ext.) | PubMed | Europe PMC
 
[19]
2015 | Journal Article | IST-REx-ID: 524
K. Chatterjee and R. Ibsen-Jensen, “Qualitative analysis of concurrent mean payoff games,” Information and Computation, vol. 242, no. 6, pp. 2–24, 2015.
View | Files available | DOI | Download (ext.) | arXiv
 
[18]
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.
View | Files available | DOI
 
[17]
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.
View | Files available | DOI
 
[16]
2015 | Technical Report | IST-REx-ID: 5432
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolutionary games on graphs. IST Austria, 2015.
View | Files available | DOI
 
[15]
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.
View | Files available | DOI
 
[14]
2015 | Journal Article | IST-REx-ID: 1602
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, pp. 97–109, 2015.
View | Files available | DOI | Download (ext.) | arXiv
 
[13]
2015 | Conference Paper | IST-REx-ID: 1607
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.
View | Files available | DOI | Download (ext.)
 
[12]
2015 | Technical Report | IST-REx-ID: 5440
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolutionary games on graphs. IST Austria, 2015.
View | Files available | DOI
 
[11]
2015 | Conference Paper | IST-REx-ID: 1610
K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” vol. 9135, no. Part II. Springer, pp. 121–133, 2015.
View | Files available | DOI
 
[10]
2015 | Technical Report | IST-REx-ID: 5441
K. Chatterjee, R. Ibsen-Jensen, A. Goharshady, and A. Pavlogiannis, Algorithms for algebraic path properties in concurrent systems of constant treewidth components. IST Austria, 2015.
View | Files available | DOI
 
[9]
2014 | Conference Paper | IST-REx-ID: 2216
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.
View | Files available | DOI | Download (ext.)
 
[8]
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.
View | Files available | DOI
 
[7]
2014 | Conference Paper | IST-REx-ID: 2162
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.
View | Files available | DOI | Download (ext.) | arXiv
 
[6]
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.
View | Files available | DOI
 
[5]
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.
View | Files available | DOI
 
[4]
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.
View | Files available | DOI
 
[3]
2013 | Technical Report | IST-REx-ID: 5404   OA
K. Chatterjee and R. Ibsen-Jensen, The complexity of ergodic games. IST Austria, 2013.
View | Files available | DOI
 
[2]
2013 | Technical Report | IST-REx-ID: 5409   OA
K. Chatterjee, R. Ibsen-Jensen, and R. Majumdar, Edit distance for timed automata. IST Austria, 2013.
View | Files available | DOI
 
[1]
2013 | Technical Report | IST-REx-ID: 5403   OA
K. Chatterjee and R. Ibsen-Jensen, Qualitative analysis of concurrent mean-payoff games. IST Austria, 2013.
View | Files available | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed