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.

Ehsan Kafshdar Goharshadi

Pavol Kebis

Ali Asadi

Jakub Svoboda

Mehrdad Karrabi

Krishnendu Chatterjee

Ruichen Luo

Hongfei Fu

Maximilian Weininger

Pepa Tkadlec

Florian Horn

Amir Goharshady

Laura Schmid

Benjamin Aminof

Djordje Zikelic

Andreas Pavlogiannis

Ismael Jecker

Mingzhang Huang

Sasha Rubin

Viktor Toman

Petr Novotny

Ventsislav Chonev

Tadeas Priklopil

Raimundo Saona Urmeneta

Tobias Meggendorfer

Christian Hilbe

Jan Kretinsky

Mathieu Tracol

Joost Katoen

Rasmus Ibsen-Jensen

Johannes Reiter

John Lazarsfeld

Maria Kleshnina

Martin Chmelik

Valentin Hübner



520 Publications

2017 | Published | Journal Article | IST-REx-ID: 1294 | OA
T. Brázdil, K. Chatterjee, V. Forejt, and A. Kučera, “Trading performance for stability in Markov decision processes,” Journal of Computer and System Sciences, vol. 84. Elsevier, pp. 144–170, 2017.
[Published Version] View | Files available | DOI | WoS
 
2017 | Published | Conference Paper | IST-REx-ID: 13160 | OA
J. Kretinsky, T. Meggendorfer, C. Waldmann, and M. Weininger, “Index appearance record for transforming Rabin automata into parity automata,” in Tools and Algorithms for the Construction and Analysis of Systems, Uppsala, Sweden, 2017, vol. 10205, pp. 443–460.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2017 | Published | Journal Article | IST-REx-ID: 1065 | OA
K. Chatterjee and G. F. Osang, “Pushdown reachability with constant treewidth,” Information Processing Letters, vol. 122. Elsevier, pp. 25–29, 2017.
[Submitted Version] View | Files available | DOI | WoS
 
2017 | Published | Journal Article | IST-REx-ID: 1066 | OA
K. Chatterjee, T. A. Henzinger, J. Otop, and Y. Velner, “Quantitative fair simulation games,” Information and Computation, vol. 254, no. 2. Elsevier, pp. 143–166, 2017.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | WoS
 
2017 | Published | Journal Article | IST-REx-ID: 1080 | OA
J. Reiter et al., “Reconstructing metastatic seeding patterns of human cancers,” Nature Communications, vol. 8. Nature Publishing Group, 2017.
[Published Version] View | Files available | DOI | WoS
 
2017 | Published | Conference Paper | IST-REx-ID: 1009 | OA
K. Chatterjee, P. Novotný, G. Pérez, J. Raskin, and D. Zikelic, “Optimizing expectation with guarantees in POMDPs,” in Proceedings of the 31st AAAI Conference on Artificial Intelligence, San Francisco, CA, United States, 2017, vol. 5, pp. 3725–3732.
[Submitted Version] View | Download Submitted Version (ext.) | WoS
 
2017 | Published | Conference Paper | IST-REx-ID: 1011 | OA
K. Chatterjee, B. Kragl, S. Mishra, and A. Pavlogiannis, “Faster algorithms for weighted recursive state machines,” presented at the ESOP: European Symposium on Programming, Uppsala, Sweden, 2017, vol. 10201, pp. 287–313.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS | arXiv
 
2017 | Published | Journal Article | IST-REx-ID: 10416 | OA
K. Chatterjee, B. Choudhary, and A. Pavlogiannis, “Optimal Dyck reachability for data-dependence and Alias analysis,” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL. Association for Computing Machinery, 2017.
[Published Version] View | Files available | DOI | arXiv
 
2017 | Published | Journal Article | IST-REx-ID: 10418 | OA
A. Mciver, C. Morgan, B. L. Kaminski, and J. P. Katoen, “A new proof rule for almost-sure termination,” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL. Association for Computing Machinery, 2017.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
2017 | Published | Thesis | PhD | IST-REx-ID: 821 | OA
A. Pavlogiannis, “Algorithmic advances in program analysis and their applications,” Institute of Science and Technology Austria, 2017.
[Published Version] View | Files available | DOI
 
2017 | Published | Conference Paper | IST-REx-ID: 950 | OA
G. Avni, T. A. Henzinger, and V. K. Chonev, “Infinite-duration bidding games,” presented at the CONCUR: Concurrency Theory, Berlin, Germany, 2017, vol. 85.
[Published Version] View | Files available | DOI | arXiv
 
2017 | Published | Journal Article | IST-REx-ID: 464 | OA
K. Chatterjee, M. Henzinger, and V. Loitzenbauer, “Improved algorithms for parity and Streett objectives,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation of Computational Logic, 2017.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2017 | Published | Journal Article | IST-REx-ID: 465 | OA
K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation of Computational Logic, 2017.
[Published Version] View | Files available | DOI | WoS
 
2017 | Published | Journal Article | IST-REx-ID: 466 | OA
K. Chatterjee, Z. Křetínská, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes,” Logical Methods in Computer Science, vol. 13, no. 2. International Federation of Computational Logic, 2017.
[Published Version] View | Files available | DOI | WoS
 
2017 | Published | Journal Article | IST-REx-ID: 467 | OA
K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 4. ACM, 2017.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2017 | Published | Journal Article | IST-REx-ID: 512 | OA
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, “Amplification on undirected population structures: Comets beat stars,” Scientific Reports, vol. 7, no. 1. Nature Publishing Group, 2017.
[Published Version] View | Files available | DOI | WoS
 
2017 | Published | Technical Report | IST-REx-ID: 5455 | OA
K. Chatterjee, B. Choudhary, and A. Pavlogiannis, Optimal Dyck reachability for data-dependence and alias analysis. IST Austria, 2017.
[Published Version] View | Files available | DOI
 
2017 | Published | Technical Report | IST-REx-ID: 5456 | OA
M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, Data-centric dynamic partial order reduction. IST Austria, 2017.
[Published Version] View | Files available | DOI
 
2017 | Published | Conference Paper | IST-REx-ID: 551 | OA
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, “Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.
[Published Version] View | Files available | DOI
 
2017 | Published | Conference Paper | IST-REx-ID: 552 | OA
K. Chatterjee, M. Henzinger, and A. Svozil, “Faster algorithms for mean-payoff parity games,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.
[Published Version] View | Files available | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed