4 papers · 1 filter
Differentially Private Matchings
Michael Dinitz, George Z. Li, Quanquan C. Liu +1
Computing matchings in graphs is a foundational algorithmic task. Despite extensive interest in differentially private (DP) graph analysis, work on privately computing matching sol…
Sublinear Space Graph Algorithms in the Continual Release Model
Alessandro Epasto, Quanquan C. Liu, Tamalika Mukherjee +1
The graph continual release model of differential privacy seeks to produce differentially private solutions to graph problems under a stream of edge updates where new private solut…
Pointwise Lipschitz Continuous Graph Algorithms
Quanquan C. Liu, Grigoris Velegkas, Yuichi Yoshida +1
In many real-world applications, it is undesirable to drastically change the problem solution after a small perturbation in the input, as unstable outputs can lead to costly transa…
Improved Massively Parallel Triangle Counting in Rounds
Quanquan C. Liu, C. Seshadhri
In this short note, we give a novel algorithm for round triangle counting in bounded arboricity graphs. Counting triangles in rounds (exactly) is listed as one of the…