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.
1752 Publications
2017 | Published | Conference Paper | IST-REx-ID: 1116 | 
G. Avni, S. Goel, T. A. Henzinger, and G. Rodríguez Navas, “Computing scores of forwarding schemes in switched networks with probabilistic faults,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Uppsala, Sweden, 2017, vol. 10206, pp. 169–187.
[Submitted Version]
View
| Files available
| DOI
| WoS
2017 | Published | Journal Article | IST-REx-ID: 465 |
K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation of Computational Logic, 2017.
[Published Version]
View
| Files available
| DOI
2017 | Published | Conference Paper | IST-REx-ID: 631 |
S. Bogomolov, G. Frehse, M. Giacobbe, and T. A. Henzinger, “Counterexample guided refinement of template polyhedra,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Uppsala, Sweden, 2017, vol. 10205, pp. 589–606.
[Submitted Version]
View
| Files available
| DOI
2017 | Published | Book Chapter | IST-REx-ID: 625 |
K. Chatterjee, L. Doyen, and T. A. Henzinger, “The cost of exactness in quantitative reachability,” in Models, Algorithms, Logics and Tools, vol. 10460, L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, and R. Mardare, Eds. Springer, 2017, pp. 367–381.
[Submitted Version]
View
| Files available
| DOI
2017 | Published | Conference Paper | IST-REx-ID: 636 |
A. Bakhirkin, T. Ferrere, O. Maler, and D. Ulus, “On the quantitative semantics of regular expressions over real-valued signals,” presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany, 2017, vol. 10419, pp. 189–206.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Published | Conference Paper | IST-REx-ID: 633
S. Bak, S. Bogomolov, T. A. Henzinger, and A. Kumar, “Challenges and tool implementation of hybrid rapidly exploring random trees,” presented at the NSV: Numerical Software Verification, Heidelberg, Germany, 2017, vol. 10381, pp. 83–89.
View
| DOI
2017 | Published | Conference Paper | IST-REx-ID: 647 |
S. Bogomolov, M. Giacobbe, T. A. Henzinger, and H. Kong, “Conic abstractions for hybrid systems,” presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany, 2017, vol. 10419, pp. 116–132.
[Submitted Version]
View
| Files available
| DOI
2017 | Published | Conference Paper | IST-REx-ID: 11829 |
M. H. Henzinger, A. Lincoln, S. Neumann, and V. Vassilevska Williams, “Conditional hardness for sensitivity problems,” in 8th Innovations in Theoretical Computer Science Conference, Berkley, CA, United States, 2017, vol. 67.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2017 | Published | Conference Paper | IST-REx-ID: 11831 |
G. Goranci, M. H. Henzinger, and P. Peng, “Improved guarantees for vertex sparsification in planar graphs,” in 25th Annual European Symposium on Algorithms, Vienna, Austria, 2017, vol. 87.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| arXiv
2017 | Published | Conference Paper | IST-REx-ID: 11833 |
G. Goranci, M. H. Henzinger, and P. Peng, “The power of vertex sparsifiers in dynamic graph algorithms,” in 25th Annual European Symposium on Algorithms, Vienna, Austria, 2017, vol. 87.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2017 | Published | Conference Paper | IST-REx-ID: 11832 |
M. H. Henzinger, D. Leniowski, and C. Mathieu, “Dynamic clustering to minimize the sum of radii,” in 25th Annual European Symposium on Algorithms, Vienna, Austria, 2017, vol. 87.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2017 | Published | Book Chapter | IST-REx-ID: 424 |
X. Goaoc, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “Bounding helly numbers via betti numbers,” in A Journey through Discrete Mathematics: A Tribute to Jiri Matousek, M. Loebl, J. Nešetřil, and R. Thomas, Eds. Springer, 2017, pp. 407–447.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2017 | Published | Journal Article | IST-REx-ID: 464 |
K. Chatterjee, M. H. Henzinger, and V. Loitzenbauer, “Improved algorithms for parity and Streett objectives,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation of Computational Logic, 2017.
[Published Version]
View
| Files available
| DOI
| arXiv
2017 | Published | Journal Article | IST-REx-ID: 484 |
P. Nam and M. M. Napiórkowski, “Bogoliubov correction to the mean-field dynamics of interacting bosons,” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3. International Press, pp. 683–738, 2017.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Published | Journal Article | IST-REx-ID: 534 |
B. Burton, A. N. de Mesmay, and U. Wagner, “Finding non-orientable surfaces in 3-Manifolds,” Discrete & Computational Geometry, vol. 58, no. 4. Springer, pp. 871–888, 2017.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2017 | Published | Conference Paper | IST-REx-ID: 559 |
H. M. Abusalah, J. F. Alwen, B. Cohen, D. Khilko, K. Z. Pietrzak, and L. Reyzin, “Beyond Hellman’s time-memory trade-offs with applications to proofs of space,” presented at the ASIACRYPT: Theory and Applications of Cryptology and Information Security, Hong Kong, China, 2017, vol. 10625, pp. 357–379.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2017 | Published | Journal Article | IST-REx-ID: 560 |
M. Gerencser, A. Jentzen, and D. Salimova, “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, vol. 473, no. 2207. Royal Society of London, 2017.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)