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


2019 | Published | Conference Paper | IST-REx-ID: 6528 | OA
Pietrzak KZ. 2019. Simple verifiable delay functions. 10th Innovations in Theoretical Computer Science Conference. ITCS: Innovations in Theoretical Computer Science, LIPIcs, vol. 124, 60.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

2019 | Published | Conference Paper | IST-REx-ID: 6725 | OA
Kolmogorov V. 2019. Testing the complexity of a valued CSP language. 46th International Colloquium on Automata, Languages and Programming. ICALP: Automata, Languages and Programming, LIPIcs, vol. 132, 77:1-77:12.
[Published Version] View | Files available | DOI | arXiv
 

2018 | Published | Conference Paper | IST-REx-ID: 11827 | OA
Goranci G, Henzinger M, Leniowski D. 2018. A tree structure for dynamic facility location. 26th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 112, 39.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2018 | Published | Conference Paper | IST-REx-ID: 11828 | OA
Goranci G, Henzinger M, Peng P. 2018. Dynamic effective resistances and approximate schur complement on separable graphs. 26th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 112, 40.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2018 | Published | Conference Paper | IST-REx-ID: 11911 | OA
Biedermann S, Henzinger M, Schulz C, Schuster B. 2018. Memetic graph clustering. 17th International Symposium on Experimental Algorithms. SEA: Symposium on Experimental Algorithms, LIPIcs, vol. 103, 3.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2018 | Published | Conference Paper | IST-REx-ID: 133 | OA
Kragl B, Qadeer S, Henzinger TA. 2018. Synchronizing the asynchronous. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 118, 21.
[Published Version] View | Files available | DOI
 

2018 | Published | Conference Paper | IST-REx-ID: 7407 | OA
Pietrzak KZ. 2018. Proofs of catalytic space. 10th Innovations in Theoretical Computer Science Conference. ITCS: Innovations in Theoretical Computer Science, LIPIcs, vol. 124, 59:1-59:25.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

2018 | Published | Conference Paper | IST-REx-ID: 285 | OA
Huszár K, Spreer J, Wagner U. 2018. On the treewidth of triangulated 3-manifolds. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 99, 46.
[Submitted Version] View | Files available | DOI | arXiv
 

2018 | Published | Conference Paper | IST-REx-ID: 6005 | OA
Avni G, Guha S, Kupferman O. 2018. Timed network games with clocks. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 117, 23.
[Published Version] View | Files available | DOI
 

2017 | Published | Conference Paper | IST-REx-ID: 11829 | OA
Henzinger M, Lincoln A, Neumann S, Vassilevska Williams V. 2017. Conditional hardness for sensitivity problems. 8th Innovations in Theoretical Computer Science Conference. ITCS: Innovations in Theoretical Computer Science Conference, LIPIcs, vol. 67, 26.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2017 | Published | Conference Paper | IST-REx-ID: 11831 | OA
Goranci G, Henzinger M, Peng P. 2017. Improved guarantees for vertex sparsification in planar graphs. 25th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 87, 44.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 

2017 | Published | Conference Paper | IST-REx-ID: 11832 | OA
Henzinger M, Leniowski D, Mathieu C. 2017. Dynamic clustering to minimize the sum of radii. 25th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 87, 48.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2017 | Published | Conference Paper | IST-REx-ID: 11833 | OA
Goranci G, Henzinger M, Peng P. 2017. The power of vertex sparsifiers in dynamic graph algorithms. 25th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 87, 45.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2017 | Published | Conference Paper | IST-REx-ID: 1174 | OA
Skórski M. 2017. Lower bounds on key derivation for square-friendly applications. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 66, 57.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 

2017 | Published | Conference Paper | IST-REx-ID: 950 | OA
Avni G, Henzinger TA, Chonev VK. 2017. Infinite-duration bidding games. CONCUR: Concurrency Theory, LIPIcs, vol. 85, 17.
[Published Version] View | Files available | DOI | arXiv
 

2017 | Published | Conference Paper | IST-REx-ID: 688 | OA
Edelsbrunner H, Wagner H. 2017. Topological data analysis with Bregman divergences. Symposium on Computational Geometry, SoCG, LIPIcs, vol. 77, 391–3916.
[Published Version] View | Files available | DOI
 

2017 | Published | Conference Paper | IST-REx-ID: 697 | OA
Pietrzak KZ, Skórski M. 2017. Non uniform attacks against pseudoentropy. ICALP: Automata, Languages and Programming, LIPIcs, vol. 80, 39.
[Published Version] View | Files available | DOI
 

2017 | Published | Conference Paper | IST-REx-ID: 710 | OA
Obremski M, Skórski M. 2017. Renyi entropy estimation revisited. 20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, LIPIcs, vol. 81, 20.
[Published Version] View | Files available | DOI
 

2017 | Published | Conference Paper | IST-REx-ID: 711 | OA
Chatterjee K, Henzinger TA, Otop J. 2017. Bidirectional nested weighted automata. 28th International Conference on Concurrency Theory, CONCUR, LIPIcs, vol. 85, 5.
[Published Version] View | Files available | DOI
 

2017 | Published | Conference Paper | IST-REx-ID: 963 | OA
Avni G, Guha S, Kupferman O. 2017. Timed network games with clocks. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 83, 37.
[Published Version] View | Files available | DOI
 

Filters and Search Terms

issn=1868-8969

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed