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, M. A., & Sauermann, L. (2022). List-decodability with large radius for Reed-Solomon codes. In 62nd Annual IEEE Symposium on Foundations of Computer Science (Vol. 2022, pp. 720–726). Denver, CO, United States: IEEE. https://doi.org/10.1109/FOCS52979.2021.00075
[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. In 63rd Annual IEEE Symposium on Foundations of Computer Science (Vol. 2022–October, pp. 919–930). Denver, CO, United States: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/FOCS54457.2022.00091
View | DOI | WoS
 

2014 | Conference Paper | IST-REx-ID: 11855 | OA
Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2014). Decremental single-source shortest paths on undirected graphs in near-linear total update time. In 55th Annual Symposium on Foundations of Computer Science (pp. 146–155). Philadelphia, PA, United States: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/focs.2014.24
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2013 | Conference Paper | IST-REx-ID: 11856 | OA
Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2013). Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization. In 54th Annual Symposium on Foundations of Computer Science (pp. 538–547). Berkeley, CA, United States: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/focs.2013.64
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

1998 | Conference Paper | IST-REx-ID: 11682
Agarwal, P. K., EppsteinL. J. Guibas, D., & Henzinger, M. H. (1998). Parametric and kinetic minimum spanning trees. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science (pp. 596–605). Palo Alto, CA, United States. https://doi.org/10.1109/SFCS.1998.743510
View | DOI
 

1995 | Conference Paper | IST-REx-ID: 11684
Henzinger, M. H., & King, V. (1995). Fully dynamic biconnectivity and transitive closure. In Proceedings of IEEE 36th Annual Foundations of Computer Science (pp. 664–672). Milwaukee, WI, United States: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/SFCS.1995.492668
View | DOI
 

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

1995 | Conference Paper | IST-REx-ID: 4498
Henzinger, M. H., Henzinger, T. A., & Kopke, P. (1995). Computing simulations on finite and infinite graphs. In Proceedings of IEEE 36th Annual Foundations of Computer Science (pp. 453–462). Milwaukee, WI, United States of America: IEEE. https://doi.org/10.1109/SFCS.1995.492576
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. In 28th Annual Symposium on Foundations of Computer Science (pp. 27–37). Los Angeles, CA, USA: IEEE. https://doi.org/10.1109/SFCS.1987.44
View | DOI | Download None (ext.)
 

Filters and Search Terms

issn=0272-5428

Search

Filter Publications