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 | OA
V. Kolmogorov, “Commutativity in the algorithmic Lovász local lemma,” SIAM Journal on Computing, vol. 47, no. 6. Society for Industrial & Applied Mathematics (SIAM), pp. 2029–2056, 2018.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2016 | Journal Article | IST-REx-ID: 11891 | OA
M. H. Henzinger, S. Krinninger, and D. Nanongkai, “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, pp. 947–1006, 2016.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2001 | Journal Article | IST-REx-ID: 11892
M. H. Henzinger and V. King, “Maintaining minimum spanning forests in dynamic graphs,” SIAM Journal on Computing, vol. 31, no. 2. Society for Industrial & Applied Mathematics, pp. 364–374, 2001.
View | DOI
 

2000 | Journal Article | IST-REx-ID: 11694
S. Albers and M. H. Henzinger, “Exploring unknown environments,” SIAM Journal on Computing, vol. 29, no. 4. Society for Industrial and Applied Mathematics, pp. 1164–1188, 2000.
View | DOI
 

2000 | Journal Article | IST-REx-ID: 11893
M. H. Henzinger, “Improved data structures for fully dynamic biconnectivity,” SIAM Journal on Computing, vol. 29, no. 6. Society for Industrial & Applied Mathematics, pp. 1761–1815, 2000.
View | DOI
 

1994 | Journal Article | IST-REx-ID: 4033
B. Chazelle, H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, and M. Sharir, “Selecting heavily covered points,” SIAM Journal on Computing, vol. 23, no. 6. SIAM, pp. 1138–1151, 1994.
View | DOI | Download None (ext.)
 

1993 | Journal Article | IST-REx-ID: 4041
H. Edelsbrunner, R. Seidel, and M. Sharir, “On the zone theorem for hyperplane arrangements,” SIAM Journal on Computing, vol. 22, no. 2. SIAM, pp. 418–429, 1993.
View | DOI | Download None (ext.)
 

1993 | Journal Article | IST-REx-ID: 4036
B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and J. Snoeyink, “Computing a face in an arrangement of line segments and related problems,” SIAM Journal on Computing, vol. 22, no. 6. SIAM, pp. 1286–1302, 1993.
View | DOI | Download None (ext.)
 

1993 | Journal Article | IST-REx-ID: 4042
H. Edelsbrunner and T. Tan, “A quadratic time algorithm for the minmax length triangulation,” SIAM Journal on Computing, vol. 22, no. 3. SIAM, pp. 527–551, 1993.
View | DOI | Download None (ext.)
 

1992 | Journal Article | IST-REx-ID: 4043
H. Edelsbrunner, T. Tan, and R. Waupotitsch, “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 , pp. 994–1008, 1992.
View | DOI | Download None (ext.)
 

Filters and Search Terms

issn=0097-5397

Search

Filter Publications