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.

8915 Publications


2018 | Conference Paper | IST-REx-ID: 5679 | OA
Huang, M., Fu, H., & Chatterjee, K. (2018). New approaches for almost-sure termination of probabilistic programs. In S. Ryu (Ed.) (Vol. 11275, pp. 181–201). Presented at the 16th Asian Symposium on Programming Languages and Systems, APLAS, Wellington, New Zealand: Springer. https://doi.org/10.1007/978-3-030-02768-1_11
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2018 | Published | Book Chapter | IST-REx-ID: 86 | OA
Chatterjee, K., Henzinger, T. A., & Otop, J. (2018). Computing average response time. In M. Lohstroh, P. Derler, & M. Sirjani (Eds.), Principles of Modeling (Vol. 10760, pp. 143–161). Springer. https://doi.org/10.1007/978-3-319-95246-8_9
[Submitted Version] View | Files available | DOI
 

2018 | Published | Conference Paper | IST-REx-ID: 5977 | OA
Chatterjee, K., Fu, H., Goharshady, A. K., & Okati, N. (2018). Computational approaches for stochastic shortest path on succinct MDPs. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (Vol. 2018, pp. 4700–4707). Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/653
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2018 | Published | Technical Report | IST-REx-ID: 5457 | OA
Anonymous, 1, Anonymous, 2, Anonymous, 3, Anonymous, 4, Anonymous, 5, & Anonymous, 6. (2018). Cost analysis of nondeterministic probabilistic programs. IST Austria.
[Published Version] View | Files available
 

2018 | Published | Conference Paper | IST-REx-ID: 66 | OA
Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., & Velner, Y. (2018). Ergodic mean-payoff games for the analysis of attacks in crypto-currencies (Vol. 118). Presented at the CONCUR: Conference on Concurrency Theory, Beijing, China: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2018.11
[Published Version] View | Files available | DOI | arXiv
 

2018 | Published | Conference Paper | IST-REx-ID: 6340 | OA
Goharshady, A. K., Behrouz, A., & Chatterjee, K. (2018). Secure Credit Reporting on the Blockchain. In Proceedings of the IEEE International Conference on Blockchain (pp. 1343–1348). Halifax, Canada: IEEE. https://doi.org/10.1109/Cybermatics_2018.2018.00231
[Submitted Version] View | Files available | DOI | WoS | arXiv
 

2018 | Published | Conference Paper | IST-REx-ID: 143 | OA
Brázdil, T., Chatterjee, K., Kučera, A., Novotný, P., Velan, D., & Zuleger, F. (2018). Efficient algorithms for asymptotic bounds on termination time in VASS (Vol. F138033, pp. 185–194). Presented at the LICS: Logic in Computer Science, Oxford, United Kingdom: IEEE. https://doi.org/10.1145/3209108.3209191
[Preprint] View | DOI | Download Preprint (ext.) | WoS
 

2018 | Published | Conference Paper | IST-REx-ID: 24 | OA
Chatterjee, K., Elgyütt, A., Novotný, P., & Rouillé, O. (2018). Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives (Vol. 2018, pp. 4692–4699). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/652
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2018 | Published | Journal Article | IST-REx-ID: 2 | OA
Hilbe, C., Schmid, L., Tkadlec, J., Chatterjee, K., & Nowak, M. (2018). Indirect reciprocity with private, noisy, and incomplete information. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1810565115
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | PubMed | Europe PMC
 

2018 | Published | Conference Paper | IST-REx-ID: 141 | OA
Chatterjee, K., Henzinger, M. H., Loitzenbauer, V., Oraee, S., & Toman, V. (2018). Symbolic algorithms for graphs and Markov decision processes with fairness objectives (Vol. 10982, pp. 178–197). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer. https://doi.org/10.1007/978-3-319-96142-2_13
[Published Version] View | Files available | DOI | WoS
 

2018 | Published | Book | IST-REx-ID: 3300
Clarke, E. M., Henzinger, T. A., Veith, H., & Bloem, R. (2018). Handbook of Model Checking (1st ed.). Cham: Springer Nature. https://doi.org/10.1007/978-3-319-10575-8
View | DOI
 

2017 | Published | Journal Article | IST-REx-ID: 256 | OA
Browning, T. D., & Prendiville, S. (2017). Improvements in Birch’s theorem on forms in many variables. Journal Fur Die Reine Und Angewandte Mathematik. Walter de Gruyter. https://doi.org/10.1515/crelle-2014-0122
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2017 | Published | Journal Article | IST-REx-ID: 265 | OA
Browning, T. D., & Vishe, P. (2017). Rational curves on smooth hypersurfaces of low degree. Geometric Methods in Algebra and Number Theory. Mathematical Sciences Publishers. https://doi.org/10.2140/ant.2017.11.1657
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2017 | Published | Journal Article | IST-REx-ID: 266 | OA
Browning, T. D., & Heath Brown, R. (2017). Forms in many variables and differing degrees. Journal of the European Mathematical Society. European Mathematical Society Publishing House. https://doi.org/10.4171/JEMS/668
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2017 | Published | Journal Article | IST-REx-ID: 267 | OA
Browning, T. D. (2017). Many cubic surfaces contain rational points. Mathematika. Cambridge University Press. https://doi.org/10.1112/S0025579317000195
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2017 | Published | Journal Article | IST-REx-ID: 268 | OA
Browning, T. D., & Prendiville, S. (2017). A transference approach to a Roth-type theorem in the squares. International Mathematics Research Notices. Oxford University Press. https://doi.org/10.1093/imrn/rnw096
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2017 | Published | Journal Article | IST-REx-ID: 269 | OA
Browning, T. D., & Loughran, D. (2017). Varieties with too many rational points. Mathematische Zeitschrift. Springer. https://doi.org/10.1007/s00209-016-1746-2
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2017 | Published | Journal Article | IST-REx-ID: 270 | OA
Browning, T. D., & Gorodnik, A. (2017). Power-free values of polynomials on symmetric varieties. Proceedings of the London Mathematical Society. Wiley. https://doi.org/10.1112/plms.12030
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2017 | Published | Journal Article | IST-REx-ID: 272 | OA
Browning, T. D., & Matthiesen, L. (2017). Norm forms for arbitrary number fields as products of linear polynomials. Annales Scientifiques de l’Ecole Normale Superieure. Societe Mathematique de France. https://doi.org/10.24033/asens.2348
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Published | Conference Paper | IST-REx-ID: 274 | OA
Kolmogorov, V. (2017). A faster approximation algorithm for the Gibbs partition function. In Proceedings of the 31st Conference On Learning Theory (Vol. 75, pp. 228–249). ML Research Press.
[Published Version] View | Files available | arXiv
 

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed