◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Peilin Zhong

4 papers here

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author1
  • last author3

Across the 4 of 4 papers where every author was matched, so the position is known.

fields
  • cs.DS3
  • cs.CR1
ORCID 0009-0001-1136-9538
same name
  • Peilin Zhong — 15 papers
  • Peilin Zhong — 7 papers
  • Peilin Zhong — 1 paper

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20232025
most citedParallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth

7 citations · 8 across the 4 of their papers we have counts for

collaborators

4 papers

cs.CR2025

Differentially Private Synthetic Data Release for Topics API Outputs

Travis Dick, Alessandro Epasto, Adel Javanmard +5

The analysis of the privacy properties of Privacy-Preserving Ads APIs is an area of research that has received strong interest from academics, industry, and regulators. Despite thi…

cs.DS2025

Differentially Private Space-Efficient Algorithms for Counting Distinct Elements in the Turnstile Model

Rachel Cummings, Alessandro Epasto, Jieming Mao +3

The turnstile continual release model of differential privacy captures scenarios where a privacy-preserving real-time analysis is sought for a dataset evolving through additions an…

cs.DS2024★ 7 cited

Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth

Arpit Agarwal, Sanjeev Khanna, Huan Li +4

We present a parallel algorithm for the (1−ε)-approximate maximum flow problem in capacitated, undirected graphs with n vertices and m edges, achieving $O(ε^{-3}\text{polylog…

cs.DS2023★ 1 cited

Near-Optimal k-Clustering in the Sliding Window Model

David P. Woodruff, Peilin Zhong, Samson Zhou

Clustering is an important technique for identifying structural information in large-scale data analysis, where the underlying dataset may be too large to store. In many applicatio…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.