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.
137 Publications
2022 | Conference Paper | IST-REx-ID: 12176 | 
Hoffmann C, Hubáček P, Kamath C, Klein K, Pietrzak KZ. 2022. Practical statistically-sound proofs of exponentiation in any group. Advances in Cryptology – CRYPTO 2022. CRYYPTO: International Cryptology Conference, LNCS, vol. 13508, 370–399.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
2022 | Conference Paper | IST-REx-ID: 12298 |
Gelashvili R, Kokoris Kogias E, Sonnino A, Spiegelman A, Xiang Z. 2022. Jolteon and ditto: Network-adaptive efficient consensus with asynchronous fallback. Financial Cryptography and Data Security. FC: Financial Cryptography, LNCS, vol. 13411, 296–315.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2022 | Conference Paper | IST-REx-ID: 12168 |
Cohen S, Gelashvili R, Kokoris Kogias E, Li Z, Malkhi D, Sonnino A, Spiegelman A. 2022. Be aware of your leaders. International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography and Data Security, LNCS, vol. 13411, 279–295.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2022 | Conference Paper | IST-REx-ID: 12170
Meggendorfer T. 2022. PET – A partial exploration tool for probabilistic verification. 20th International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 13505, 320–326.
View
| DOI
2022 | Conference Paper | IST-REx-ID: 12175 |
Bose S, Henzinger TA, Lehtinen K, Schewe S, Totzke P. 2022. History-deterministic timed automata are not determinizable. 16th International Conference on Reachability Problems. RC: Reachability Problems, LNCS, vol. 13608, 67–76.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2022 | Conference Paper | IST-REx-ID: 11185 |
Arroyo Guevara AM, Felsner S. 2022. Approximating the bundled crossing number. WALCOM 2022: Algorithms and Computation. WALCOM: Algorithms and ComputationLNCS vol. 13174, 383–395.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2022 | Conference Paper | IST-REx-ID: 12000 |
Chatterjee K, Goharshady AK, Meggendorfer T, Zikelic D. 2022. Sound and complete certificates for auantitative termination analysis of probabilistic programs. Proceedings of the 34th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13371, 55–78.
[Published Version]
View
| Files available
| DOI
| WoS
2021 | Conference Paper | IST-REx-ID: 11771 |
Henzinger MH, Wu X. 2021. Upper and lower bounds for fully retroactive graph problems. 17th International Symposium on Algorithms and Data Structures. WADS: Workshop on Algorithms and Data Structures, LNCS, vol. 12808, 471–484.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Conference Paper | IST-REx-ID: 9210 |
Volhejn V, Lampert C. 2021. Does SGD implicitly optimize for smoothness? 42nd German Conference on Pattern Recognition. DAGM GCPR: German Conference on Pattern Recognition LNCS vol. 12544, 246–259.
[Submitted Version]
View
| Files available
| DOI
2021 | Conference Paper | IST-REx-ID: 9620 |
Alistarh D-A, Davies P. 2021. Collecting coupons is faster with friends. Structural Information and Communication Complexity. SIROCCO: International Colloquium on Structural Information and Communication Complexity, LNCS, vol. 12810, 3–12.
[Preprint]
View
| Files available
| DOI