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.
5 Publications
2019 | Conference Paper | IST-REx-ID: 11865 | 
Daga, Mohit, Monika H Henzinger, Danupon Nanongkai, and Thatchaphol Saranurak. “Distributed Edge Connectivity in Sublinear Time.” In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 343–354. Association for Computing Machinery, 2019. https://doi.org/10.1145/3313276.3316346.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2016 | Conference Paper | IST-REx-ID: 11866 |
Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths.” In 48th Annual ACM SIGACT Symposium on Theory of Computing, 489–98. Association for Computing Machinery, 2016. https://doi.org/10.1145/2897518.2897638.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2016 | Conference Paper | IST-REx-ID: 11867 |
Bhattacharya, Sayan, Monika H Henzinger, and Danupon Nanongkai. “New Deterministic Approximation Algorithms for Fully Dynamic Matching.” In 48th Annual ACM SIGACT Symposium on Theory of Computing, 398–411. Association for Computing Machinery, 2016. https://doi.org/10.1145/2897518.2897568.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2015 | Conference Paper | IST-REx-ID: 11869 |
Bhattacharya, Sayan, Monika H Henzinger, Danupon Nanongkai, and Charalampos Tsourakakis. “Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams.” In 47th Annual ACM Symposium on Theory of Computing, 173–82. Association for Computing Machinery, 2015. https://doi.org/10.1145/2746539.2746592.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2014 | Conference Paper | IST-REx-ID: 11870 |
Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Sublinear-Time Decremental Algorithms for Single-Source Reachability and Shortest Paths on Directed Graphs.” In 46th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery, 2014. https://doi.org/10.1145/2591796.2591869.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv