Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Pan Peng

Pan Peng

2 indexed papers

Recent (6 mo)
2
With code
0
Influential cites
0
Benchmarked
0

Publications per year

2
26

Top categories

Algorithms×2Crypto×1

Frequent co-authors

Chenglin Fan1×
Jingcheng Liu1×
Hangyu Xu1×
Zongrui Zou1×
Sebastian Lüderssen1×
Stefan Neumann1×

Research Timeline

2026
Four-Cycle Counting in Low-Degeneracy Graph Streams

This paper proposes two algorithms for approximating the number of four-cycles in graph edge streams, improving upon existing theoretical bounds and handling non-concentrated four-cycles in one-pass.

Private Approximation of Graph Spectra and Cuts via Spectral Amplifiers

This paper presents a polynomial-time differentially private algorithm for releasing a synthetic graph that approximates cut sizes in an input graph with error bound.

Highlighted terms show continued research focus across papers

Papers

cs.DScs.CRTheoreticalRecentJul 21, 2026

Private Approximation of Graph Spectra and Cuts via Spectral Amplifiers

Chenglin Fan, Jingcheng Liu, Pan Peng, Hangyu Xu +1 more

This paper presents a polynomial-time differentially private algorithm for releasing a synthetic graph that approximates cut sizes in an input graph with error bound.

View →
cs.DSTheoreticalRecent
Jun 16, 2026

Four-Cycle Counting in Low-Degeneracy Graph Streams

Sebastian Lüderssen, Stefan Neumann, Pan Peng

This paper proposes two algorithms for approximating the number of four-cycles in graph edge streams, improving upon existing theoretical bounds and handling non-concentrated four-cycles in one-pass.

View →