8 papers
Parameter-Free Triangle Counting
Asaf Etgar, Anna Gilbert, Quanquan Liu +1
Given an undirected, unweighted graph with vertices and edges, the triangle counting problem seeks the number of three-cycles in it. Triangle and subgraph count…
LAPRAS : Learning-Augmented PRivate Answering for linear query Streams
Pranay Mundra, Adam Sealfon, Ziteng Sun +1
Modern database workloads are highly predictable: query streams are dominated by recurring jobs and templates, even when their arrival order is not known in advance. This motivates…
ParEVO: Synthesizing Code for Irregular Data: High-Performance Parallelism through Agentic Evolution
Liu Yang, Zeyu Nie, Andrew Liu +4
The transition from sequential to parallel computing is essential for modern high-performance applications but is hindered by the steep learning curve of concurrent programming. Th…
Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold Mechanism
Laxman Dhulipala, Monika Henzinger, George Z. Li +3
Many differentially private and classical non-private graph algorithms rely crucially on determining whether some property of each vertex meets a threshold. For example, for the $k…
Practical and Accurate Local Edge Differentially Private Graph Algorithms
Pranay Mundra, Charalampos Papamanthou, Julian Shun +1
The rise of massive networks across diverse domains necessitates sophisticated graph analytics, often involving sensitive data and raising privacy concerns. This paper addresses th…
Parallel -Core Decomposition with Batched Updates and Asynchronous Reads
Quanquan C. Liu, Julian Shun, Igor Zablotchi
Maintaining a dynamic -core decomposition is an important problem that identifies dense subgraphs in dynamically changing graphs. Recent work by Liu et al. [SPAA 2022] presents…
Near-Optimal Differentially Private k-Core Decomposition
Laxman Dhulipala, George Z. Li, Quanquan C. Liu
Recent work by Dhulipala et al. \cite{DLRSSY22} initiated the study of the -core decomposition problem under differential privacy via a connection between low round/depth distri…
Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs
Pattara Sukprasert, Quanquan C. Liu, Laxman Dhulipala +1
The densest subgraph problem has received significant attention, both in theory and in practice, due to its applications in problems such as community detection, social network ana…