Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
534 Publications
earlier version | 2015 |
Published |
Technical Report |
IST-REx-ID: 5429 |
Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes, IST Austria, 41p.
[Published Version]
View
| Files available
| DOI
earlier version | 2015 |
Published |
Technical Report |
IST-REx-ID: 5438 |
Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2015. Edit distance for pushdown automata, IST Austria, 15p.
[Published Version]
View
| Files available
| DOI
earlier version | 2015 |
Published |
Conference Paper |
IST-REx-ID: 1661 |
Chatterjee K, Henzinger M, Loitzenbauer V. 2015. Improved algorithms for one-pair and k-pair Streett objectives. Proceedings - Symposium on Logic in Computer Science. LICS: Logic in Computer Science vol. 2015–July, 7174888.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| WoS
2015 |
Published |
Journal Article |
IST-REx-ID: 2034 |
Bérard B, Chatterjee K, Sznajder N. 2015. Probabilistic opacity for Markov decision processes. Information Processing Letters. 115(1), 52–59.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
earlier version | 2015 |
Published |
Conference Paper |
IST-REx-ID: 1656 |
Chatterjee K, Henzinger TA, Otop J. 2015. Nested weighted automata. Proceedings - Symposium on Logic in Computer Science. LICS: Logic in Computer Science vol. 2015–July, 7174926.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
earlier version | 2015 |
Published |
Technical Report |
IST-REx-ID: 5436 |
Chatterjee K, Henzinger TA, Otop J. 2015. Nested weighted automata, IST Austria, 29p.
[Published Version]
View
| Files available
| DOI
2015 |
Published |
Journal Article |
IST-REx-ID: 1709 |
Reiter J, Kanodia A, Gupta R, Nowak M, Chatterjee K. 2015. Biological auctions with multiple rewards. Proceedings of the Royal Society of London Series B Biological Sciences. 282(1812).
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| WoS
| PubMed | Europe PMC
2015 |
Published |
Thesis | PhD |
IST-REx-ID: 1400
Reiter J. 2015. The subclonal evolution of cancer. Institute of Science and Technology Austria.
View
| Files available
earlier version | 2015 |
Published |
Conference Paper |
IST-REx-ID: 1820 |
Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2015. Optimal cost almost-sure reachability in POMDPs. Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence . IAAI: Innovative Applications of Artificial Intelligence, Artifical Intelligence, vol. 5, 3496–3502.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2014 |
Published |
Conference Paper |
IST-REx-ID: 10884 |
Aminof B, Jacobs S, Khalimov A, Rubin S. 2014. Parameterized model checking of token-passing systems. Verification, Model Checking, and Abstract Interpretation. VMCAI: Verifcation, Model Checking, and Abstract Interpretation, LNCS, vol. 8318, 262–281.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
earlier version | 2014 |
Published |
Conference Paper |
IST-REx-ID: 10885 |
Chatterjee K, Doyen L, Filiot E, Raskin J-F. 2014. Doomsday equilibria for omega-regular games. VMCAI 2014: Verification, Model Checking, and Abstract Interpretation. VMCAI: Verifcation, Model Checking, and Abstract Interpretation, LNCS, vol. 8318, 78–97.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 |
Published |
Conference Paper |
IST-REx-ID: 2212
Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. 2014. Perfect-information stochastic mean-payoff parity games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 8412, 210–225.
View
| Files available
| DOI
2014 |
Published |
Conference Paper |
IST-REx-ID: 2213 |
Chatterjee K, Doyen L, Nain S, Vardi M. 2014. The complexity of partial-observation stochastic parity games with finite-memory strategies. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 8412, 242–257.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 |
Published |
Conference Paper |
IST-REx-ID: 2216 |
Chatterjee K, Ibsen-Jensen R, Majumdar R. 2014. Edit distance for timed automata. HSCC: Hybrid Systems - Computation and Control, 303–312.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2014 |
Published |
Journal Article |
IST-REx-ID: 2246 |
Grinshpun A, Phalitnonkiat P, Rubin S, Tarfulea A. 2014. Alternating traps in Muller and parity games. Theoretical Computer Science. 521, 73–91.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
| arXiv
2014 |
Published |
Journal Article |
IST-REx-ID: 2141 |
Chatterjee K, Henzinger M. 2014. Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. Journal of the ACM. 61(3), a15.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| WoS
2014 |
Published |
Conference Paper |
IST-REx-ID: 2162 |
Chatterjee K, Ibsen-Jensen R. 2014. The complexity of ergodic mean payoff games. ICST: International Conference on Software Testing, Verification and Validation, LNCS, vol. 8573, 122–133.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 |
Published |
Conference Paper |
IST-REx-ID: 2163 |
Chatterjee K, Doyen L. 2014. Games with a weak adversary. Lecture Notes in Computer Science. ICALP: Automata, Languages and Programming, LNCS, vol. 8573, 110–121.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 |
Published |
Journal Article |
IST-REx-ID: 2187 |
Bloem R, Chatterjee K, Greimel K, Henzinger TA, Hofferek G, Jobstmann B, Könighofer B, Könighofer R. 2014. Synthesizing robust systems. Acta Informatica. 51(3–4), 193–220.
[Submitted Version]
View
| Files available
| DOI
| WoS
2014 |
Published |
Conference Paper |
IST-REx-ID: 2190 |
Esparza J, Kretinsky J. 2014. From LTL to deterministic automata: A safraless compositional approach. CAV: Computer Aided Verification, LNCS, vol. 8559, 192–208.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| arXiv