10 citations · 12 across the 5 of their papers we have counts for
9 papers · 1 filter
Scalable Auction Algorithms for Bipartite Maximum Matching Problems
Quanquan C. Liu, Yiduo Ke, Samir Khuller
In this paper, we give new auction algorithms for maximum weighted bipartite matching (MWM) and maximum cardinality bipartite -matching (MCbM). Our algorithms run in $O\left(\lo…
The Predicted-Updates Dynamic Model: Offline, Incremental, and Decremental to Fully Dynamic Transformations
Quanquan C. Liu, Vaidehi Srinivas
We formulate the predicted-updates dynamic model, one of the first beyond-worst-case models for dynamic algorithms, which generalizes a large set of well-studied dynamic models inc…
Triangle Counting with Local Edge Differential Privacy
Talya Eden, Quanquan C. Liu, Sofya Raskhodnikova +1
Many deployments of differential privacy in industry are in the local model, where each party releases its private information via a differentially private randomizer. We study tri…
An Algorithmic Approach to Address Course Enrollment Challenges
Arpita Biswas, Yiduo Ke, Samir Khuller +1
Massive surges of enrollments in courses have led to a crisis in several computer science departments - not only is the demand for certain courses extremely high from majors, but t…
Differential Privacy from Locally Adjustable Graph Algorithms: -Core Decomposition, Low Out-Degree Ordering, and Densest Subgraphs
Laxman Dhulipala, Quanquan C. Liu, Sofya Raskhodnikova +3
Differentially private algorithms allow large-scale data analytics while preserving user privacy. Designing such algorithms for graph data is gaining importance with the growth of…
Near-Optimal Distributed Implementations of Dynamic Algorithms for Symmetry-Breaking Problems
Shiri Antaki, Quanquan C. Liu, Shay Solomon
The field of dynamic graph algorithms aims at achieving a thorough understanding of real-world networks whose topology evolves with time. Traditionally, the focus has been on the c…