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.
1921 Publications
2018 | Published | Journal Article | IST-REx-ID: 312 | 
H. Edelsbrunner and M. Iglesias Ham, “On the optimality of the FCC lattice for soft sphere packing,” SIAM J Discrete Math, vol. 32, no. 1. Society for Industrial and Applied Mathematics , pp. 750–782, 2018.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2018 | Published | Conference Paper | IST-REx-ID: 10883 |
Chatterjee, Krishnendu, Quasipolynomial set-based symbolic algorithms for parity games. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning 57. 2018
[Published Version]
View
| Files available
| DOI
| arXiv
2018 | Draft | Preprint | IST-REx-ID: 6183 |
J. Alt, L. Erdös, and T. H. Krüger, “The Dyson equation with linear self-energy: Spectral bands, edges and cusps,” arXiv. .
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Published | Journal Article | IST-REx-ID: 70 |
P. Nejjar, “Transition to shocks in TASEP and decoupling of last passage times,” Latin American Journal of Probability and Mathematical Statistics, vol. 15, no. 2. Instituto Nacional de Matematica Pura e Aplicada, pp. 1311–1334, 2018.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2018 | Published | Journal Article | IST-REx-ID: 690 |
J. Lee and K. Schnelli, “Local law and Tracy–Widom limit for sparse random matrices,” Probability Theory and Related Fields, vol. 171, no. 1–2. Springer, 2018.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Published | Technical Report | IST-REx-ID: 5457 |
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 | Conference Paper | IST-REx-ID: 5679 |
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 | Conference Paper | IST-REx-ID: 142 |
H. Kong, E. Bartocci, and T. A. Henzinger, “Reachable set over-approximation for nonlinear systems using piecewise barrier tubes,” presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10981, pp. 449–467.
[Published Version]
View
| Files available
| DOI
| WoS
2018 | Published | Conference Paper | IST-REx-ID: 78 |
A. Bakhirkin, T. Ferrere, D. Nickovic, O. Maler, and E. Asarin, “Online timed pattern matching using automata,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Bejing, China, 2018, vol. 11022, pp. 215–232.
[Submitted Version]
View
| Files available
| DOI
| WoS
2018 | Published | Conference Paper | IST-REx-ID: 160 |
B. Kragl and S. Qadeer, “Layered Concurrent Programs,” presented at the CAV: Computer Aided Verification, Oxford, UK, 2018, vol. 10981, pp. 79–102.
[Published Version]
View
| Files available
| DOI
| WoS
2018 | Published | Conference Paper | IST-REx-ID: 156 |
Ferrere, Thomas, The compound interest in relaxing punctuality. 10951. 2018
[Submitted Version]
View
| Files available
| DOI
| WoS
2018 | Published | Conference Paper | IST-REx-ID: 140 |
G. Frehse, M. Giacobbe, and T. A. Henzinger, “Space-time interpolants,” presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10981, pp. 468–486.
[Published Version]
View
| Files available
| DOI
| WoS
2018 | Conference Paper | IST-REx-ID: 5788 |
G. Avni, T. A. Henzinger, and R. Ibsen-Jensen, “Infinite-duration poorman-bidding games,” presented at the 14th International Conference on Web and Internet Economics, WINE, Oxford, UK, 2018, vol. 11316, pp. 21–36.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Published | Conference Paper | IST-REx-ID: 25 |
K. Horák, B. Bošanský, and K. Chatterjee, “Goal-HSVI: Heuristic search value iteration for goal-POMDPs,” in Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018–July, pp. 4764–4770.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
2018 | Published | Conference Paper | IST-REx-ID: 297 |
T. Brázdil, K. Chatterjee, J. Kretinsky, and V. Toman, “Strategy representation by decision trees in reactive synthesis,” presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece, 2018, vol. 10805, pp. 385–407.
[Published Version]
View
| Files available
| DOI
| WoS
2018 | Published | Book Chapter | IST-REx-ID: 86 |
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: 141 |
K. Chatterjee, M. 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 | Journal Article | IST-REx-ID: 738 |
K. Chatterjee, A. Pavlogiannis, A. Kößler, and U. Schmid, “Automated competitive analysis of real time scheduling with graph games,” Real-Time Systems, vol. 54, no. 1. Springer, pp. 166–207, 2018.
[Published Version]
View
| Files available
| DOI
| WoS
2018 | Published | Conference Paper | IST-REx-ID: 302 |
B. Cohen and K. Z. Pietrzak, “Simple proofs of sequential work,” presented at the Eurocrypt: Advances in Cryptology, Tel Aviv, Israel, 2018, vol. 10821, pp. 451–467.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS