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

2024 | Published | Conference Paper | IST-REx-ID: 18156 | OA
Henzinger M, Sricharan AR, Steiner TA. Private counting of distinct elements in the turnstile model and extensions. In: International Conference on Approximation Algorithms for Combinatorial Optimization Problems . Vol 317. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.APPROX/RANDOM.2024.40
[Published Version] View | Files available | DOI | WoS | arXiv
 
2024 | Published | Conference Paper | IST-REx-ID: 18308 | OA
La Tour MD, Henzinger M, Saulpic D. Fully dynamic k-means coreset in near-optimal update time. In: 32nd Annual European Symposium on Algorithms. Vol 308. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.ESA.2024.100
[Published Version] View | Files available | DOI | WoS | arXiv
 
2024 | Published | Conference Paper | IST-REx-ID: 18309 | OA
Hu B, Kosinas E, Polak A. Connectivity oracles for predictable vertex failures. In: 32nd Annual European Symposium on Algorithms. Vol 308. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.ESA.2024.72
[Published Version] View | Files available | DOI | WoS | arXiv
 
2024 | Published | Conference Paper | IST-REx-ID: 18557 | OA
El-Hayek A, Henzinger M, Schmid S. Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes and adversarial edges. In: 38th International Symposium on Distributed Computing. Vol 319. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.DISC.2024.21
[Published Version] View | Files available | DOI | WoS | arXiv
 
2023 | Published | Conference Paper | IST-REx-ID: 12760 | OA
Henzinger M, Neumann S, Räcke H, Schmid S. Dynamic maintenance of monotone dynamic programs and applications. In: 40th International Symposium on Theoretical Aspects of Computer Science. Vol 254. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.STACS.2023.36
[Published Version] View | Files available | DOI | WoS | arXiv
 
earlier version | 2023 | Published | Conference Paper | IST-REx-ID: 13236 | OA
Zheng DW, Henzinger M. Multiplicative auction algorithm for approximate maximum weight bipartite matching. In: International Conference on Integer Programming and Combinatorial Optimization. Vol 13904. Springer Nature; 2023:453-465. doi:10.1007/978-3-031-32726-1_32
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2023 | Published | Journal Article | IST-REx-ID: 14043 | OA
Henzinger M, Jin B, Peng R, Williamson DP. A combinatorial cut-toggling algorithm for solving Laplacian linear systems. Algorithmica. 2023;85:2680-3716. doi:10.1007/s00453-023-01154-8
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2023 | Published | Conference Paper | IST-REx-ID: 14085 | OA
Goranci G, Henzinger M. Efficient data structures for incremental exact and approximate maximum flow. In: 50th International Colloquium on Automata, Languages, and Programming. Vol 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.ICALP.2023.69
[Published Version] View | Files available | DOI | arXiv
 
2023 | Published | Conference Paper | IST-REx-ID: 14086 | OA
Henzinger M, Liu P, Vondrák J, Zheng DW. Faster submodular maximization for several classes of matroids. In: 50th International Colloquium on Automata, Languages, and Programming. Vol 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.ICALP.2023.74
[Published Version] View | Files available | DOI | arXiv
 
2023 | Published | Conference Paper | IST-REx-ID: 14462 | OA
Fichtenberger H, Henzinger M, Upadhyay J. Constant matters: Fine-grained error bound on differentially private continual observation. In: Proceedings of the 40th International Conference on Machine Learning. Vol 202. ML Research Press; 2023:10072-10092.
[Published Version] View | Download Published Version (ext.) | arXiv
 
2023 | Published | Journal Article | IST-REx-ID: 14558
Bhattacharya S, Henzinger M, Nanongkai D, Wu X. Deterministic near-optimal approximation algorithms for dynamic set cover. SIAM Journal on Computing. 2023;52(5):1132-1192. doi:10.1137/21M1428649
View | DOI | WoS
 
2023 | Published | Conference Paper | IST-REx-ID: 14768 | OA
Cohen-Addad V, Saulpic D, Schwiegelshohn C. Deterministic clustering in high dimensional spaces: Sketches and approximation. In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science. IEEE; 2023:1105-1130. doi:10.1109/focs57990.2023.00066
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2023 | Published | Conference Paper | IST-REx-ID: 15364 | OA
Charikar M, Hu L, Henzinger M, Vötsch M, Waingarten E. Simple, scalable and effective clustering via one-dimensional projections. In: 37th Conference on Neural Information Processing Systems. Vol 36. Neural Information Processing Systems Foundation; 2023.
[Published Version] View | Files available | arXiv
 

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed