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
Commutativity in the algorithmic Lovász local lemma
V. Kolmogorov, SIAM Journal on Computing 47 (2018) 2029–2056.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2016 | Journal Article | IST-REx-ID: 11891 | OA
Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization
M.H. Henzinger, S. Krinninger, D. Nanongkai, SIAM Journal on Computing 45 (2016) 947–1006.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2001 | Journal Article | IST-REx-ID: 11892
Maintaining minimum spanning forests in dynamic graphs
M.H. Henzinger, V. King, SIAM Journal on Computing 31 (2001) 364–374.
View | DOI
 

2000 | Journal Article | IST-REx-ID: 11694
Exploring unknown environments
S. Albers, M.H. Henzinger, SIAM Journal on Computing 29 (2000) 1164–1188.
View | DOI
 

2000 | Journal Article | IST-REx-ID: 11893
Improved data structures for fully dynamic biconnectivity
M.H. Henzinger, SIAM Journal on Computing 29 (2000) 1761–1815.
View | DOI
 

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

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

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

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

1992 | Journal Article | IST-REx-ID: 4043
An O(n^2 log n) time algorithm for the MinMax angle triangulation
H. Edelsbrunner, T. Tan, R. Waupotitsch, SIAM Journal on Scientific Computing 13 (1992) 994–1008.
View | DOI | Download None (ext.)
 

Filters and Search Terms

issn=0097-5397

Search

Filter Publications