Ismael R Jecker

Chatterjee Group

9 Publications

Mark all

[9]
2023 | Published | Conference Paper | IST-REx-ID: 14243 | OA
Bidding graph games with partially-observable budgets
G. Avni, I.R. Jecker, D. Zikelic, in:, Proceedings of the 37th AAAI Conference on Artificial Intelligence, 2023, pp. 5464–5471.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[8]
2022 | Published | Conference Paper | IST-REx-ID: 12101 | OA
Complexity of spatial games
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
 
[7]
2021 | Published | Conference Paper | IST-REx-ID: 10694 | OA
Infinite-duration all-pay bidding games
G. Avni, I.R. Jecker, D. Zikelic, in:, D. Marx (Ed.), Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2021, pp. 617–636.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[6]
2021 | Published | Conference Paper | IST-REx-ID: 10630 | OA
On the complexity of intersection non-emptiness for star-free language classes
Arrighi, Emmanuel, 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 213. 2021
[Published Version] View | Files available | DOI | arXiv
 
[5]
2021 | Published | Conference Paper | IST-REx-ID: 10055 | OA
A Ramsey theorem for finite monoids
Jecker, Ismael R, A Ramsey theorem for finite monoids. 38th International Symposium on Theoretical Aspects of Computer Science 187. 2021
[Published Version] View | Files available | DOI | WoS
 
[4]
2021 | Published | Conference Paper | IST-REx-ID: 10052 | OA
Decomposing permutation automata
Jecker, Ismael R, Decomposing permutation automata. 32nd International Conference on Concurrency Theory 203. 2021
[Published Version] View | Files available | DOI | arXiv
 
[3]
2021 | Published | Conference Paper | IST-REx-ID: 10075 | OA
A bit of nondeterminism makes pushdown automata expressive and succinct
Guha, Shibashis, A bit of nondeterminism makes pushdown automata expressive and succinct. 46th International Symposium on Mathematical Foundations of Computer Science 202. 2021
[Published Version] View | Files available | DOI | arXiv
 
[2]
2020 | Published | Conference Paper | IST-REx-ID: 8534 | OA
Unary prime languages
Jecker, Ismael R, Unary prime languages. 45th International Symposium on Mathematical Foundations of Computer Science 170. 2020
[Published Version] View | Files available | DOI
 
[1]
2020 | Published | Conference Paper | IST-REx-ID: 8533 | OA
Simplified game of life: Algorithms and complexity
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
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Export / Embed

Grants


9 Publications

Mark all

[9]
2023 | Published | Conference Paper | IST-REx-ID: 14243 | OA
Bidding graph games with partially-observable budgets
G. Avni, I.R. Jecker, D. Zikelic, in:, Proceedings of the 37th AAAI Conference on Artificial Intelligence, 2023, pp. 5464–5471.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[8]
2022 | Published | Conference Paper | IST-REx-ID: 12101 | OA
Complexity of spatial games
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
 
[7]
2021 | Published | Conference Paper | IST-REx-ID: 10694 | OA
Infinite-duration all-pay bidding games
G. Avni, I.R. Jecker, D. Zikelic, in:, D. Marx (Ed.), Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2021, pp. 617–636.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[6]
2021 | Published | Conference Paper | IST-REx-ID: 10630 | OA
On the complexity of intersection non-emptiness for star-free language classes
Arrighi, Emmanuel, 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 213. 2021
[Published Version] View | Files available | DOI | arXiv
 
[5]
2021 | Published | Conference Paper | IST-REx-ID: 10055 | OA
A Ramsey theorem for finite monoids
Jecker, Ismael R, A Ramsey theorem for finite monoids. 38th International Symposium on Theoretical Aspects of Computer Science 187. 2021
[Published Version] View | Files available | DOI | WoS
 
[4]
2021 | Published | Conference Paper | IST-REx-ID: 10052 | OA
Decomposing permutation automata
Jecker, Ismael R, Decomposing permutation automata. 32nd International Conference on Concurrency Theory 203. 2021
[Published Version] View | Files available | DOI | arXiv
 
[3]
2021 | Published | Conference Paper | IST-REx-ID: 10075 | OA
A bit of nondeterminism makes pushdown automata expressive and succinct
Guha, Shibashis, A bit of nondeterminism makes pushdown automata expressive and succinct. 46th International Symposium on Mathematical Foundations of Computer Science 202. 2021
[Published Version] View | Files available | DOI | arXiv
 
[2]
2020 | Published | Conference Paper | IST-REx-ID: 8534 | OA
Unary prime languages
Jecker, Ismael R, Unary prime languages. 45th International Symposium on Mathematical Foundations of Computer Science 170. 2020
[Published Version] View | Files available | DOI
 
[1]
2020 | Published | Conference Paper | IST-REx-ID: 8533 | OA
Simplified game of life: Algorithms and complexity
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
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Export / Embed