Seguir
Pan Peng (彭攀)
Pan Peng (彭攀)
E-mail confirmado em ustc.edu.cn - Página inicial
Título
Citado por
Citado por
Ano
Testing cluster structure of graphs
A Czumaj, P Peng, C Sohler
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing …, 2015
522015
Improved Guarantees for Vertex Sparsification in Planar Graphs
G Goranci, M Henzinger, P Peng
SIAM Journal on Discrete Mathematics, 2020
442020
Estimating graph parameters from random order streams
P Peng, C Sohler
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
292018
Average sensitivity of spectral clustering
P Peng, Y Yoshida
Proceedings of the 26th ACM SIGKDD international conference on knowledge …, 2020
282020
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
272018
Relating two property testing models for bounded degree directed graphs
A Czumaj, P Peng, C Sohler
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
262016
Testable bounded degree graph properties are random order streamable
M Monemizadeh, S Muthukrishnan, P Peng, C Sohler
44th International Colloquium on Automata, Languages, and Programming, ICALP …, 2017
242017
Dynamic Graph Stream Algorithms in o(n) Space
Z Huang, P Peng
Algorithmica 81, 1965-1987, 2019
232019
The power of vertex sparsifiers in dynamic graph algorithms
G Goranci, M Henzinger, P Peng
25th Annual European Symposium on Algorithms (ESA 2017), 2017
232017
Constant-Time Dynamic -Coloring
M Henzinger, P Peng
The 37th International Symposium on Theoretical Aspects of Computer Science …, 2020
222020
Community structures in classical network models
A Li, P Peng
Internet Mathematics 7 (2), 81-106, 2011
222011
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
The small-community phenomenon in networks
A Li, P Peng
Mathematical Structures in Computer Science 22 (3), 373-407, 2012
202012
Local algorithms for estimating effective resistance
P Peng, D Lopatta, Y Yoshida, G Goranci
Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data …, 2021
192021
Sampling arbitrary subgraphs exactly uniformly in sublinear time
H Fichtenberger, M Gao, P Peng
arXiv preprint arXiv:2005.01861, 2020
182020
Runtime analysis of randomized search heuristics for dynamic graph coloring
J Bossek, F Neumann, P Peng, D Sudholt
Proceedings of the Genetic and Evolutionary Computation Conference, 1443-1451, 2019
182019
Mixed-order spectral clustering for complex networks
Y Ge, P Peng, H Lu
Pattern Recognition 117, 107964, 2021
172021
Robust clustering oracle and local reconstructor of cluster structure of graphs
P Peng
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
132020
Testable properties in general graphs and random order streaming
A Czumaj, H Fichtenberger, P Peng, C Sohler
arXiv preprint arXiv:1905.01644, 2019
132019
Spectral concentration and greedy k-clustering
TK Dey, P Peng, A Rossi, A Sidiropoulos
Computational Geometry 76, 19-32, 2019
102019
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20