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.
191 Publications
2022 | Published | Conference Paper | IST-REx-ID: 11775 | 
T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Abstract monitors for quantitative specifications,” in 22nd International Conference on Runtime Verification, Tbilisi, Georgia, 2022, vol. 13498, pp. 200–220.
[Published Version]
View
| Files available
| DOI
| WoS
2022 | Published | Conference Paper | IST-REx-ID: 12171 |
M. Garcia Soto, T. A. Henzinger, and C. Schilling, “Synthesis of parametric hybrid automata from time series,” in 20th International Symposium on Automated Technology for Verification and Analysis, Virtual, 2022, vol. 13505, pp. 337–353.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2022 | Published | Conference Paper | IST-REx-ID: 12175 |
S. Bose, T. A. Henzinger, K. Lehtinen, S. Schewe, and P. Totzke, “History-deterministic timed automata are not determinizable,” in 16th International Conference on Reachability Problems, Kaiserslautern, Germany, 2022, vol. 13608, pp. 67–76.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2022 | Published | Conference Paper | IST-REx-ID: 11707 |
A. Balliu, J. Hirvonen, D. Melnyk, D. Olivetti, J. Rybicki, and J. Suomela, “Local mending,” in International Colloquium on Structural Information and Communication Complexity, Paderborn, Germany, 2022, vol. 13298, pp. 1–20.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Published | Conference Paper | IST-REx-ID: 11355 |
E. Bartocci, T. Ferrere, T. A. Henzinger, D. Nickovic, and A. O. Da Costa, “Information-flow interfaces,” in Fundamental Approaches to Software Engineering, Munich, Germany, 2022, vol. 13241, pp. 3–22.
[Published Version]
View
| Files available
| DOI
| WoS
2022 | Published | Conference Paper | IST-REx-ID: 12000 |
K. Chatterjee, A. K. Goharshady, T. Meggendorfer, and D. Zikelic, “Sound and complete certificates for auantitative termination analysis of probabilistic programs,” in Proceedings of the 34th International Conference on Computer Aided Verification, Haifa, Israel, 2022, vol. 13371, pp. 55–78.
[Published Version]
View
| Files available
| DOI
| WoS
2022 | Published | Conference Paper | IST-REx-ID: 11185 |
A. M. Arroyo Guevara and S. Felsner, “Approximating the bundled crossing number,” in WALCOM 2022: Algorithms and Computation, Jember, Indonesia, 2022, vol. 13174, pp. 383–395.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2022 | Published | Conference Paper | IST-REx-ID: 11476 |
Alwen, Joël, CoCoA: Concurrent continuous group key agreement. Advances in Cryptology – EUROCRYPT 2022 13276. 2022
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
2021 | Published | Conference Paper | IST-REx-ID: 11771 |
M. Henzinger and X. Wu, “Upper and lower bounds for fully retroactive graph problems,” in 17th International Symposium on Algorithms and Data Structures, Virtual, 2021, vol. 12808, pp. 471–484.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Published | Conference Paper | IST-REx-ID: 10324 |
Z. Avarikioti, E. Kokoris Kogias, R. Wattenhofer, and D. Zindros, “Brick: Asynchronous incentive-compatible payment channels,” in 25th International Conference on Financial Cryptography and Data Security, Virtual, 2021, vol. 12675, pp. 209–230.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Published | Conference Paper | IST-REx-ID: 10325 |
A. Zamyatin et al., “SoK: Communication across distributed ledgers,” in 25th International Conference on Financial Cryptography and Data Security, Virtual, 2021, vol. 12675, pp. 3–36.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
2021 | Published | Conference Paper | IST-REx-ID: 9210 |
V. Volhejn and C. Lampert, “Does SGD implicitly optimize for smoothness?,” in 42nd German Conference on Pattern Recognition, Tübingen, Germany, 2021, vol. 12544, pp. 246–259.
[Submitted Version]
View
| Files available
| DOI
2021 | Published | Conference Paper | IST-REx-ID: 9227
A. Bloch-Hansen, N. Samei, and R. Solis-Oba, “Experimental evaluation of a local search approximation algorithm for the multiway cut problem,” in Conference on Algorithms and Discrete Applied Mathematics, Rupnagar, India, 2021, vol. 12601, pp. 346–358.
View
| DOI
2021 | Published | Conference Paper | IST-REx-ID: 18243
J. Hermanns, A. Tsitsulin, M. Munkhoeva, A. M. Bronstein, D. Mottin, and P. Karras, “GRASP: Graph alignment through spectral signatures,” in International Joint Conference on Asia-Pacific Web and Web-Age Information Management, Guangzhou, China, 2021, vol. 12858, no. Part I, pp. 44–52.
View
| DOI
2021 | Published | Conference Paper | IST-REx-ID: 10076 |
Blackshear, Sam, Reactive key-loss protection in blockchains. FC 2021 Workshops 12676 . 2021
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
2021 | Published | Conference Paper | IST-REx-ID: 12767 |
S. Bansal, K. Chatterjee, and M. Y. Vardi, “On satisficing in quantitative games,” in 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Luxembourg City, Luxembourg, 2021, vol. 12651, pp. 20–37.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 | Published | Conference Paper | IST-REx-ID: 10108 |
F. Mühlböck and T. A. Henzinger, “Differential monitoring,” in International Conference on Runtime Verification, Virtual, 2021, vol. 12974, pp. 231–243.
[Preprint]
View
| Files available
| DOI
| WoS
2021 | Published | Conference Paper | IST-REx-ID: 10414 |
K. Chatterjee, E. Goharshady, P. Novotný, J. Zárevúcky, and D. Zikelic, “On lexicographic proof rules for probabilistic termination,” in 24th International Symposium on Formal Methods, Virtual, 2021, vol. 13047, pp. 619–639.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Published | Conference Paper | IST-REx-ID: 9620 |
Alistarh, Dan-Adrian, Collecting coupons is faster with friends. Structural Information and Communication Complexity 12810. 2021
[Preprint]
View
| Files available
| DOI