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.

107 Publications


2022 | Conference Paper | IST-REx-ID: 12298 | OA
R. Gelashvili, E. Kokoris Kogias, A. Sonnino, A. Spiegelman, and Z. Xiang, “Jolteon and ditto: Network-adaptive efficient consensus with asynchronous fallback,” in Financial Cryptography and Data Security, Radisson Grenada Beach Resort, Grenada, 2022, vol. 13411, pp. 296–315.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2022 | Conference Paper | IST-REx-ID: 12168 | OA
S. Cohen et al., “Be aware of your leaders,” in International Conference on Financial Cryptography and Data Security, Grenada, 2022, vol. 13411, pp. 279–295.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2022 | Conference Paper | IST-REx-ID: 12170
T. Meggendorfer, “PET – A partial exploration tool for probabilistic verification,” in 20th International Symposium on Automated Technology for Verification and Analysis, Virtual, 2022, vol. 13505, pp. 320–326.
View | DOI
 

2022 | Conference Paper | IST-REx-ID: 12175 | OA
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 | Conference Paper | IST-REx-ID: 11185 | OA
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 | Conference Paper | IST-REx-ID: 12000 | OA
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
 

2021 | Conference Paper | IST-REx-ID: 11771 | OA
M. H. 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 | Conference Paper | IST-REx-ID: 9210 | OA
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 | Conference Paper | IST-REx-ID: 9620 | OA
D.-A. Alistarh and P. Davies, “Collecting coupons is faster with friends,” in Structural Information and Communication Complexity, Wrocław, Poland, 2021, vol. 12810, pp. 3–12.
[Preprint] View | Files available | DOI
 

2021 | Conference Paper | IST-REx-ID: 12767 | OA
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
 

Filters and Search Terms

eissn=1611-3349

Search

Filter Publications