ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2402.18020
  4. Cited By
Tighter Bounds for Local Differentially Private Core Decomposition and
  Densest Subgraph

Tighter Bounds for Local Differentially Private Core Decomposition and Densest Subgraph

28 February 2024
Monika Henzinger
A. Sricharan
Leqi Zhu
ArXivPDFHTML

Papers citing "Tighter Bounds for Local Differentially Private Core Decomposition and Densest Subgraph"

2 / 2 papers shown
Title
Near-Optimal Differentially Private k-Core Decomposition
Near-Optimal Differentially Private k-Core Decomposition
Laxman Dhulipala
George Z. Li
Quanquan C. Liu
17
5
0
12 Dec 2023
Triangle Counting with Local Edge Differential Privacy
Triangle Counting with Local Edge Differential Privacy
T. Eden
Quanquan C. Liu
Sofya Raskhodnikova
Adam D. Smith
68
12
0
03 May 2023
1