Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation

Authors

• 1. Rasmus Pagh (University of Copenhagen)
• 2. Lukas Retschmeier (University of Copenhagen)
• 3. Hao Wu (University of Waterloo)
• 4. Hanwen Zhang (University of Copenhagen)

@inproceedings{pagh_pods25,
        address = {New York, NY, USA},
        series = {{PODS} '25},
        title = {{Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation}},
        url = {https://dl.acm.org/doi/10.1145/3725240},
        doi = {10.1145/3725240},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Pagh, Rasmus and Retschmeier, Lukas and Wu, Hao and Zhang, Hanwen},
        year = {2025}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Semantically Similar Papers