Pan Peng (彭攀)
Pan Peng (彭攀)
Verified email at sheffield.ac.uk - Homepage
Title
Cited by
Cited by
Year
Testing cluster structure of graphs
A Czumaj, P Peng, C Sohler
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing …, 2015
312015
Improved Guarantees for Vertex Sparsification in Planar Graphs
G Goranci, M Henzinger, P Peng
SIAM Journal on Discrete Mathematics, 2020
242020
The small-community phenomenon in networks
A Li, P Peng
Mathematical Structures in Computer Science 22 (3), 373-407, 2012
202012
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
172018
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
172016
Community structures in classical network models
A Li, P Peng
Internet Mathematics 7 (2), 81-106, 2011
162011
Dynamic graph stream algorithms in o (n) space
Z Huang, P Peng
Algorithmica 81 (5), 1965-1987, 2019
152019
Estimating graph parameters from random order streams
P Peng, C Sohler
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
152018
The power of vertex sparsifiers in dynamic graph algorithms
G Goranci, M Henzinger, P Peng
25th Annual European Symposium on Algorithms (ESA 2017), 2017
152017
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
122017
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
112019
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
72019
Testing Conductance in General Graphs.
A Li, Y Pan, P Peng
Electron. Colloquium Comput. Complex. 18, 101, 2011
72011
Constant-Time Dynamic -Coloring
M Henzinger, P Peng
The 37th International Symposium on Theoretical Aspects of Computer Science …, 2020
62020
On constant-size graphs that preserve the local structure of high-girth graphs
H Fichtenberger, P Peng, C Sohler
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2015
62015
Average sensitivity of spectral clustering
P Peng, Y Yoshida
Proceedings of the 26th ACM SIGKDD International Conference on Knowledge …, 2020
52020
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
52019
Testable properties in general graphs and random order streaming
A Czumaj, H Fichtenberger, P Peng, C Sohler
arXiv preprint arXiv:1905.01644, 2019
52019
Sampling arbitrary subgraphs exactly uniformly in sublinear time
H Fichtenberger, M Gao, P Peng
arXiv preprint arXiv:2005.01861, 2020
42020
Testing Small Set Expansion in General Graphs
A Li, P Peng
32nd International Symposium on Theoretical Aspects of Computer Science, 2015
32015
The system can't perform the operation now. Try again later.
Articles 1–20