2 Publications

Mark all

[2]
2025 | Published | Conference Paper | IST-REx-ID: 20535 | OA
Dhulipala, Laxman, Monika Henzinger, George Z. Li, Quanquan C. Liu, A. R. Sricharan, and Leqi Zhu. “Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold Mechanism.” In 33rd Annual European Symposium on Algorithms, Vol. 351. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.ESA.2025.91.
[Published Version] View | Files available | DOI | arXiv
 
[1]
2023 | Published | Journal Article | IST-REx-ID: 14364 | OA
Alistarh, Dan-Adrian, James Aspnes, Faith Ellen, Rati Gelashvili, and Leqi Zhu. “Why Extension-Based Proofs Fail.” SIAM Journal on Computing. Society for Industrial and Applied Mathematics, 2023. https://doi.org/10.1137/20M1375851.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed

Grants


2 Publications

Mark all

[2]
2025 | Published | Conference Paper | IST-REx-ID: 20535 | OA
Dhulipala, Laxman, Monika Henzinger, George Z. Li, Quanquan C. Liu, A. R. Sricharan, and Leqi Zhu. “Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold Mechanism.” In 33rd Annual European Symposium on Algorithms, Vol. 351. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.ESA.2025.91.
[Published Version] View | Files available | DOI | arXiv
 
[1]
2023 | Published | Journal Article | IST-REx-ID: 14364 | OA
Alistarh, Dan-Adrian, James Aspnes, Faith Ellen, Rati Gelashvili, and Leqi Zhu. “Why Extension-Based Proofs Fail.” SIAM Journal on Computing. Society for Industrial and Applied Mathematics, 2023. https://doi.org/10.1137/20M1375851.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed