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.
35 Publications
2025 | Published | Conference Paper | IST-REx-ID: 19038 | 
Henzinger, Monika, and Jalaj Upadhyay. “Improved Differentially Private Continual Observation Using Group Algebra.” Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 5, Association for Computing Machinery, 2025, pp. 2951–70, doi:10.1137/1.9781611978322.95.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 20301 |
Henzinger, Monika, et al. “Differentially Private Continual Release of Histograms and Related Queries.” The 28th International Conference on Artificial Intelligence and Statistics, vol. 258, ML Research Press, 2025, pp. 1990–98.
[Preprint]
View
| Download Preprint (ext.)
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 15121 |
Zheng, Da Wei, and Monika Henzinger. “Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching.” Mathematical Programming, vol. 210, Springer Nature, 2025, pp. 881–94, doi:10.1007/s10107-024-02066-3.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 19858 |
El-Hayek, Antoine, et al. “On B-Matching and Fully-Dynamic Maximum k-Edge Coloring.” 4th Symposium on Algorithmic Foundations of Dynamic Networks, vol. 330, 4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.SAND.2025.4.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 20052 |
Breitkopf, Tom-Lukas, et al. “Brief Announcement: Minimizing Energy Solves Relative Majority with a Cubic Number of States in Population Protocols.” Proceedings of the ACM Symposium on Principles of Distributed Computing, ACM, 2025, pp. 549–52, doi:10.1145/3732772.3733512.
[Published Version]
View
| Files available
| DOI
| WoS
2025 | Published | Conference Paper | IST-REx-ID: 20051 |
El-Hayek, Antoine, et al. “An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model.” Proceedings of the ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2025, doi:10.1145/3732772.3733505.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 20535 |
Dhulipala, Laxman, et al. “Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold Mechanism.” 33rd Annual European Symposium on Algorithms, vol. 351, 91, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.ESA.2025.91.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 20536 |
Safavi Hemami, Roodabeh, and Martin P. Seybold. “B-Treaps Revised: Write Efficient Randomized Block Search Trees with High Load.” 19th International Symposium on Algorithms and Data Structures, vol. 349, 47, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.WADS.2025.47.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 20534 |
Henzinger, Monika, et al. “Efficient Contractions of Dynamic Graphs - with Applications.” 33rd Annual European Symposium on Algorithms, vol. 351, 36, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.ESA.2025.36.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 20533 |
Henzinger, Monika, and Roodabeh Safavi Hemami. “Securing Dynamic Data: A Primer on Differentially Private Data Structures.” 33rd Annual European Symposium on Algorithms, vol. 351, 2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.ESA.2025.2.
[Published Version]
View
| Files available
| DOI
2024 | Published | Conference Paper | IST-REx-ID: 18115 |
Axiotis, Kyriakos, et al. “Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond.” Proceedings of the 41st International Conference on Machine Learning, vol. 235, ML Research Press, 2024, pp. 2086–107.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 15253 |
Henzinger, Monika, et al. “A Unifying Framework for Differentially Private Sums under Continual Observation.” Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 2024, Society for Industrial and Applied Mathematics, 2024, pp. 995–1018, doi:10.1137/1.9781611977912.38.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 14769 |
Henzinger, Monika, et al. “Experimental Evaluation of Fully Dynamic K-Means via Coresets.” 2024 Proceedings of the Symposium on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2024, pp. 220–33, doi:10.1137/1.9781611977929.17.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 18116 |
La Tour, Max Dupré, et al. “Making Old Things New: A Unified Algorithm for Differentially Private Clustering.” Proceedings of the 41st International Conference on Machine Learning, vol. 235, ML Research Press, 2024, pp. 12046–86.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 15093 |
Cultrera di Montesano, Sebastiano, et al. “Dynamically Maintaining the Persistent Homology of Time Series.” Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), edited by David P. Woodruff, Society for Industrial and Applied Mathematics, 2024, pp. 243–95, doi:10.1137/1.9781611977912.11.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 19512 |
Andersson, Joel Daniel, et al. “Continual Counting with Gradual Privacy Expiration.” 38th Conference on Neural Information Processing Systems, vol. 37, Neural Information Processing Systems Foundation, 2024.
[Preprint]
View
| Download Preprint (ext.)
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 18503 |
Henzinger, Monika, et al. “Deterministic Near-Linear Time Minimum Cut in Weighted Graphs.” 35th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2024, pp. 3089–139, doi:10.1137/1.9781611977912.111.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 15008 |
Goranci, Gramoz, et al. “Electrical Flows for Polylogarithmic Competitive Oblivious Routing.” 15th Innovations in Theoretical Computer Science Conference, vol. 287, 55, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.ITCS.2024.55.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 | Published | Journal Article | IST-REx-ID: 17188 |
Braun, Pirmin, et al. “Delegated Online Search.” Artificial Intelligence, vol. 334, 104171, Elsevier, 2024, doi:10.1016/j.artint.2024.104171.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 18906 |
Hanauer, Kathrin, et al. “Expander Hierarchies for Normalized Cuts on Graphs.” Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, ACM, 2024, pp. 1016–27, doi:10.1145/3637528.3671978.
[Published Version]
View
| Files available
| DOI
| WoS