Skip to main content

The design and evaluation of modern fully dynamic data structures

Searching for OpenAIRE data...

Publications

Almost Tight Error Bounds on Differentially Private Continual Counting

Author(s): Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay
Published in: ACM-SIAM Symposium on Discrete Algorithms (SODA23), 2023
Publisher: ACM-SIAM

Fully Dynamic Four-Vertex Subgraph Counting

Author(s): Kathrin Hanauer, Monika Henzinger, Qi Cheng Hua
Published in: 1st Symposium on Algorithmic Foundations of Dynamic Networks, 2022
Publisher: SAND 2022

Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies

Author(s): Kathrin Hanauer, Monika Henzinger, Stefan Schmid, Jonathan Trummer
Published in: IEEE International Conference on Computer Communications, 2022
Publisher: IEEE Communications Societz

Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk)

Author(s): Kathrin Hanauer, Monika Henzinger, and Christian Schulz
Published in: 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), 2022
Publisher: SAND 2022
DOI: 10.4230/lipics.sand.2022.1

Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear

Author(s): Antoine El-Hayek, Monika Henzinger, Stefan Schmid
Published in: ACM Symposium on Principles of Distributed Computing (PODC) 2022, 2022
Publisher: ACM

Leximax Approximations and Representative Cohort Selection

Author(s): Monika Henzinger, Charlotte Peale, Omer Reingold, Judy Hanwen Shen
Published in: Leibniz International Proceedings in Informatics (LIPIcs) series, 2022
Publisher: Symposium on Foundations of Responsible Computing (FORC)
DOI: 10.4230/lipics.forc.2022.2

The Augmentation-Speed Tradeoff for Consistent Network Updates

Author(s): Monika Henzinger, Ami Paz, Arash Pourdamghani, Stefan Schmid
Published in: ACM SIGCOMM Symposium on SDN Research (SOSR), 2022
Publisher: ACM SIGCOMM
DOI: 10.1145/3563647.3563655

Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs

Author(s): Monika Henzinger, Ami Paz, A. R. Sricharan
Published in: Leibniz International Proceedings in Informatics (LIPIcs) series, 2022
Publisher: European Symposium on Algorithms (ESA)

Asymptotically Tight Bounds on the Time Complexity of Broadcast and its Variants in Dynamic Networks

Author(s): Antoine El-Hayek, Monika Henzinger, Stefan Schmid
Published in: 14th Innovations in Theoretical Computer Science (ITCS 2023), 2023
Publisher: Leibniz International Proceedings in Informatics (LIPIcs)

Recent Advances in Fully Dynamic Graph Algorithms

Author(s): Kathrin Hanauer, Monika Henzinger, Christian Schulz
Published in: Journal of Experimental Algorithmics, 10846654, 2022, ISSN 1084-6654
Publisher: Association for Computing Machinary, Inc.
DOI: 10.48550/arxiv.2102.11169