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.

5750 Publications


2019 | Conference Paper | IST-REx-ID: 11826 | OA
Ancona, Bertie, Monika H Henzinger, Liam Roditty, Virginia Vassilevska Williams, and Nicole Wein. “Algorithms and Hardness for Diameter in Dynamic Graphs.” In 46th International Colloquium on Automata, Languages, and Programming, Vol. 132. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.ICALP.2019.13.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2019 | Conference Paper | IST-REx-ID: 11850 | OA
Henzinger, Monika H, Stefan Neumann, and Stefan Schmid. “Efficient Distributed Workload (Re-)Embedding.” In SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems, 43–44. Association for Computing Machinery, 2019. https://doi.org/10.1145/3309697.3331503.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2019 | Conference Paper | IST-REx-ID: 11853 | OA
Bhattacharya, Sayan, Monika H Henzinger, and Danupon Nanongkai. “A New Deterministic Algorithm for Dynamic Set Cover.” In 60th Annual Symposium on Foundations of Computer Science, 406–23. Institute of Electrical and Electronics Engineers, 2019. https://doi.org/10.1109/focs.2019.00033.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2019 | Conference Paper | IST-REx-ID: 11865 | OA
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
 

2019 | Conference Paper | IST-REx-ID: 11871 | OA
Bernstein, Aaron, Sebastian Forster, and Monika H Henzinger. “A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching.” In 30th Annual ACM-SIAM Symposium on Discrete Algorithms, 1899–1918. Society for Industrial and Applied Mathematics, 2019. https://doi.org/10.1137/1.9781611975482.115.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

Filters and Search Terms

oa=1

Search

Filter Publications