Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.




53 Publications

2025 | Published | Conference Paper | IST-REx-ID: 20533 | OA
Securing dynamic data: A primer on differentially private data structures
M. Henzinger, R. Safavi Hemami, in:, 33rd Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.
[Published Version] View | Files available | DOI
 
2025 | Published | Conference Paper | IST-REx-ID: 20534 | OA
Efficient contractions of dynamic graphs - with applications
M. Henzinger, E. Kosinas, R. Münk, H. Räcke, in:, 33rd Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.
[Published Version] View | Files available | DOI | arXiv
 
2025 | Published | Conference Paper | IST-REx-ID: 20535 | OA
Near-optimal differentially private graph algorithms via the Multidimensional AboveThreshold Mechanism
L. Dhulipala, M. Henzinger, G.Z. Li, Q.C. Liu, A.R. Sricharan, L. Zhu, in:, 33rd Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.
[Published Version] View | Files available | DOI | arXiv
 
2025 | Published | Conference Paper | IST-REx-ID: 20536 | OA
B-Treaps revised: Write efficient randomized block search trees with high load
R. Safavi Hemami, M.P. Seybold, in:, 19th International Symposium on Algorithms and Data Structures, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.
[Published Version] View | Files available | DOI | arXiv
 
2025 | Published | Conference Paper | IST-REx-ID: 20819 | OA
Differentially private federated k-means clustering with server-side data
J.A. Scott, C. Lampert, D. Saulpic, in:, 42nd International Conference on Machine Learning, ML Research Press, 2025, pp. 53757–53790.
[Published Version] View | Files available | arXiv
 
2025 | Published | Conference Paper | IST-REx-ID: 20051 | OA
An almost tight lower bound for plurality consensus with undecided state dynamics in the population protocol model
A. El-Hayek, R. Elsässer, S. Schmid, in:, Proceedings of the ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2025.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2025 | Published | Conference Paper | IST-REx-ID: 19982 | OA
Fully dynamic approximate minimum cut in subpolynomial time per operation
A. El-Hayek, M. Henzinger, J. Li, in:, Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2025, pp. 750–784.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
earlier version | 2025 | Published | Conference Paper | IST-REx-ID: 21280 | OA
Incremental approximate maximum flow via residual graph sparsification
G. Goranci, M. Henzinger, H. Räcke, A. Sricharan, in:, 52nd International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, p. 91:1-91:20.
[Published Version] View | Files available | DOI | arXiv
 
2024 | Published | Conference Paper | IST-REx-ID: 14769 | OA
Experimental evaluation of fully dynamic k-means via coresets
M. Henzinger, D. Saulpic, L. Sidl, in:, 2024 Proceedings of the Symposium on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2024, pp. 220–233.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2024 | Published | Conference Paper | IST-REx-ID: 15008 | OA
Electrical flows for polylogarithmic competitive oblivious routing
G. Goranci, M. Henzinger, H. Räcke, S. Sachdeva, A.R. Sricharan, in:, 15th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2024 | Published | Conference Paper | IST-REx-ID: 15093 | OA
Dynamically maintaining the persistent homology of time series
S. Cultrera di Montesano, H. Edelsbrunner, M. Henzinger, L. Ost, in:, D.P. Woodruff (Ed.), Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Society for Industrial and Applied Mathematics, 2024, pp. 243–295.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2024 | Published | Conference Paper | IST-REx-ID: 15253 | OA
A unifying framework for differentially private sums under continual observation
M. Henzinger, J. Upadhyay, S. Upadhyay, in:, Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2024, pp. 995–1018.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2024 | Published | Journal Article | IST-REx-ID: 17188 | OA
Delegated online search
P. Braun, N. Hahn, M. Hoefer, C. Schecker, Artificial Intelligence 334 (2024).
[Published Version] View | Files available | DOI | WoS | arXiv
 
2024 | Published | Conference Paper | IST-REx-ID: 18503 | OA
Deterministic near-linear time minimum cut in weighted graphs
M. Henzinger, J. Li, S. Rao, D. Wang, in:, 35th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2024, pp. 3089–3139.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2024 | Published | Conference Paper | IST-REx-ID: 18906 | OA
Expander hierarchies for normalized cuts on graphs
K. Hanauer, M. Henzinger, R. Münk, H. Räcke, M. Vötsch, in:, Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, ACM, 2024, pp. 1016–1027.
[Published Version] View | Files available | DOI | WoS
 
2024 | Published | Conference Paper | IST-REx-ID: 18922
Computing the 3-edge-connected components of directed graphs in linear time
L. Georgiadis, G.F. Italiano, E. Kosinas, in:, 65th Annual Symposium on Foundations of Computer Science, IEEE, 2024, pp. 62–85.
View | DOI | WoS
 
2024 | Published | Conference Paper | IST-REx-ID: 18928 | OA
On the complexity of algorithms with predictions for dynamic graph problems
M. Henzinger, B. Saha, M.P. Seybold, C. Ye, in:, 15th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 62:1-62:25.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2024 | Published | Conference Paper | IST-REx-ID: 19512 | OA
Continual counting with gradual privacy expiration
J.D. Andersson, M. Henzinger, R. Pagh, T.A. Steiner, J. Upadhyay, in:, 38th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2024.
[Preprint] View | Download Preprint (ext.) | arXiv
 
2024 | Published | Conference Paper | IST-REx-ID: 18115 | OA
Data-efficient learning via clustering-based sensitivity sampling: Foundation models and beyond
K. Axiotis, V. Cohen-Addad, M. Henzinger, S. Jerome, V. Mirrokni, D. Saulpic, D.P. Woodruff, M. Wunder, in:, Proceedings of the 41st International Conference on Machine Learning, ML Research Press, 2024, pp. 2086–2107.
[Published Version] View | Download Published Version (ext.) | arXiv
 
2024 | Published | Conference Paper | IST-REx-ID: 18116 | OA
Making old things new: A unified algorithm for differentially private clustering
M.D. La Tour, M. Henzinger, D. Saulpic, in:, Proceedings of the 41st International Conference on Machine Learning, ML Research Press, 2024, pp. 12046–12086.
[Published Version] View | Download Published Version (ext.) | arXiv
 

Search

Filter Publications

Display / Sort

Citation Style: Default

Export / Embed