activity
20192022
most citedFast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering

2 citations · 3 across the 3 of their papers we have counts for

collaborators

5 papers

cs.DS2022

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…

cs.DS20212 cited

Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering

Yiqiu Wang, Shangdi Yu, Yan Gu +1

This paper presents new parallel algorithms for generating Euclidean minimum spanning trees and spatial clustering hierarchies (known as HDBSCAN). Our approach is based on gene…

cs.DS2020

A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem

Yiqiu Wang, Shangdi Yu, Yan Gu +1

We propose a theoretically-efficient and practical parallel batch-dynamic data structure for the closest pair problem. Our solution is based on a serial dynamic closest pair data s…

cs.SI2019

Analyzing the Spotify Top 200 Through a Point Process Lens

Michelangelo Harris, Brian Liu, Cean Park +6

Every generation throws a hero up the pop charts. For the current generation, one of the most relevant pop charts is the Spotify Top 200. Spotify is the world's largest music strea…

cs.SI20191 cited

Modeling and Analysis of Tagging Networks in Stack Exchange Communities

Xiang Fu, Shangdi Yu, Austin R. Benson

Large Question-and-Answer (Q&A) platforms support diverse knowledge curation on the Web. While researchers have studied user behavior on the platforms in a variety of contexts, the…