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 | Journal Article | IST-REx-ID: 12563 | 
Krokhin, Andrei, et al. “Topology and Adjunction in Promise Constraint Satisfaction.” SIAM Journal on Computing, vol. 52, no. 1, Society for Industrial & Applied Mathematics, 2023, pp. 38–79, doi:10.1137/20m1378223.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2023 | Journal Article | IST-REx-ID: 12960 |
Boissonnat, Jean Daniel, et al. “Tracing Isomanifolds in Rd in Time Polynomial in d Using Coxeter–Freudenthal–Kuhn Triangulations.” SIAM Journal on Computing, vol. 52, no. 2, Society for Industrial and Applied Mathematics, 2023, pp. 452–86, doi:10.1137/21M1412918.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| WoS
2023 | Journal Article | IST-REx-ID: 14558
Bhattacharya, Sayan, et al. “Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover.” SIAM Journal on Computing, vol. 52, no. 5, Society for Industrial and Applied Mathematics, 2023, pp. 1132–92, doi:10.1137/21M1428649.
View
| DOI
2023 | Journal Article | IST-REx-ID: 14364 |
Alistarh, Dan-Adrian, et al. “Why Extension-Based Proofs Fail.” SIAM Journal on Computing, vol. 52, no. 4, Society for Industrial and Applied Mathematics, 2023, pp. 913–44, doi:10.1137/20M1375851.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Journal Article | IST-REx-ID: 11886 |
Henzinger, Monika H., et al. “A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths.” SIAM Journal on Computing, vol. 50, no. 3, Society for Industrial & Applied Mathematics, 2021, pp. STOC16-98-STOC16-137, doi:10.1137/16m1097808.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Journal Article | IST-REx-ID: 15271
Czumaj, Artur, et al. “Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC.” SIAM Journal on Computing, vol. 50, no. 5, Society for Industrial & Applied Mathematics, 2021, pp. 1603–26, doi:10.1137/20m1366502.
View
| DOI
2020 | Journal Article | IST-REx-ID: 11889
Henzinger, Monika H., et al. “Local Flow Partitioning for Faster Edge Connectivity.” SIAM Journal on Computing, vol. 49, no. 1, Society for Industrial & Applied Mathematics, 2020, pp. 1–36, doi:10.1137/18m1180335.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2019 | Journal Article | IST-REx-ID: 6672 |
Boissonnat, Jean-Daniel, et al. “Anisotropic Triangulations via Discrete Riemannian Voronoi Diagrams.” SIAM Journal on Computing, vol. 48, no. 3, Society for Industrial & Applied Mathematics (SIAM), 2019, pp. 1046–97, doi:10.1137/17m1152292.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2019 | Journal Article | IST-REx-ID: 7412 |
Achlioptas, Dimitris, et al. “A Local Lemma for Focused Stochastical Algorithms.” SIAM Journal on Computing, vol. 48, no. 5, SIAM, 2019, pp. 1583–602, doi:10.1137/16m109332x.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Journal Article | IST-REx-ID: 11890 |
Bhattacharya, Sayan, et al. “Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching.” SIAM Journal on Computing, vol. 47, no. 3, Society for Industrial & Applied Mathematics, 2018, pp. 859–87, doi:10.1137/140998925.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Journal Article | IST-REx-ID: 5975 |
Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.” SIAM Journal on Computing, vol. 47, no. 6, Society for Industrial & Applied Mathematics (SIAM), 2018, pp. 2029–56, doi:10.1137/16m1093306.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2016 | Journal Article | IST-REx-ID: 11891 |
Henzinger, Monika H., et al. “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, 2016, pp. 947–1006, doi:10.1137/140957299.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2001 | Journal Article | IST-REx-ID: 11892
Henzinger, Monika H., and Valerie King. “Maintaining Minimum Spanning Forests in Dynamic Graphs.” SIAM Journal on Computing, vol. 31, no. 2, Society for Industrial & Applied Mathematics, 2001, pp. 364–74, doi:10.1137/s0097539797327209.
View
| DOI
2000 | Journal Article | IST-REx-ID: 11694
Albers, Susanne, and Monika H. Henzinger. “Exploring Unknown Environments.” SIAM Journal on Computing, vol. 29, no. 4, Society for Industrial and Applied Mathematics, 2000, pp. 1164–88, doi:10.1137/s009753979732428x.
View
| DOI
2000 | Journal Article | IST-REx-ID: 11893
Henzinger, Monika H. “Improved Data Structures for Fully Dynamic Biconnectivity.” SIAM Journal on Computing, vol. 29, no. 6, Society for Industrial & Applied Mathematics, 2000, pp. 1761–815, doi:10.1137/s0097539794263907.
View
| DOI
1992 | Journal Article | IST-REx-ID: 4043
Edelsbrunner, Herbert, et al. “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 , 1992, pp. 994–1008, doi:10.1137/0913058.
View
| DOI
| Download None (ext.)
1991 | Journal Article | IST-REx-ID: 4051
Edelsbrunner, Herbert, and Weiping Shi. “An O(n Log^2 h) Time Algorithm for the Three-Dimensional Convex Hull Problem.” SIAM Journal on Computing, vol. 20, no. 2, SIAM, 1991, pp. 259–69, doi:10.1137/0220016 .
View
| DOI
| Download None (ext.)
1989 | Journal Article | IST-REx-ID: 4083 |
Yao, F., et al. “Partitioning Space for Range Queries.” SIAM Journal on Computing, vol. 18, no. 2, SIAM, 1989, pp. 371–84, doi:10.1137/0218025.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1988 | Journal Article | IST-REx-ID: 4091
Edelsbrunner, Herbert, and Steven Skiena. “Probing Convex Polygons with X-Rays.” SIAM Journal on Computing, vol. 17, no. 5, SIAM, 1988, pp. 870–82, doi:10.1137/0217054 .
View
| DOI
| Download None (ext.)
1986 | Journal Article | IST-REx-ID: 4105
Edelsbrunner, Herbert, et al. “Constructing Arrangements of Lines and Hyperplanes with Applications.” SIAM Journal on Computing, vol. 15, no. 2, SIAM, 1986, pp. 341–63, doi:10.1137/0215024.
View
| DOI