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.
7006 Publications
2019 |Published| Conference Paper | IST-REx-ID: 6056 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, A. K. Goharshady, and A. Pourdamghani, “Probabilistic smart contracts: Secure randomness on the blockchain,” in IEEE International Conference on Blockchain and Cryptocurrency, Seoul, Korea, 2019.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 6378 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, A. K. Goharshady, and A. Pourdamghani, “Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving,” in Proceedings of the 34th ACM Symposium on Applied Computing, Limassol, Cyprus, 2019, vol. Part F147772, pp. 374–381.
[Submitted Version]
View
| Files available
| DOI
| WoS
2019 |Published| Conference Paper | IST-REx-ID: 6175 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
P. Wang, H. Fu, A. K. Goharshady, K. Chatterjee, X. Qin, and W. Shi, “Cost analysis of nondeterministic probabilistic programs,” in PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, Phoenix, AZ, United States, 2019, pp. 204–220.
[Submitted Version]
View
| Files available
| DOI
| WoS
| arXiv
2019 |Published| Journal Article | IST-REx-ID: 7158 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, A. K. Goharshady, P. Goyal, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth,” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4. ACM, 2019.
[Submitted Version]
View
| Files available
| DOI
| WoS
2019 |Published| Journal Article | IST-REx-ID: 7014 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, H. Fu, and A. K. Goharshady, “Non-polynomial worst-case analysis of recursive programs,” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4. ACM, 2019.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 6490 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, A. K. Goharshady, and E. K. Goharshady, “The treewidth of smart contracts,” in Proceedings of the 34th ACM Symposium on Applied Computing, Limassol, Cyprus, 2019, vol. Part F147772, pp. 400–408.
[Submitted Version]
View
| Files available
| DOI
| WoS
2018 |Published| Conference Paper | IST-REx-ID: 10883 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, W. Dvořák, M. H. Henzinger, and A. Svozil, “Quasipolynomial set-based symbolic algorithms for parity games,” in 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Awassa, Ethiopia, 2018, vol. 57, pp. 233–253.
[Published Version]
View
| Files available
| DOI
| arXiv
2018 |Published| Journal Article | IST-REx-ID: 1092 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
F. Mohammadi, C. Uhler, C. Wang, and J. Yu, “Generalized permutohedra from probabilistic graphical models,” SIAM Journal on Discrete Mathematics, vol. 32, no. 1. SIAM, pp. 64–93, 2018.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2018 |Published| Conference Paper | IST-REx-ID: 11 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
N. K. Leopold and P. Pickl, “Mean-field limits of particles in interaction with quantised radiation fields,” presented at the MaLiQS: Macroscopic Limits of Quantum Systems, Munich, Germany, 2018, vol. 270, pp. 185–214.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 |Published| Journal Article | IST-REx-ID: 1215 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
F. Flandoli, F. Russo, and G. A. Zanco, “Infinite-dimensional calculus under weak spatial regularity of the processes,” Journal of Theoretical Probability, vol. 31, no. 2. Springer, pp. 789–826, 2018.
[Published Version]
View
| Files available
| DOI
2018 |Published| Journal Article | IST-REx-ID: 176 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
T. D. Browning and E. Sofos, “Averages of arithmetic functions over principal ideals,” International Journal of Nuber Theory, vol. 15, no. 3. World Scientific Publishing, pp. 547–567, 2018.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 |Published| Journal Article | IST-REx-ID: 178 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
T. D. Browning and R. Heath-Brown, “Counting rational points on quadric surfaces,” Discrete Analysis, vol. 15. Alliance of Diamond Open Access Journals, pp. 1–29, 2018.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 |Published| Conference Paper | IST-REx-ID: 185 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
R. Fulek and J. Kynčl, “Hanani-Tutte for approximating maps of graphs,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99.
[Published Version]
View
| Files available
| DOI
2018 |Published| Conference Paper | IST-REx-ID: 188 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
H. Edelsbrunner, Z. Virk, and H. Wagner, “Smallest enclosing spheres and Chernoff points in Bregman geometry,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99, p. 35:1-35:13.
[Published Version]
View
| Files available
| DOI
2018 |Published| Journal Article | IST-REx-ID: 2015 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
G. Raskutti and C. Uhler, “Learning directed acyclic graphs based on sparsest permutations,” STAT, vol. 7, no. 1. Wiley, 2018.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv