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
M. Huang, H. Fu, and K. Chatterjee, “New approaches for almost-sure termination of probabilistic programs,” presented at the 16th Asian Symposium on Programming Languages and Systems, APLAS, Wellington, New Zealand, 2018, vol. 11275, pp. 181–201.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2018 | Published | Book Chapter | IST-REx-ID: 86 | OA
K. Chatterjee, T. A. Henzinger, and J. Otop, “Computing average response time,” in Principles of Modeling, vol. 10760, M. Lohstroh, P. Derler, and M. Sirjani, Eds. Springer, 2018, pp. 143–161.
[Submitted Version] View | Files available | DOI
 

2018 | Published | Conference Paper | IST-REx-ID: 5977 | OA
K. Chatterjee, H. Fu, A. K. Goharshady, and N. Okati, “Computational approaches for stochastic shortest path on succinct MDPs,” in Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018, pp. 4700–4707.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

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

2018 | Published | Conference Paper | IST-REx-ID: 66 | OA
K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and Y. Velner, “Ergodic mean-payoff games for the analysis of attacks in crypto-currencies,” presented at the CONCUR: Conference on Concurrency Theory, Beijing, China, 2018, vol. 118.
[Published Version] View | Files available | DOI | arXiv
 

2018 | Published | Conference Paper | IST-REx-ID: 6340 | OA
A. K. Goharshady, A. Behrouz, and K. Chatterjee, “Secure Credit Reporting on the Blockchain,” in Proceedings of the IEEE International Conference on Blockchain, Halifax, Canada, 2018, pp. 1343–1348.
[Submitted Version] View | Files available | DOI | WoS | arXiv
 

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

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

2018 | Published | Journal Article | IST-REx-ID: 2 | OA
C. Hilbe, L. Schmid, J. Tkadlec, K. Chatterjee, and M. Nowak, “Indirect reciprocity with private, noisy, and incomplete information,” PNAS, vol. 115, no. 48. National Academy of Sciences, pp. 12241–12246, 2018.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | PubMed | Europe PMC
 

2018 | Published | Conference Paper | IST-REx-ID: 141 | OA
K. Chatterjee, M. H. Henzinger, V. Loitzenbauer, S. Oraee, and V. Toman, “Symbolic algorithms for graphs and Markov decision processes with fairness objectives,” presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10982, pp. 178–197.
[Published Version] View | Files available | DOI | WoS
 

2018 | Published | Book | IST-REx-ID: 3300
E. M. Clarke, T. A. Henzinger, H. Veith, and R. Bloem, Handbook of Model Checking, 1st ed. Cham: Springer Nature, 2018.
View | DOI
 

2017 | Published | Journal Article | IST-REx-ID: 256 | OA
T. D. Browning and S. Prendiville, “Improvements in Birch’s theorem on forms in many variables,” Journal fur die Reine und Angewandte Mathematik, vol. 2017, no. 731. Walter de Gruyter, p. 122, 2017.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2017 | Published | Journal Article | IST-REx-ID: 265 | OA
T. D. Browning and P. Vishe, “Rational curves on smooth hypersurfaces of low degree,” Geometric Methods in Algebra and Number Theory, vol. 11, no. 7. Mathematical Sciences Publishers, pp. 1657–1675, 2017.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2017 | Published | Journal Article | IST-REx-ID: 266 | OA
T. D. Browning and R. Heath Brown, “Forms in many variables and differing degrees,” Journal of the European Mathematical Society, vol. 19, no. 2. European Mathematical Society Publishing House, pp. 357–394, 2017.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2017 | Published | Journal Article | IST-REx-ID: 267 | OA
T. D. Browning, “Many cubic surfaces contain rational points,” Mathematika, vol. 63, no. 3. Cambridge University Press, pp. 818–839, 2017.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2017 | Published | Journal Article | IST-REx-ID: 268 | OA
T. D. Browning and S. Prendiville, “A transference approach to a Roth-type theorem in the squares,” International Mathematics Research Notices, vol. 2017, no. 7. Oxford University Press, pp. 2219–2248, 2017.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2017 | Published | Journal Article | IST-REx-ID: 269 | OA
T. D. Browning and D. Loughran, “Varieties with too many rational points,” Mathematische Zeitschrift, vol. 285, no. 3–4. Springer, pp. 1249–1267, 2017.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2017 | Published | Journal Article | IST-REx-ID: 270 | OA
T. D. Browning and A. Gorodnik, “Power-free values of polynomials on symmetric varieties,” Proceedings of the London Mathematical Society, vol. 114, no. 6. Wiley, pp. 1044–1080, 2017.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2017 | Published | Journal Article | IST-REx-ID: 272 | OA
T. D. Browning and L. Matthiesen, “Norm forms for arbitrary number fields as products of linear polynomials,” Annales Scientifiques de l’Ecole Normale Superieure, vol. 50, no. 6. Societe Mathematique de France, pp. 1383–1446, 2017.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

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

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed