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 | OA
Ferber A, Kwan MA, Sauermann L. 2022. List-decodability with large radius for Reed-Solomon codes. 62nd Annual IEEE Symposium on Foundations of Computer Science. FOCS: Symposium on Foundations of Computer Science vol. 2022, 720–726.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2022 | Conference Paper | IST-REx-ID: 12432
Anastos M. 2022. Solving the Hamilton cycle problem fast on average. 63rd Annual IEEE Symposium on Foundations of Computer Science. FOCS: Symposium on Foundations of Computer Science vol. 2022–October, 919–930.
View | DOI | WoS
 

2014 | Conference Paper | IST-REx-ID: 11855 | OA
Henzinger MH, Krinninger S, Nanongkai D. 2014. Decremental single-source shortest paths on undirected graphs in near-linear total update time. 55th Annual Symposium on Foundations of Computer Science. FOCS: Annual Symposium on Foundations of Computer Science, 146–155.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2013 | Conference Paper | IST-REx-ID: 11856 | OA
Henzinger MH, Krinninger S, Nanongkai D. 2013. Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization. 54th Annual Symposium on Foundations of Computer Science. FOCS: Symposium on Foundations of Computer Science, 538–547.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

1998 | Conference Paper | IST-REx-ID: 11682
Agarwal PK, EppsteinL. J. Guibas D, Henzinger MH. 1998. Parametric and kinetic minimum spanning trees. Proceedings of the 39th Annual Symposium on Foundations of Computer Science. Annual IEEE Symposium on Foundations of Computer Science, 596–605.
View | DOI
 

1995 | Conference Paper | IST-REx-ID: 11684
Henzinger MH, King V. 1995. Fully dynamic biconnectivity and transitive closure. Proceedings of IEEE 36th Annual Foundations of Computer Science. Foundations of Computer Science, 664–672.
View | DOI
 

1995 | Conference Paper | IST-REx-ID: 4034
Edelsbrunner H. 1995. Algebraic decomposition of non-convex polyhedra. Proceedings of IEEE 36th Annual Foundations of Computer Science. FOCS: Foundations of Computer Science, 248–257.
View | Download None (ext.)
 

1995 | Conference Paper | IST-REx-ID: 4498
Henzinger MH, Henzinger TA, Kopke P. 1995. Computing simulations on finite and infinite graphs. Proceedings of IEEE 36th Annual Foundations of Computer Science. FOCS: Foundations of Computer Science, 453–462.
View | DOI
 

1987 | Conference Paper | IST-REx-ID: 3514
Edelsbrunner H, Pach J, Schwartz J, Sharir M. 1987. On the lower envelope of bivariate functions and its applications. 28th Annual Symposium on Foundations of Computer Science . FOCS: Foundations of Computer Science, 27–37.
View | DOI | Download None (ext.)
 

Filters and Search Terms

issn=0272-5428

Search

Filter Publications