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
2023 | Published | Journal Article | IST-REx-ID: 14364 | 
Alistarh D-A, Aspnes J, Ellen F, Gelashvili R, Zhu L. 2023. Why extension-based proofs fail. SIAM Journal on Computing. 52(4), 913–944.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2023 | Published | Journal Article | IST-REx-ID: 12563 |
Krokhin A, Opršal J, Wrochna M, Živný S. 2023. Topology and adjunction in promise constraint satisfaction. SIAM Journal on Computing. 52(1), 38–79.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2023 | Published | Journal Article | IST-REx-ID: 12960 |
Boissonnat JD, Kachanovich S, Wintraecken M. 2023. Tracing isomanifolds in Rd in time polynomial in d using Coxeter–Freudenthal–Kuhn triangulations. SIAM Journal on Computing. 52(2), 452–486.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| WoS
2021 | Published | Journal Article | IST-REx-ID: 11886 |
Henzinger M, Krinninger S, Nanongkai D. 2021. A deterministic almost-tight distributed algorithm for approximating single-source shortest paths. SIAM Journal on Computing. 50(3), STOC16-98-STOC16-137.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2020 | Published | Journal Article | IST-REx-ID: 11889
Henzinger M, Rao S, Wang D. 2020. Local flow partitioning for faster edge connectivity. SIAM Journal on Computing. 49(1), 1–36.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2019 | Published | Journal Article | IST-REx-ID: 7412 |
Achlioptas D, Iliopoulos F, Kolmogorov V. 2019. A local lemma for focused stochastical algorithms. SIAM Journal on Computing. 48(5), 1583–1602.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Published | Journal Article | IST-REx-ID: 6672 |
Boissonnat J-D, Rouxel-Labbé M, Wintraecken M. 2019. Anisotropic triangulations via discrete Riemannian Voronoi diagrams. SIAM Journal on Computing. 48(3), 1046–1097.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Published | Journal Article | IST-REx-ID: 11890 |
Bhattacharya S, Henzinger M, Italiano GF. 2018. Deterministic fully dynamic data structures for vertex cover and matching. SIAM Journal on Computing. 47(3), 859–887.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Published | Journal Article | IST-REx-ID: 5975 |
Kolmogorov V. 2018. Commutativity in the algorithmic Lovász local lemma. SIAM Journal on Computing. 47(6), 2029–2056.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2016 | Published | Journal Article | IST-REx-ID: 11891 |
Henzinger M, Krinninger S, Nanongkai D. 2016. Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization. SIAM Journal on Computing. 45(3), 947–1006.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
1992 | Published | 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. 13(4), 994–1008.
View
| DOI
| Download None (ext.)
1991 | Published | Journal Article | IST-REx-ID: 4051
Edelsbrunner H, Shi W. 1991. An O(n log^2 h) time algorithm for the three-dimensional convex hull problem. SIAM Journal on Computing. 20(2), 259–269.
View
| DOI
| Download None (ext.)
1989 | Published | Journal Article | IST-REx-ID: 4083 |
Yao F, Dobkin D, Edelsbrunner H, Paterson M. 1989. Partitioning space for range queries. SIAM Journal on Computing. 18(2), 371–384.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1988 | Published | Journal Article | IST-REx-ID: 4091
Edelsbrunner H, Skiena S. 1988. Probing convex polygons with X-Rays. SIAM Journal on Computing. 17(5), 870–882.
View
| DOI
| Download None (ext.)