default search action
Monika Henzinger
- > Home > Persons > Monika Henzinger
Publications
- 2024
- [c161]Antoine El-Hayek
, Monika Henzinger, Stefan Schmid:
Broadcast and Consensus in Stochastic Dynamic Networks with Byzantine Nodes and Adversarial Edges. DISC 2024: 21:1-21:15 - 2023
- [c157]Kathrin Hanauer, Monika Henzinger, Lara Ost, Stefan Schmid
:
Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters. INFOCOM 2023: 1-10 - [c156]Antoine El-Hayek
, Monika Henzinger, Stefan Schmid
:
Asymptotically Tight Bounds on the Time Complexity of Broadcast and Its Variants in Dynamic Networks. ITCS 2023: 47:1-47:21 - [c148]Monika Henzinger, Stefan Neumann, Harald Räcke, Stefan Schmid
:
Dynamic Maintenance of Monotone Dynamic Programs and Applications. STACS 2023: 36:1-36:16 - [i117]Monika Henzinger, Stefan Neumann
, Harald Räcke, Stefan Schmid
:
Dynamic Maintenance of Monotone Dynamic Programs and Applications. CoRR abs/2301.01744 (2023) - [i116]Kathrin Hanauer, Monika Henzinger, Lara Ost, Stefan Schmid
:
Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters. CoRR abs/2301.05751 (2023) - [i112]Antoine El-Hayek, Monika Henzinger, Stefan Schmid
:
Time Complexity of Broadcast and Consensus for Randomized Oblivious Message Adversaries. CoRR abs/2302.11988 (2023) - 2022
- [c143]Kathrin Hanauer, Monika Henzinger, Stefan Schmid
, Jonathan Trummer:
Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies. INFOCOM 2022: 1649-1658 - [c141]Antoine El-Hayek
, Monika Henzinger, Stefan Schmid
:
Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear. PODC 2022: 54-56 - [c137]Monika Henzinger, Ami Paz, Arash Pourdamghani, Stefan Schmid
:
The augmentation-speed tradeoff for consistent network updates. SOSR 2022: 67-80 - [d1]Kathrin Hanauer
, Monika Henzinger
, Stefan Schmid
, Jonathan Trummer
:
DJ-Match/DJ-Match: Version 1.0.0. Zenodo, 2022 - [i100]Kathrin Hanauer, Monika Henzinger, Stefan Schmid, Jonathan Trummer:
Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies. CoRR abs/2201.06621 (2022) - [i96]Monika Henzinger, Ami Paz, Arash Pourdamghani, Stefan Schmid
:
The Augmentation-Speed Tradeoff for Consistent Network Updates. CoRR abs/2211.03716 (2022) - [i93]Antoine El-Hayek, Monika Henzinger, Stefan Schmid
:
Asymptotically Tight Bounds on the Time Complexity of Broadcast and its Variants in Dynamic Networks. CoRR abs/2211.10151 (2022) - [i92]Antoine El-Hayek, Monika Henzinger, Stefan Schmid
:
Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear. CoRR abs/2211.11352 (2022) - 2021
- [c131]Monika Henzinger
, Ami Paz
, Stefan Schmid
:
On the Complexity of Weight-Dynamic Network Algorithms. Networking 2021: 1-9 - [c127]Monika Henzinger
, Stefan Neumann
, Harald Räcke, Stefan Schmid:
Tight Bounds for Online Graph Partitioning. SODA 2021: 2799-2818 - [i86]Monika Henzinger, Ami Paz, Stefan Schmid:
On the Complexity of Weight-Dynamic Network Algorithms. CoRR abs/2105.13172 (2021) - 2020
- [i66]Monika Henzinger, Stefan Neumann, Harald Räcke, Stefan Schmid:
Tight Bounds for Online Graph Partitioning. CoRR abs/2011.01017 (2020) - 2019
- [j65]Monika Henzinger, Stefan Neumann
, Stefan Schmid:
Efficient Distributed Workload (Re-)Embedding. Proc. ACM Meas. Anal. Comput. Syst. 3(1): 13:1-13:38 (2019) - [c112]Monika Henzinger
, Stefan Neumann
, Stefan Schmid
:
Efficient Distributed Workload (Re-)Embedding. SIGMETRICS (Abstracts) 2019: 43-44 - [i63]Monika Henzinger, Stefan Neumann, Stefan Schmid:
Efficient Distributed Workload (Re-)Embedding. CoRR abs/1904.05474 (2019)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-11-16 00:38 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint