Ismael R Jecker

Chatterjee Group

9 Publications

Mark all

[9]
2023 | Conference Paper | IST-REx-ID: 14243 | OA
Avni G, Jecker IR, Zikelic D. 2023. Bidding graph games with partially-observable budgets. Proceedings of the 37th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 37, 5464–5471.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[8]
2022 | Conference Paper | IST-REx-ID: 12101 | OA
Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. 2022. Complexity of spatial games. 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTC: Foundations of Software Technology and Theoretical Computer Science vol. 250, 11:1-11:14.
[Published Version] View | Files available | DOI
 
[7]
2021 | Conference Paper | IST-REx-ID: 10052 | OA
Jecker IR, Mazzocchi N, Wolf P. 2021. Decomposing permutation automata. 32nd International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 203, 18.
[Published Version] View | Files available | DOI | arXiv
 
[6]
2021 | Conference Paper | IST-REx-ID: 10075 | OA
Guha S, Jecker IR, Lehtinen K, Zimmermann M. 2021. A bit of nondeterminism makes pushdown automata expressive and succinct. 46th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 202, 53.
[Published Version] View | Files available | DOI | arXiv
 
[5]
2021 | Conference Paper | IST-REx-ID: 10630 | OA
Arrighi E, Fernau H, Hoffmann S, Holzer M, Jecker IR, De Oliveira Oliveira M, Wolf P. 2021. 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. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 213, 34.
[Published Version] View | Files available | DOI | arXiv
 
[4]
2021 | Conference Paper | IST-REx-ID: 10694 | OA
Avni G, Jecker IR, Zikelic D. 2021. Infinite-duration all-pay bidding games. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 617–636.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[3]
2021 | Conference Paper | IST-REx-ID: 10055 | OA
Jecker IR. 2021. A Ramsey theorem for finite monoids. 38th International Symposium on Theoretical Aspects of Computer Science. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 187, 44.
[Published Version] View | Files available | DOI | WoS
 
[2]
2020 | Conference Paper | IST-REx-ID: 8533 | OA
Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. 2020. Simplified game of life: Algorithms and complexity. 45th International Symposium on Mathematical Foundations of Computer Science. MFCS: Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 170, 22:1-22:13.
[Published Version] View | Files available | DOI | arXiv
 
[1]
2020 | Conference Paper | IST-REx-ID: 8534 | OA
Jecker IR, Kupferman O, Mazzocchi N. 2020. Unary prime languages. 45th International Symposium on Mathematical Foundations of Computer Science. MFCS: Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 170, 51:1-51:12.
[Published Version] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: ISTA Annual Report

    Export / Embed

9 Publications

Mark all

[9]
2023 | Conference Paper | IST-REx-ID: 14243 | OA
Avni G, Jecker IR, Zikelic D. 2023. Bidding graph games with partially-observable budgets. Proceedings of the 37th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 37, 5464–5471.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[8]
2022 | Conference Paper | IST-REx-ID: 12101 | OA
Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. 2022. Complexity of spatial games. 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTC: Foundations of Software Technology and Theoretical Computer Science vol. 250, 11:1-11:14.
[Published Version] View | Files available | DOI
 
[7]
2021 | Conference Paper | IST-REx-ID: 10052 | OA
Jecker IR, Mazzocchi N, Wolf P. 2021. Decomposing permutation automata. 32nd International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 203, 18.
[Published Version] View | Files available | DOI | arXiv
 
[6]
2021 | Conference Paper | IST-REx-ID: 10075 | OA
Guha S, Jecker IR, Lehtinen K, Zimmermann M. 2021. A bit of nondeterminism makes pushdown automata expressive and succinct. 46th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 202, 53.
[Published Version] View | Files available | DOI | arXiv
 
[5]
2021 | Conference Paper | IST-REx-ID: 10630 | OA
Arrighi E, Fernau H, Hoffmann S, Holzer M, Jecker IR, De Oliveira Oliveira M, Wolf P. 2021. 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. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 213, 34.
[Published Version] View | Files available | DOI | arXiv
 
[4]
2021 | Conference Paper | IST-REx-ID: 10694 | OA
Avni G, Jecker IR, Zikelic D. 2021. Infinite-duration all-pay bidding games. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 617–636.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[3]
2021 | Conference Paper | IST-REx-ID: 10055 | OA
Jecker IR. 2021. A Ramsey theorem for finite monoids. 38th International Symposium on Theoretical Aspects of Computer Science. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 187, 44.
[Published Version] View | Files available | DOI | WoS
 
[2]
2020 | Conference Paper | IST-REx-ID: 8533 | OA
Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. 2020. Simplified game of life: Algorithms and complexity. 45th International Symposium on Mathematical Foundations of Computer Science. MFCS: Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 170, 22:1-22:13.
[Published Version] View | Files available | DOI | arXiv
 
[1]
2020 | Conference Paper | IST-REx-ID: 8534 | OA
Jecker IR, Kupferman O, Mazzocchi N. 2020. Unary prime languages. 45th International Symposium on Mathematical Foundations of Computer Science. MFCS: Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 170, 51:1-51:12.
[Published Version] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: ISTA Annual Report

    Export / Embed