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.
9 Publications
2022 | Conference Paper | IST-REx-ID: 11145 | 
Ferber A, Kwan MA, Sauermann L. List-decodability with large radius for Reed-Solomon codes. In: 62nd Annual IEEE Symposium on Foundations of Computer Science. Vol 2022. IEEE; 2022:720-726. doi:10.1109/FOCS52979.2021.00075
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Conference Paper | IST-REx-ID: 12432
Anastos M. Solving the Hamilton cycle problem fast on average. In: 63rd Annual IEEE Symposium on Foundations of Computer Science. Vol 2022-October. Institute of Electrical and Electronics Engineers; 2022:919-930. doi:10.1109/FOCS54457.2022.00091
View
| DOI
| WoS
2014 | Conference Paper | IST-REx-ID: 11855 |
Henzinger MH, Krinninger S, Nanongkai D. Decremental single-source shortest paths on undirected graphs in near-linear total update time. In: 55th Annual Symposium on Foundations of Computer Science. Institute of Electrical and Electronics Engineers; 2014:146-155. doi:10.1109/focs.2014.24
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2013 | Conference Paper | IST-REx-ID: 11856 |
Henzinger MH, Krinninger S, Nanongkai D. Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization. In: 54th Annual Symposium on Foundations of Computer Science. Institute of Electrical and Electronics Engineers; 2013:538-547. doi:10.1109/focs.2013.64
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
1998 | Conference Paper | IST-REx-ID: 11682
Agarwal PK, EppsteinL. J. Guibas D, Henzinger MH. Parametric and kinetic minimum spanning trees. In: Proceedings of the 39th Annual Symposium on Foundations of Computer Science. ; 1998:596-605. doi:10.1109/SFCS.1998.743510
View
| DOI
1995 | Conference Paper | IST-REx-ID: 11684
Henzinger MH, King V. Fully dynamic biconnectivity and transitive closure. In: Proceedings of IEEE 36th Annual Foundations of Computer Science. Institute of Electrical and Electronics Engineers; 1995:664-672. doi:10.1109/SFCS.1995.492668
View
| DOI
1995 | Conference Paper | IST-REx-ID: 4034
Edelsbrunner H. Algebraic decomposition of non-convex polyhedra. In: Proceedings of IEEE 36th Annual Foundations of Computer Science. IEEE; 1995:248-257.
View
| Download None (ext.)
1995 | Conference Paper | IST-REx-ID: 4498
Henzinger MH, Henzinger TA, Kopke P. Computing simulations on finite and infinite graphs. In: Proceedings of IEEE 36th Annual Foundations of Computer Science. IEEE; 1995:453-462. doi:10.1109/SFCS.1995.492576
View
| DOI
1987 | Conference Paper | IST-REx-ID: 3514
Edelsbrunner H, Pach J, Schwartz J, Sharir M. On the lower envelope of bivariate functions and its applications. In: 28th Annual Symposium on Foundations of Computer Science . IEEE; 1987:27-37. doi:10.1109/SFCS.1987.44
View
| DOI
| Download None (ext.)