The design and evaluation of modern fully dynamic data structures

Informazioni relative al progetto

MoDynStruct

ID dell’accordo di sovvenzione: 101019564

DOI

10.3030/101019564

Data della firma CE 10 Luglio 2021

Data di avvio 1 Gennaio 2022

Data di completamento 31 Dicembre 2026

Finanziato da

• EXCELLENT SCIENCE - European Research Council (ERC)

Costo totale

€ 2 477 371,00

Contributo UE

€ 2 477 371,00

Coordinato da

INSTITUTE OF SCIENCE AND TECHNOLOGY AUSTRIA
Austria

CORDIS fornisce collegamenti ai risultati finali pubblici e alle pubblicazioni dei progetti ORIZZONTE.

I link ai risultati e alle pubblicazioni dei progetti del 7° PQ, così come i link ad alcuni tipi di risultati specifici come dataset e software, sono recuperati dinamicamente da .OpenAIRE .

Pubblicazioni

Conference proceedings (24)

Almost Tight Error Bounds on Differentially Private Continual Counting

Autori: Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay
Pubblicato in: ACM-SIAM Symposium on Discrete Algorithms (SODA23), 2023
Editore: ACM-SIAM

Fully Dynamic k-Means Coreset in Near-Optimal Update Time

Autori: Max Dupré la Tour, Monika Henzinger, David Saulpic
Pubblicato in: 2024
Editore: LIPIcs
DOI: 10.4230/lipics.esa.2024.100

On the Complexity of Algorithms with Predictions for Dynamic Graph Problems

Autori: Monika Henzinger, Barna Saha, Martin P. Seybold, Christopher Ye
Pubblicato in: 2024
Editore: LIPIcs
DOI: 10.4230/lipics.itcs.2024.62

A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems

Autori: Monika Henzinger, Billy Jin, Richard Peng, David P. Williamson
Pubblicato in: 14th Innovations in Theoretical Computer Science Conference (ITCS 2023), 2023
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.itcs.2023.69

Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond

Autori: Kyriakos Axiotis, Vincent Cohen-Addad, Monika Henzinger, Sammy Jerome, Vahab Mirrokni, David Saulpic, David P. Woodruff, Michael Wunder
Pubblicato in: 2025
Editore: Cambridge MA: JMLR

Fully Dynamic Four-Vertex Subgraph Counting

Autori: Kathrin Hanauer, Monika Henzinger, Qi Cheng Hua
Pubblicato in: 1st Symposium on Algorithmic Foundations of Dynamic Networks, 2022
Editore: SAND 2022

Fully Dynamic Exact Edge Connectivity in Sublinear Time

Autori: Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel
Pubblicato in: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms (SODA 2023), 2023
Editore: ACM-SIAM
DOI: 10.1137/1.9781611977554.ch3

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

Autori: Kathrin Hanauer, Monika Henzinger, Stefan Schmid, Jonathan Trummer
Pubblicato in: IEEE International Conference on Computer Communications, 2022
Editore: IEEE Communications Societz

Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear

Autori: Antoine El-Hayek, Monika Henzinger, Stefan Schmid
Pubblicato in: ACM Symposium on Principles of Distributed Computing (PODC) 2022, 2022
Editore: ACM

Leximax Approximations and Representative Cohort Selection

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

Broadcast and Consensus in Stochastic Dynamic Networks with Byzantine Nodes and Adversarial Edges

Autori: Antoine El-Hayek, Monika Henzinger, Stefan Schmid
Pubblicato in: 2024
Editore: LIPIcs
DOI: 10.4230/lipics.disc.2024.21

Improved Coresets for Euclidean k-Means

Autori: Vincent Cohen-Addad, Kasper Green Larsen, David Saulpic, Chris Schwiegelshohn, Omar Ali Sheikh-Omar
Pubblicato in: 37th Conference on Neural Information Processing Systems (NeurIPS 2022), 2022
Editore: Neural Information Processing Systems
DOI: 10.48550/arxiv.2211.08184

The Augmentation-Speed Tradeoff for Consistent Network Updates

Autori: Monika Henzinger, Ami Paz, Arash Pourdamghani, Stefan Schmid
Pubblicato in: ACM SIGCOMM Symposium on SDN Research (SOSR), 2022
Editore: ACM SIGCOMM
DOI: 10.1145/3563647.3563655

Electrical Flows for Polylogarithmic Competitive Oblivious Routing

