Follow
Pan Peng (彭攀)
Pan Peng (彭攀)
Verified email at ustc.edu.cn - Homepage
Title
Cited by
Year
A Differentially Private Clustering Algorithm for Well-Clustered Graphs
W He, H Fichtenberger, P Peng
arXiv preprint arXiv:2403.14332, 2024
2024
A local algorithm for finding dense bipartite-like subgraphs
P Peng
International Computing and Combinatorics Conference, 145-156, 2012
22012
A sublinear-time spectral clustering oracle with improved preprocessing time
R Shen, P Peng
Advances in Neural Information Processing Systems 36, 2024
2024
An Optimal Separation Between Two Property Testing Models for Bounded Degree Directed Graphs
P Peng, Y Wang
arXiv preprint arXiv:2305.13089, 2023
2023
Approximately Counting Subgraphs in Data Streams
H Fichtenberger, P Peng
Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2022
12022
Augmenting the algebraic connectivity of graphs
BA Manghiuc, P Peng, H Sun
arXiv preprint arXiv:2006.14449, 2020
32020
Average sensitivity of spectral clustering
P Peng, Y Yoshida
Proceedings of the 26th ACM SIGKDD international conference on knowledge …, 2020
252020
Community structures in classical network models
A Li, P Peng
Internet Mathematics 7 (2), 81-106, 2011
222011
Constant-Time Dynamic -Coloring and Weight Approximation for Minimum Spanning Forest: Dynamic Algorithms Meet Property Testing
M Henzinger, P Peng
arXiv preprint arXiv:1907.04745, 2019
32019
Constant-Time Dynamic -Coloring
M Henzinger, P Peng
The 37th International Symposium on Theoretical Aspects of Computer Science …, 2020
202020
Constant-time dynamic weight approximation for minimum spanning forest
M Henzinger, P Peng
Information and Computation 281, 104805, 2021
22021
Detecting and characterizing small dense bipartite-like subgraphs by the bipartiteness ratio measure
A Li, P Peng
International Symposium on Algorithms and Computation, 655-665, 2013
42013
Dynamic effective resistances and approximate schur complement on separable graphs
G Goranci, M Henzinger, P Peng
Proceedings of the 26th European Symposium on Algorithms (ESA 2018), 2018
262018
Dynamic Graph Stream Algorithms in o(n) Space
Z Huang, P Peng
Algorithmica 81, 1965-1987, 2019
232019
Editor’s Note: Special Issue on Genetic and Evolutionary Computation
M Up-Drift, B Doerr, T Kötzing, CD Doerr, J Lengler, J Bossek, F Neumann, ...
Algorithmica 83, 3015-3016, 2021
2021
Effective Resistances in Non-Expander Graphs
D Cai, X Chen, P Peng
arXiv preprint arXiv:2307.01218, 2023
12023
Equilibrium games in networks
A Li, X Zhang, Y Pan, P Peng
Physica A: Statistical Mechanics and its Applications 416, 49-60, 2014
12014
Estimating graph parameters from random order streams
P Peng, C Sohler
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
282018
Every testable (infinite) property of bounded-degree graphs contains an infinite hyperfinite subproperty
H Fichtenberger, P Peng, C Sohler
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
202019
Global core, and galaxy structure of networks
W Zhang, YC Pan, P Peng, JK Li, XC Li, AS Li
Science China Information Sciences 57, 1-20, 2014
12014
The system can't perform the operation now. Try again later.
Articles 1–20