Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
5750 Publications
2017 | Journal Article | IST-REx-ID: 10416 | 
Chatterjee, K., Choudhary, B., & Pavlogiannis, A. (2017). Optimal Dyck reachability for data-dependence and Alias analysis. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3158118
[Published Version]
View
| Files available
| DOI
| arXiv
2017 | Technical Report | IST-REx-ID: 5455 |
Chatterjee, K., Choudhary, B., & Pavlogiannis, A. (2017). Optimal Dyck reachability for data-dependence and alias analysis. IST Austria. https://doi.org/10.15479/AT:IST-2017-870-v1-1
[Published Version]
View
| Files available
| DOI
2017 | Report | IST-REx-ID: 5450 |
Petritsch, B. (2017). Implementing the institutional data repository IST DataRep. IST Austria.
View
| Files available
| Download (ext.)
2017 | Journal Article | IST-REx-ID: 10417 |
Chalupa, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., & Vaidya, K. (2017). Data-centric dynamic partial order reduction. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery. https://doi.org/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. (2017). Data-centric dynamic partial order reduction. IST Austria. https://doi.org/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. (2017). Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.61
[Published Version]
View
| Files available
| DOI
2017 | Conference Paper | IST-REx-ID: 552 |
Chatterjee, K., Henzinger, M. H., & Svozil, A. (2017). Faster algorithms for mean-payoff parity games. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/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. (2017). Strategy complexity of concurrent safety games. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/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. (2017). 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. Royal Society of London. https://doi.org/10.1098/rspa.2017.0104
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Journal Article | IST-REx-ID: 568 |
Franek, P., & Krcál, M. (2017). Persistence of zero sets. Homology, Homotopy and Applications. International Press. https://doi.org/10.4310/HHA.2017.v19.n2.a16
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)