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.
26 Publications
2018 | Journal Article | IST-REx-ID: 5975 | 
Kolmogorov, V. (2018). Commutativity in the algorithmic Lovász local lemma. SIAM Journal on Computing. Society for Industrial & Applied Mathematics (SIAM). https://doi.org/10.1137/16m1093306
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2016 | Journal Article | IST-REx-ID: 11891 |
Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2016). Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization. SIAM Journal on Computing. Society for Industrial & Applied Mathematics. https://doi.org/10.1137/140957299
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2001 | Journal Article | IST-REx-ID: 11892
Henzinger, M. H., & King, V. (2001). Maintaining minimum spanning forests in dynamic graphs. SIAM Journal on Computing. Society for Industrial & Applied Mathematics. https://doi.org/10.1137/s0097539797327209
View
| DOI
2000 | Journal Article | IST-REx-ID: 11694
Albers, S., & Henzinger, M. H. (2000). Exploring unknown environments. SIAM Journal on Computing. El Paso, TX, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/s009753979732428x
View
| DOI
2000 | Journal Article | IST-REx-ID: 11893
Henzinger, M. H. (2000). Improved data structures for fully dynamic biconnectivity. SIAM Journal on Computing. Society for Industrial & Applied Mathematics. https://doi.org/10.1137/s0097539794263907
View
| DOI
1994 | Journal Article | IST-REx-ID: 4033
Chazelle, B., Edelsbrunner, H., Guibas, L., Hershberger, J., Seidel, R., & Sharir, M. (1994). Selecting heavily covered points. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/S0097539790179919
View
| DOI
| Download None (ext.)
1993 | Journal Article | IST-REx-ID: 4041
Edelsbrunner, H., Seidel, R., & Sharir, M. (1993). On the zone theorem for hyperplane arrangements. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/0222031
View
| DOI
| Download None (ext.)
1993 | Journal Article | IST-REx-ID: 4036
Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M., & Snoeyink, J. (1993). Computing a face in an arrangement of line segments and related problems. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/0222077
View
| DOI
| Download None (ext.)
1993 | Journal Article | IST-REx-ID: 4042
Edelsbrunner, H., & Tan, T. (1993). A quadratic time algorithm for the minmax length triangulation. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/0222036
View
| DOI
| Download None (ext.)
1992 | Journal Article | IST-REx-ID: 4043
Edelsbrunner, H., Tan, T., & Waupotitsch, R. (1992). An O(n^2 log n) time algorithm for the MinMax angle triangulation. SIAM Journal on Scientific Computing. Society for Industrial and Applied Mathematics . https://doi.org/10.1137/0913058
View
| DOI
| Download None (ext.)