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, Asaf, Matthew Alan Kwan, and Lisa Sauermann. “List-Decodability with Large Radius for Reed-Solomon Codes.” In 62nd Annual IEEE Symposium on Foundations of Computer Science, 2022:720–26. IEEE, 2022. 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, Michael. “Solving the Hamilton Cycle Problem Fast on Average.” In 63rd Annual IEEE Symposium on Foundations of Computer Science, 2022–October:919–30. Institute of Electrical and Electronics Engineers, 2022. https://doi.org/10.1109/FOCS54457.2022.00091.
View
| DOI
| WoS
2014 | Conference Paper | IST-REx-ID: 11855 |
Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Decremental Single-Source Shortest Paths on Undirected Graphs in near-Linear Total Update Time.” In 55th Annual Symposium on Foundations of Computer Science, 146–55. Institute of Electrical and Electronics Engineers, 2014. https://doi.org/10.1109/focs.2014.24.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2013 | Conference Paper | IST-REx-ID: 11856 |
Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(Mn) Barrier and Derandomization.” In 54th Annual Symposium on Foundations of Computer Science, 538–47. Institute of Electrical and Electronics Engineers, 2013. 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., D. EppsteinL. J. Guibas, and Monika H Henzinger. “Parametric and Kinetic Minimum Spanning Trees.” In Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 596–605, 1998. https://doi.org/10.1109/SFCS.1998.743510.
View
| DOI
1995 | Conference Paper | IST-REx-ID: 11684
Henzinger, Monika H, and V. King. “Fully Dynamic Biconnectivity and Transitive Closure.” In Proceedings of IEEE 36th Annual Foundations of Computer Science, 664–72. Institute of Electrical and Electronics Engineers, 1995. https://doi.org/10.1109/SFCS.1995.492668.
View
| DOI
1995 | Conference Paper | IST-REx-ID: 4034
Edelsbrunner, Herbert. “Algebraic Decomposition of Non-Convex Polyhedra.” In Proceedings of IEEE 36th Annual Foundations of Computer Science, 248–57. IEEE, 1995.
View
| Download None (ext.)
1995 | Conference Paper | IST-REx-ID: 4498
Henzinger, Monika H, Thomas A Henzinger, and Peter Kopke. “Computing Simulations on Finite and Infinite Graphs.” In Proceedings of IEEE 36th Annual Foundations of Computer Science, 453–62. IEEE, 1995. https://doi.org/10.1109/SFCS.1995.492576.
View
| DOI
1987 | Conference Paper | IST-REx-ID: 3514
Edelsbrunner, Herbert, János Pach, Jacob Schwartz, and Micha Sharir. “On the Lower Envelope of Bivariate Functions and Its Applications.” In 28th Annual Symposium on Foundations of Computer Science , 27–37. IEEE, 1987. https://doi.org/10.1109/SFCS.1987.44.
View
| DOI
| Download None (ext.)