Ismael R Jecker

Chatterjee Group

9 Publications

Mark all

[9]
2023 | Published | Conference Paper | IST-REx-ID: 14243 | OA
G. Avni, I. R. Jecker, and D. Zikelic, “Bidding graph games with partially-observable budgets,” in Proceedings of the 37th AAAI Conference on Artificial Intelligence, Washington, DC, United States, 2023, vol. 37, no. 5, pp. 5464–5471.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[8]
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
 
[7]
2021 | Published | Conference Paper | IST-REx-ID: 10694 | OA
G. Avni, I. R. Jecker, and D. Zikelic, “Infinite-duration all-pay bidding games,” in Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, Virtual, 2021, pp. 617–636.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[6]
2021 | Published | Conference Paper | IST-REx-ID: 10052 | OA
I. R. Jecker, N. Mazzocchi, and P. Wolf, “Decomposing permutation automata,” in 32nd International Conference on Concurrency Theory, Paris, France, 2021, vol. 203.
[Published Version] View | Files available | DOI | arXiv
 
[5]
2021 | Published | Conference Paper | IST-REx-ID: 10630 | OA
E. Arrighi et al., “On the complexity of intersection non-emptiness for star-free language classes,” in 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Virtual, 2021, vol. 213.
[Published Version] View | Files available | DOI | arXiv
 
[4]
2021 | Published | Conference Paper | IST-REx-ID: 10075 | OA
S. Guha, I. R. Jecker, K. Lehtinen, and M. Zimmermann, “A bit of nondeterminism makes pushdown automata expressive and succinct,” in 46th International Symposium on Mathematical Foundations of Computer Science, Tallinn, Estonia, 2021, vol. 202.
[Published Version] View | Files available | DOI | arXiv
 
[3]
2021 | Published | Conference Paper | IST-REx-ID: 10055 | OA
I. R. Jecker, “A Ramsey theorem for finite monoids,” in 38th International Symposium on Theoretical Aspects of Computer Science, Saarbrücken, Germany, 2021, vol. 187.
[Published Version] View | Files available | DOI | WoS
 
[2]
2020 | Published | Conference Paper | IST-REx-ID: 8534 | OA
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
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

Citation Style: IEEE

Export / Embed

Grants


9 Publications

Mark all

[9]
2023 | Published | Conference Paper | IST-REx-ID: 14243 | OA
G. Avni, I. R. Jecker, and D. Zikelic, “Bidding graph games with partially-observable budgets,” in Proceedings of the 37th AAAI Conference on Artificial Intelligence, Washington, DC, United States, 2023, vol. 37, no. 5, pp. 5464–5471.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[8]
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
 
[7]
2021 | Published | Conference Paper | IST-REx-ID: 10694 | OA
G. Avni, I. R. Jecker, and D. Zikelic, “Infinite-duration all-pay bidding games,” in Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, Virtual, 2021, pp. 617–636.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[6]
2021 | Published | Conference Paper | IST-REx-ID: 10052 | OA
I. R. Jecker, N. Mazzocchi, and P. Wolf, “Decomposing permutation automata,” in 32nd International Conference on Concurrency Theory, Paris, France, 2021, vol. 203.
[Published Version] View | Files available | DOI | arXiv
 
[5]
2021 | Published | Conference Paper | IST-REx-ID: 10630 | OA
E. Arrighi et al., “On the complexity of intersection non-emptiness for star-free language classes,” in 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Virtual, 2021, vol. 213.
[Published Version] View | Files available | DOI | arXiv
 
[4]
2021 | Published | Conference Paper | IST-REx-ID: 10075 | OA
S. Guha, I. R. Jecker, K. Lehtinen, and M. Zimmermann, “A bit of nondeterminism makes pushdown automata expressive and succinct,” in 46th International Symposium on Mathematical Foundations of Computer Science, Tallinn, Estonia, 2021, vol. 202.
[Published Version] View | Files available | DOI | arXiv
 
[3]
2021 | Published | Conference Paper | IST-REx-ID: 10055 | OA
I. R. Jecker, “A Ramsey theorem for finite monoids,” in 38th International Symposium on Theoretical Aspects of Computer Science, Saarbrücken, Germany, 2021, vol. 187.
[Published Version] View | Files available | DOI | WoS
 
[2]
2020 | Published | Conference Paper | IST-REx-ID: 8534 | OA
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
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

Citation Style: IEEE

Export / Embed