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


2023 | Published | Journal Article | IST-REx-ID: 14364 | OA
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: 14558
Bhattacharya S, Henzinger M, Nanongkai D, Wu X. 2023. Deterministic near-optimal approximation algorithms for dynamic set cover. SIAM Journal on Computing. 52(5), 1132–1192.
View | DOI
 

2023 | Published | Journal Article | IST-REx-ID: 12563 | OA
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 | OA
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 | OA
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
 

2021 | Published | Journal Article | IST-REx-ID: 15271
Czumaj A, Davies P, Parter M. 2021. Simple, deterministic, constant-round coloring in congested clique and MPC. SIAM Journal on Computing. 50(5), 1603–1626.
View | DOI
 

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 | OA
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 | OA
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 | OA
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 | OA
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 | OA
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
 

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

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

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

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

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

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

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

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.)
 

Filters and Search Terms

issn=0097-5397

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed