Skip to main content
European Commission logo
español español
CORDIS - Resultados de investigaciones de la UE
CORDIS
CORDIS Web 30th anniversary CORDIS Web 30th anniversary

The design and evaluation of modern fully dynamic data structures

CORDIS proporciona enlaces a los documentos públicos y las publicaciones de los proyectos de los programas marco HORIZONTE.

Los enlaces a los documentos y las publicaciones de los proyectos del Séptimo Programa Marco, así como los enlaces a algunos tipos de resultados específicos, como conjuntos de datos y «software», se obtienen dinámicamente de OpenAIRE .

Publicaciones

Almost Tight Error Bounds on Differentially Private Continual Counting

Autores: Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay
Publicado en: ACM-SIAM Symposium on Discrete Algorithms (SODA23), 2023
Editor: ACM-SIAM

A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems

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

Fully Dynamic Four-Vertex Subgraph Counting

Autores: Kathrin Hanauer, Monika Henzinger, Qi Cheng Hua
Publicado en: 1st Symposium on Algorithmic Foundations of Dynamic Networks, 2022
Editor: SAND 2022

Fully Dynamic Exact Edge Connectivity in Sublinear Time

Autores: Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel
Publicado en: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms (SODA 2023), 2023
Editor: ACM-SIAM
DOI: 10.1137/1.9781611977554.ch3

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

Autores: Kathrin Hanauer, Monika Henzinger, Stefan Schmid, Jonathan Trummer
Publicado en: IEEE International Conference on Computer Communications, 2022
Editor: IEEE Communications Societz

Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear

Autores: Antoine El-Hayek, Monika Henzinger, Stefan Schmid
Publicado en: ACM Symposium on Principles of Distributed Computing (PODC) 2022, 2022
Editor: ACM

Leximax Approximations and Representative Cohort Selection

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

Improved Coresets for Euclidean k-Means

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

The Augmentation-Speed Tradeoff for Consistent Network Updates

Autores: Monika Henzinger, Ami Paz, Arash Pourdamghani, Stefan Schmid
Publicado en: ACM SIGCOMM Symposium on SDN Research (SOSR), 2022
Editor: ACM SIGCOMM
DOI: 10.1145/3563647.3563655

Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs

Autores: Monika Henzinger, Ami Paz, A. R. Sricharan
Publicado en: Leibniz International Proceedings in Informatics (LIPIcs) series, 2022
Editor: European Symposium on Algorithms (ESA)

Dynamic Maintenance of Monotone Dynamic Programs and Applications

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

Online Min-Max Paging

Autores: Ashish Chiplunkar, Monika Henzinger, Sagar Sudhir Kale, Maximilian Vötsch
Publicado en: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023, Página(s) 1545-1565
Editor: ACM-SIAM
DOI: 10.1137/1.9781611977554.ch57

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

Autores: Hendrik Fichtenberger, Monika Henzinger, Jalaj Upadhyay
Publicado en: 40th International Conference on Machine Learning (ICML 2023), 2023
Editor: ICML

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

Autores: Antoine El-Hayek, Monika Henzinger, Stefan Schmid
Publicado en: 14th Innovations in Theoretical Computer Science (ITCS 2023), 2023
Editor: Leibniz International Proceedings in Informatics (LIPIcs)

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

Autores: Ameya Velingker, Maximilian Vötsch, David Woodruff und Samson Zhou
Publicado en: 40th International Conference on Machine Learning (ICML2023), 2023
Editor: ICML

Recent Advances in Fully Dynamic Graph Algorithms

Autores: Kathrin Hanauer, Monika Henzinger, Christian Schulz
Publicado en: Journal of Experimental Algorithmics, Edición 10846654, 2022, ISSN 1084-6654
Editor: Association for Computing Machinary, Inc.
DOI: 10.48550/arxiv.2102.11169

A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems

Autores: Monika Henzinger, Billy Jin, Richard Peng, David P. Williamson
Publicado en: Algorithmica, Edición 85, 2023, Página(s) 3680-3716, ISSN 0178-4617
Editor: Springer Verlag
DOI: 10.1007/s00453-023-01154-8

Buscando datos de OpenAIRE...

Se ha producido un error en la búsqueda de datos de OpenAIRE

No hay resultados disponibles