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.
22 Publications
2018 | Journal Article | IST-REx-ID: 5975 | 
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
V. Kolmogorov, SIAM Journal on Computing 47 (2018) 2029–2056.
2016 | Journal Article | IST-REx-ID: 11891 |
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
M.H. Henzinger, S. Krinninger, D. Nanongkai, SIAM Journal on Computing 45 (2016) 947–1006.
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
M.H. Henzinger, V. King, SIAM Journal on Computing 31 (2001) 364–374.
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
S. Albers, M.H. Henzinger, SIAM Journal on Computing 29 (2000) 1164–1188.
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
M.H. Henzinger, SIAM Journal on Computing 29 (2000) 1761–1815.
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.)
H. Edelsbrunner, T. Tan, R. Waupotitsch, SIAM Journal on Scientific Computing 13 (1992) 994–1008.
1991 | Journal Article | IST-REx-ID: 4051
An O(n log^2 h) time algorithm for the three-dimensional convex hull problem
H. Edelsbrunner, W. Shi, SIAM Journal on Computing 20 (1991) 259–269.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, W. Shi, SIAM Journal on Computing 20 (1991) 259–269.
1989 | Journal Article | IST-REx-ID: 4083 |
Partitioning space for range queries
F. Yao, D. Dobkin, H. Edelsbrunner, M. Paterson, SIAM Journal on Computing 18 (1989) 371–384.
[Published Version]
View
| DOI
| Download Published Version (ext.)
F. Yao, D. Dobkin, H. Edelsbrunner, M. Paterson, SIAM Journal on Computing 18 (1989) 371–384.
1988 | Journal Article | IST-REx-ID: 4091
Probing convex polygons with X-Rays
H. Edelsbrunner, S. Skiena, SIAM Journal on Computing 17 (1988) 870–882.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, S. Skiena, SIAM Journal on Computing 17 (1988) 870–882.
1986 | Journal Article | IST-REx-ID: 4105
Constructing arrangements of lines and hyperplanes with applications
H. Edelsbrunner, J. O’Rourke, R. Seidel, SIAM Journal on Computing 15 (1986) 341–363.
View
| DOI
H. Edelsbrunner, J. O’Rourke, R. Seidel, SIAM Journal on Computing 15 (1986) 341–363.