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, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.” SIAM Journal on Computing, vol. 47, no. 6, Society for Industrial & Applied Mathematics (SIAM), 2018, pp. 2029–56, doi:10.1137/16m1093306.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2016 | Journal Article | IST-REx-ID: 11891 |
Henzinger, Monika H., et al. “Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(Mn) Barrier and Derandomization.” SIAM Journal on Computing, vol. 45, no. 3, Society for Industrial & Applied Mathematics, 2016, pp. 947–1006, doi:10.1137/140957299.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2001 | Journal Article | IST-REx-ID: 11892
Henzinger, Monika H., and Valerie King. “Maintaining Minimum Spanning Forests in Dynamic Graphs.” SIAM Journal on Computing, vol. 31, no. 2, Society for Industrial & Applied Mathematics, 2001, pp. 364–74, doi:10.1137/s0097539797327209.
View
| DOI
2000 | Journal Article | IST-REx-ID: 11694
Albers, Susanne, and Monika H. Henzinger. “Exploring Unknown Environments.” SIAM Journal on Computing, vol. 29, no. 4, Society for Industrial and Applied Mathematics, 2000, pp. 1164–88, doi:10.1137/s009753979732428x.
View
| DOI
2000 | Journal Article | IST-REx-ID: 11893
Henzinger, Monika H. “Improved Data Structures for Fully Dynamic Biconnectivity.” SIAM Journal on Computing, vol. 29, no. 6, Society for Industrial & Applied Mathematics, 2000, pp. 1761–815, doi:10.1137/s0097539794263907.
View
| DOI
1994 | Journal Article | IST-REx-ID: 4033
Chazelle, Bernard, et al. “Selecting Heavily Covered Points.” SIAM Journal on Computing, vol. 23, no. 6, SIAM, 1994, pp. 1138–51, doi:10.1137/S0097539790179919 .
View
| DOI
| Download None (ext.)
1993 | Journal Article | IST-REx-ID: 4041
Edelsbrunner, Herbert, et al. “On the Zone Theorem for Hyperplane Arrangements.” SIAM Journal on Computing, vol. 22, no. 2, SIAM, 1993, pp. 418–29, doi:10.1137/0222031.
View
| DOI
| Download None (ext.)
1993 | Journal Article | IST-REx-ID: 4036
Chazelle, Bernard, et al. “Computing a Face in an Arrangement of Line Segments and Related Problems.” SIAM Journal on Computing, vol. 22, no. 6, SIAM, 1993, pp. 1286–302, doi:10.1137/0222077 .
View
| DOI
| Download None (ext.)
1993 | Journal Article | IST-REx-ID: 4042
Edelsbrunner, Herbert, and Tiow Tan. “A Quadratic Time Algorithm for the Minmax Length Triangulation.” SIAM Journal on Computing, vol. 22, no. 3, SIAM, 1993, pp. 527–51, doi:10.1137/0222036 .
View
| DOI
| Download None (ext.)
1992 | Journal Article | IST-REx-ID: 4043
Edelsbrunner, Herbert, et al. “An O(N^2 Log n) Time Algorithm for the MinMax Angle Triangulation.” SIAM Journal on Scientific Computing, vol. 13, no. 4, Society for Industrial and Applied Mathematics , 1992, pp. 994–1008, doi:10.1137/0913058.
View
| DOI
| Download None (ext.)