Autori: Gramoz Goranci, Monika Henzinger, Harald Räcke, Sushant Sachdeva, A. R. Sricharan
Pubblicato in: 2024
Editore: LIPIcs
DOI: 10.4230/lipics.itcs.2024.55

Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs

Autori: Monika Henzinger, Ami Paz, A. R. Sricharan
Pubblicato in: Leibniz International Proceedings in Informatics (LIPIcs) series, 2022
Editore: European Symposium on Algorithms (ESA)

Making Old Things New: A Unified Algorithm for Differentially Private Clustering

Autori: Max Dupre la Tour, Monika Henzinger, David Saulpic
Pubblicato in: 2024
Editore: Cambridge MA: JMLR

Expander Hierarchies for Normalized Cuts on Graphs

Autori: Kathrin Hanauer, Monika Henzinger, Robin Münk, Harald Räcke, Maximilian Vötsch
Pubblicato in: Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024, Pagina/e 1016-1027
Editore: ACM
DOI: 10.1145/3637528.3671978

Dynamic Maintenance of Monotone Dynamic Programs and Applications

Autori: Monika Henzinger, Stefan Neumann, Harald Räcke, Stefan Schmid
Pubblicato in: 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023), 2023
Editore: Springer
DOI: 10.4230/lipics.stacs.2023.36

Online Min-Max Paging

Autori: Ashish Chiplunkar, Monika Henzinger, Sagar Sudhir Kale, Maximilian Vötsch
Pubblicato in: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023, Pagina/e 1545-1565
Editore: ACM-SIAM
DOI: 10.1137/1.9781611977554.ch57

Continual Counting with Gradual Privacy Expiration

Autori: Joel Daniel Andersson, Monika Henzinger, Rasmus Pagh, Teresa Anna Steiner, Jalaj Upadhyay
Pubblicato in: 2024
Editore: Curran Associates, Inc.

Constant Matters: Fine-grained Error Bound on Differentially Private Continual Observation

Autori: Hendrik Fichtenberger, Monika Henzinger, Jalaj Upadhyay
Pubblicato in: 40th International Conference on Machine Learning (ICML 2023), 2023
Editore: ICML

Private Counting of Distinct Elements in the Turnstile Model and Extensions

Autori: Monika Henzinger, A. R. Sricharan, Teresa Anna Steiner
Pubblicato in: 2024
Editore: LIPIcs
DOI: 10.4230/lipics.approx/random.2024.40

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

Autori: Antoine El-Hayek, Monika Henzinger, Stefan Schmid
Pubblicato in: 14th Innovations in Theoretical Computer Science (ITCS 2023), 2023
Editore: Leibniz International Proceedings in Informatics (LIPIcs)

Fast $(1+\eps)$-Approximation Algorithms for Binary Matrix Factorization

Autori: Ameya Velingker, Maximilian Vötsch, David Woodruff und Samson Zhou
Pubblicato in: 40th International Conference on Machine Learning (ICML2023), 2023
Editore: ICML

Peer reviewed articles (2)

Recent Advances in Fully Dynamic Graph Algorithms

Autori: Kathrin Hanauer, Monika Henzinger, Christian Schulz
Pubblicato in: Journal of Experimental Algorithmics, Numero 10846654, 2022, ISSN 1084-6654
Editore: Association for Computing Machinary, Inc.
DOI: 10.48550/arxiv.2102.11169

A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems

Autori: Monika Henzinger, Billy Jin, Richard Peng, David P. Williamson
Pubblicato in: Algorithmica, Numero 85, 2023, Pagina/e 3680-3716, ISSN 0178-4617
Editore: Springer Verlag
DOI: 10.1007/s00453-023-01154-8

Book chapters (4)

Experimental Evaluation of Fully Dynamic <i>k</i>-Means via Coresets

Autori: Monika Henzinger, David Saulpic, Leonhard Sidl
Pubblicato in: 2024 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX), 2024, Pagina/e 220-233
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977929.17

Deterministic Near-Linear Time Minimum Cut in Weighted Graphs

Autori: Monika Henzinger, Jason Li, Satish Rao, Di Wang
Pubblicato in: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Pagina/e 3089-3139
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.111

A Unifying Framework for Differentially Private Sums under Continual Observation

Autori: Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay
Pubblicato in: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Pagina/e 995-1018
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.38

Dynamically Maintaining the Persistent Homology of Time Series

Autori: Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Monika Henzinger, Lara Ost
Pubblicato in: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Pagina/e 243-295
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.11