Ismael R Jecker
Chatterjee Group
9 Publications
2023 | Conference Paper | IST-REx-ID: 14243 | 
Avni, Guy, et al. “Bidding Graph Games with Partially-Observable Budgets.” Proceedings of the 37th AAAI Conference on Artificial Intelligence, vol. 37, no. 5, 2023, pp. 5464–71, doi:10.1609/aaai.v37i5.25679.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2022 | Conference Paper | IST-REx-ID: 12101 |
Chatterjee, Krishnendu, et al. “Complexity of Spatial Games.” 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 250, 11:1-11:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.FSTTCS.2022.11.
[Published Version]
View
| Files available
| DOI
2021 | Conference Paper | IST-REx-ID: 10052 |
Jecker, Ismael R., et al. “Decomposing Permutation Automata.” 32nd International Conference on Concurrency Theory, vol. 203, 18, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.CONCUR.2021.18.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 | Conference Paper | IST-REx-ID: 10075 |
Guha, Shibashis, et al. “A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct.” 46th International Symposium on Mathematical Foundations of Computer Science, vol. 202, 53, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.MFCS.2021.53.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 | Conference Paper | IST-REx-ID: 10630 |
Arrighi, Emmanuel, et al. “On the Complexity of Intersection Non-Emptiness for Star-Free Language Classes.” 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 213, 34, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.FSTTCS.2021.34.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 | Conference Paper | IST-REx-ID: 10694 |
Avni, Guy, et al. “Infinite-Duration All-Pay Bidding Games.” Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, edited by Dániel Marx, Society for Industrial and Applied Mathematics, 2021, pp. 617–36, doi:10.1137/1.9781611976465.38.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Conference Paper | IST-REx-ID: 10055 |
Jecker, Ismael R. “A Ramsey Theorem for Finite Monoids.” 38th International Symposium on Theoretical Aspects of Computer Science, vol. 187, 44, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.STACS.2021.44.
[Published Version]
View
| Files available
| DOI
| WoS
2020 | Conference Paper | IST-REx-ID: 8533 |
Chatterjee, Krishnendu, et al. “Simplified Game of Life: Algorithms and Complexity.” 45th International Symposium on Mathematical Foundations of Computer Science, vol. 170, 22:1-22:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.MFCS.2020.22.
[Published Version]
View
| Files available
| DOI
| arXiv
2020 | Conference Paper | IST-REx-ID: 8534 |
Jecker, Ismael R., et al. “Unary Prime Languages.” 45th International Symposium on Mathematical Foundations of Computer Science, vol. 170, 51:1-51:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.MFCS.2020.51.
[Published Version]
View
| Files available
| DOI
9 Publications
2023 | Conference Paper | IST-REx-ID: 14243 |
Avni, Guy, et al. “Bidding Graph Games with Partially-Observable Budgets.” Proceedings of the 37th AAAI Conference on Artificial Intelligence, vol. 37, no. 5, 2023, pp. 5464–71, doi:10.1609/aaai.v37i5.25679.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2022 | Conference Paper | IST-REx-ID: 12101 |
Chatterjee, Krishnendu, et al. “Complexity of Spatial Games.” 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 250, 11:1-11:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.FSTTCS.2022.11.
[Published Version]
View
| Files available
| DOI
2021 | Conference Paper | IST-REx-ID: 10052 |
Jecker, Ismael R., et al. “Decomposing Permutation Automata.” 32nd International Conference on Concurrency Theory, vol. 203, 18, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.CONCUR.2021.18.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 | Conference Paper | IST-REx-ID: 10075 |
Guha, Shibashis, et al. “A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct.” 46th International Symposium on Mathematical Foundations of Computer Science, vol. 202, 53, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.MFCS.2021.53.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 | Conference Paper | IST-REx-ID: 10630 |
Arrighi, Emmanuel, et al. “On the Complexity of Intersection Non-Emptiness for Star-Free Language Classes.” 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 213, 34, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.FSTTCS.2021.34.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 | Conference Paper | IST-REx-ID: 10694 |
Avni, Guy, et al. “Infinite-Duration All-Pay Bidding Games.” Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, edited by Dániel Marx, Society for Industrial and Applied Mathematics, 2021, pp. 617–36, doi:10.1137/1.9781611976465.38.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Conference Paper | IST-REx-ID: 10055 |
Jecker, Ismael R. “A Ramsey Theorem for Finite Monoids.” 38th International Symposium on Theoretical Aspects of Computer Science, vol. 187, 44, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.STACS.2021.44.
[Published Version]
View
| Files available
| DOI
| WoS
2020 | Conference Paper | IST-REx-ID: 8533 |
Chatterjee, Krishnendu, et al. “Simplified Game of Life: Algorithms and Complexity.” 45th International Symposium on Mathematical Foundations of Computer Science, vol. 170, 22:1-22:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.MFCS.2020.22.
[Published Version]
View
| Files available
| DOI
| arXiv
2020 | Conference Paper | IST-REx-ID: 8534 |
Jecker, Ismael R., et al. “Unary Prime Languages.” 45th International Symposium on Mathematical Foundations of Computer Science, vol. 170, 51:1-51:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.MFCS.2020.51.
[Published Version]
View
| Files available
| DOI