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.
4914 Publications
2017 | Journal Article | IST-REx-ID: 10416 |
Chatterjee K, Choudhary B, Pavlogiannis A. Optimal Dyck reachability for data-dependence and Alias analysis. Proceedings of the ACM on Programming Languages. 2017;2(POPL). doi:10.1145/3158118
[Published Version]
View
| Files available
| DOI
| arXiv
2017 | Technical Report | IST-REx-ID: 5455 |
Chatterjee K, Choudhary B, Pavlogiannis A. Optimal Dyck Reachability for Data-Dependence and Alias Analysis. IST Austria; 2017. doi:10.15479/AT:IST-2017-870-v1-1
[Published Version]
View
| Files available
| DOI
2017 | Report | IST-REx-ID: 5450 |
Petritsch B. Implementing the Institutional Data Repository IST DataRep. IST Austria; 2017.
View
| Files available
| Download (ext.)
2017 | Journal Article | IST-REx-ID: 10417 |
Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. Data-centric dynamic partial order reduction. Proceedings of the ACM on Programming Languages. 2017;2(POPL). doi:10.1145/3158119
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| arXiv
2017 | Technical Report | IST-REx-ID: 5456 |
Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. Data-Centric Dynamic Partial Order Reduction. IST Austria; 2017. doi:10.15479/AT:IST-2017-872-v1-1
[Published Version]
View
| Files available
| DOI
2017 | Conference Paper | IST-REx-ID: 551 |
Chatterjee K, Ibsen-Jensen R, Nowak M. Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. In: Leibniz International Proceedings in Informatics. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.61
[Published Version]
View
| Files available
| DOI
2017 | Conference Paper | IST-REx-ID: 552 |
Chatterjee K, Henzinger MH, Svozil A. Faster algorithms for mean-payoff parity games. In: Leibniz International Proceedings in Informatics. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.39
[Published Version]
View
| Files available
| DOI
2017 | Conference Paper | IST-REx-ID: 553 |
Chatterjee K, Hansen K, Ibsen-Jensen R. Strategy complexity of concurrent safety games. In: Leibniz International Proceedings in Informatics. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.55
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2017 | Journal Article | IST-REx-ID: 560 |
Gerencser M, Jentzen A, Salimova D. On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 2017;473(2207). doi:10.1098/rspa.2017.0104
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Book | IST-REx-ID: 567
Erdös L, Yau H. A Dynamical Approach to Random Matrix Theory. Vol 28. American Mathematical Society; 2017. doi:10.1090/cln/028
View
| DOI