Pan Peng (彭攀)
I am a faculty member (特任教授) in the School of Computer Science and Technology of University of Science and Technology of China (USTC).
I was a long-term participant at UC Berkeley's Simons Institute program in Sublinear Algorithms. I was a lecturer (assistant professor) in the Department of Computer Science at University of Sheffield, UK. Before that, I held postdoc positions of TU Dortmund, Germany at the research group of Prof. Christian Sohler and University of Vienna, Austria at the research group of Prof. Monika Henzinger. I got my Ph.D under supervision of Prof. Angsheng Li, in the Institute of Software, Chinese Academy of Sciences in 2013. I received my bachelor degree in Mathematics from Beijing Normal University in 2007.
My research interests lie at the intersection of theoretical computer science, network science, and data science. Currently, I am focused on sublinear algorithms, graph algorithms, and the privacy and robustness of algorithms. I am also interested in the intersections of these algorithmic areas with quantum computing and large language models (LLMs).
Publications:
Conference Publications:
Quantum Property Testing for Bounded-Degree Directed Graphs.
Pan Peng, Jingyu Wu.
In the 38th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2027). Arxiv Version.
Pan Peng, Jingyu Wu.
In the 38th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2027). Arxiv Version.
Low-Sensitivity Algorithms for the Maximum Cut Problem.
Weiqiang He, Pan Peng, Yuichi Yoshida.
In the 38th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2027).
Weiqiang He, Pan Peng, Yuichi Yoshida.
In the 38th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2027).
Private Approximation of Graph Spectra and Cuts via Spectral Amplifiers.
Chenglin Fan, Jingcheng Liu, Pan Peng, Hangyu Xu, Zongrui Zou.
In the 38th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2027). Arxiv Version.
Chenglin Fan, Jingcheng Liu, Pan Peng, Hangyu Xu, Zongrui Zou.
In the 38th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2027). Arxiv Version.
Learning-Augmented Streaming Algorithms for Approximating Boolean Max-CSPs.
Yinhao Dong, Pan Peng, Ali Vakilian, Santhoshini Velusamy, Xiaoyang Xu.
In the fortieth Conference on Neural Information Processing Systems (NeurIPS 2026).
Yinhao Dong, Pan Peng, Ali Vakilian, Santhoshini Velusamy, Xiaoyang Xu.
In the fortieth Conference on Neural Information Processing Systems (NeurIPS 2026).
Streaming Max-Cut in General Metrics.
Shaofeng H.-C. Jiang, Pan Peng, Haoze Wang.
In the 37th International Symposium on Algorithms and Computation (ISAAC 2026). Arxiv Version.
Shaofeng H.-C. Jiang, Pan Peng, Haoze Wang.
In the 37th International Symposium on Algorithms and Computation (ISAAC 2026). Arxiv Version.
Sublinear-Time Algorithms for Diagonally Dominant Systems and Applications to the Friedkin-Johnsen Model.
Weiming Feng, Zelin Li, Pan Peng.
In International Computing and Combinatorics Conference (COCOON 2026). Arxiv Version.
Weiming Feng, Zelin Li, Pan Peng.
In International Computing and Combinatorics Conference (COCOON 2026). Arxiv Version.
Sublinear Algorithms for Estimating Single-Linkage Clustering Costs.
Pan Peng, Christian Sohler, Yi Xu.
In European Symposium on Algorithms (ESA 2026). Arxiv Version.
Pan Peng, Christian Sohler, Yi Xu.
In European Symposium on Algorithms (ESA 2026). Arxiv Version.
Four-Cycle Counting in Low-Degeneracy Graph Streams.
Sebastian Lüderssen, Stefan Neumann, and Pan Peng.
In the 32nd ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (KDD 2026). Arxiv Version.
Sebastian Lüderssen, Stefan Neumann, and Pan Peng.
In the 32nd ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (KDD 2026). Arxiv Version.
Quantum Algorithms for Triangle Cut Sparsification.
Shan Jiang, Pan Peng.
In the International Conference on Machine Learning (ICML 2026). Arxiv Version.
Shan Jiang, Pan Peng.
In the International Conference on Machine Learning (ICML 2026). Arxiv Version.
Differentially Private Range Subgraph Counting.
Xian Chen, Ruobing Bai, Pan Peng.
In the International Conference on Machine Learning (ICML 2026). Arxiv Version.
Xian Chen, Ruobing Bai, Pan Peng.
In the International Conference on Machine Learning (ICML 2026). Arxiv Version.
Local Computation Algorithms for (Minimum) Spanning Trees on Expander Graphs.
Pan Peng, Yuyang Wang.
In the International Colloquium on Automata, Languages, and Programming (ICALP 2026). Arxiv Version.
Pan Peng, Yuyang Wang.
In the International Colloquium on Automata, Languages, and Programming (ICALP 2026). Arxiv Version.
An Exponential Lower Bound for Spectral Density Estimation on Unweighted Graphs.
Pan Peng, Yuyang Wang, Qiping Yang and Yichun Yang.
In the Conference on Learning Theory (COLT 2026). Arxiv Version.
Pan Peng, Yuyang Wang, Qiping Yang and Yichun Yang.
In the Conference on Learning Theory (COLT 2026). Arxiv Version.
Sublinear Spectral Clustering Oracle with Little Memory.
Ranran Shen, Xiaoyi Zhu, Pan Peng, Zengfeng Huang.
In the fourteenth International Conference on Learning Representations (ICLR 2026). Link. Arxiv Version.
Ranran Shen, Xiaoyi Zhu, Pan Peng, Zengfeng Huang.
In the fourteenth International Conference on Learning Representations (ICLR 2026). Link. Arxiv Version.
Near-Optimal Four-Cycle Counting in Graph Streams.
Sebastian Lüderssen, Stefan Neumann, Pan Peng.
In the 37th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2026). DOI. Arxiv Version.
Sebastian Lüderssen, Stefan Neumann, Pan Peng.
In the 37th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2026). DOI. Arxiv Version.
Learning-Augmented Streaming Algorithms for Correlation Clustering.
Yinhao Dong, Shan Jiang, Shi Li, Pan Peng.
In the thirty-ninth Conference on Neural Information Processing Systems (NeurIPS 2025). Arxiv Version.
Yinhao Dong, Shan Jiang, Shi Li, Pan Peng.
In the thirty-ninth Conference on Neural Information Processing Systems (NeurIPS 2025). Arxiv Version.
Testing Some First-Order Logic Properties on Sparse Graphs.
Pan Peng, Kefan Yu.
In International Computing and Combinatorics Conference (COCOON 2025). DOI.
Pan Peng, Kefan Yu.
In International Computing and Combinatorics Conference (COCOON 2025). DOI.
Differentially Private Synthetic Graphs Preserving Triangle-Motif Cuts.
Pan Peng, Hangyu Xu.
In the 38th Annual Conference on Learning Theory (COLT 2025). Arxiv Version.
Pan Peng, Hangyu Xu.
In the 38th Annual Conference on Learning Theory (COLT 2025). Arxiv Version.
Average Sensitivity of Hierarchical $k$-Median Clustering.
Shijie Li, Weiqiang He, Ruobing Bai, Pan Peng.
In the 42nd International Conference on Machine Learning (ICML 2025). Arxiv Version.
Shijie Li, Weiqiang He, Ruobing Bai, Pan Peng.
In the 42nd International Conference on Machine Learning (ICML 2025). Arxiv Version.
Learning-Augmented Streaming Algorithms for Approximating MAX-CUT.
Yinhao Dong, Pan Peng, Ali Vakilian.
In 16th Innovations in Theoretical Computer Science Conference (ITCS 2025). Arxiv Version.
Yinhao Dong, Pan Peng, Ali Vakilian.
In 16th Innovations in Theoretical Computer Science Conference (ITCS 2025). Arxiv Version.
A Differentially Private Clustering Algorithm for Well-Clustered Graphs.
Weiqiang He, Hendrik Fichtenberger, Pan Peng.
In the twelfth International Conference on Learning Representations (ICLR 2024). Arxiv Version.
Weiqiang He, Hendrik Fichtenberger, Pan Peng.
In the twelfth International Conference on Learning Representations (ICLR 2024). Arxiv Version.
Sublinear-Time Opinion Estimation in the Friedkin–Johnsen Model.
Stefan Neumann, Yinhao Dong, and Pan Peng.
In the 2024 ACM Web Conference (WebConf, formerly WWW 2024). Arxiv Version.
Stefan Neumann, Yinhao Dong, and Pan Peng.
In the 2024 ACM Web Conference (WebConf, formerly WWW 2024). Arxiv Version.
A Sublinear-Time Spectral Clustering Oracle with Improved Preprocessing Time.
Ranran Shen, Pan Peng.
In the thirty-seventh Conference on Neural Information Processing Systems (NeurIPS 2023). Arxiv Version.
Ranran Shen, Pan Peng.
In the thirty-seventh Conference on Neural Information Processing Systems (NeurIPS 2023). Arxiv Version.
Recovering Unbalanced Communities in the Stochastic Block Model with Application to Clustering with a Faulty Oracle.
Chandra Sekhar Mukherjee, Pan Peng, Jiapeng Zhang.
In the thirty-seventh Conference on Neural Information Processing Systems (NeurIPS 2023). Arxiv Version.
Chandra Sekhar Mukherjee, Pan Peng, Jiapeng Zhang.
In the thirty-seventh Conference on Neural Information Processing Systems (NeurIPS 2023). Arxiv Version.
Sublinear-Time Algorithms for Max Cut, Max E2Lin$(q)$, and Unique Label Cover on Expanders.
Pan Peng, Yuichi Yoshida.
In the 34th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023). Arxiv Version.
Pan Peng, Yuichi Yoshida.
In the 34th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023). Arxiv Version.
An Optimal Separation Between Two Property Testing Models for Bounded Degree Directed Graphs.
Pan Peng, Yuyang Wang.
In the 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Arxiv Version.
Pan Peng, Yuyang Wang.
In the 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Arxiv Version.
Massively Parallel Algorithms for the Stochastic Block Model.
Zelin Li, Pan Peng, Xianbin Zhu.
In the 31st Annual European Symposium on Algorithms (ESA 2023). Arxiv Version.
Zelin Li, Pan Peng, Xianbin Zhu.
In the 31st Annual European Symposium on Algorithms (ESA 2023). Arxiv Version.
Effective Resistances in Non-Expander Graphs.
Dongrun Cai, Xue Chen, Pan Peng.
In the 31st Annual European Symposium on Algorithms (ESA 2023). Arxiv Version.
Dongrun Cai, Xue Chen, Pan Peng.
In the 31st Annual European Symposium on Algorithms (ESA 2023). Arxiv Version.
Sublinear-Time Clustering Oracle for Signed Graphs.
Stefan Neumann, Pan Peng.
In the 39th International Conference on Machine Learning (ICML 2022). Arxiv Version.
(Accepted for long presentation.)
Stefan Neumann, Pan Peng.
In the 39th International Conference on Machine Learning (ICML 2022). Arxiv Version.
(Accepted for long presentation.)
Approximately Counting Subgraphs in Data Streams.
Hendrik Fichtenberger, Pan Peng.
In the 41st ACM Symposium on Principles of Database Systems (PODS 2022). Arxiv Version.
Hendrik Fichtenberger, Pan Peng.
In the 41st ACM Symposium on Principles of Database Systems (PODS 2022). Arxiv Version.
Local Algorithms for Estimating Effective Resistance.
Pan Peng, Daniel Lopatta, Yuichi Yoshida, Gramoz Goranci.
In the 27th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (KDD 2021). Arxiv Version.
Pan Peng, Daniel Lopatta, Yuichi Yoshida, Gramoz Goranci.
In the 27th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (KDD 2021). Arxiv Version.
Towards a Query-Optimal and Time-Efficient Algorithm for Clustering with a Faulty Oracle.
Pan Peng, Jiapeng Zhang.
In the 34th Annual Conference on Learning Theory (COLT 2021). Arxiv Version.
Pan Peng, Jiapeng Zhang.
In the 34th Annual Conference on Learning Theory (COLT 2021). Arxiv Version.
GSF-Locality Is Not Sufficient for Proximity-Oblivious Testing.
Isolde Adler, Noleen Köhler, Pan Peng.
In the Computational Complexity Conference (CCC 2021). Arxiv Version.
See the comments in Oded Goldreich's Choices #304.
Isolde Adler, Noleen Köhler, Pan Peng.
In the Computational Complexity Conference (CCC 2021). Arxiv Version.
See the comments in Oded Goldreich's Choices #304.
On Testability of First-Order Properties in Bounded-Degree Graphs.
Isolde Adler, Noleen Köhler, Pan Peng.
In the 32nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021). Arxiv Version.
Isolde Adler, Noleen Köhler, Pan Peng.
In the 32nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021). Arxiv Version.
Augmenting the Algebraic Connectivity of Graphs.
Bogdan Manghiuc, Pan Peng, He Sun.
In Proceedings of the 28th European Symposium on Algorithms (ESA 2020). Arxiv Version.
Bogdan Manghiuc, Pan Peng, He Sun.
In Proceedings of the 28th European Symposium on Algorithms (ESA 2020). Arxiv Version.
Testable Properties in General Graphs and Random Order Streaming.
Artur Czumaj, Hendrik Fichtenberger, Pan Peng, Christian Sohler.
In the 24th International Conference on Randomization and Computation (RANDOM 2020). Arxiv Version.
Artur Czumaj, Hendrik Fichtenberger, Pan Peng, Christian Sohler.
In the 24th International Conference on Randomization and Computation (RANDOM 2020). Arxiv Version.
Average Sensitivity of Spectral Clustering.
Pan Peng and Yuichi Yoshida.
In the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (KDD 2020). Arxiv Version.
Pan Peng and Yuichi Yoshida.
In the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (KDD 2020). Arxiv Version.
Sampling Arbitrary Subgraphs Exactly Uniformly in Sublinear Time.
Hendrik Fichtenberger, Mingze Gao and Pan Peng.
In the 47th International Colloquium on Automata, Languages and Programming (ICALP 2020). Arxiv Version.
Hendrik Fichtenberger, Mingze Gao and Pan Peng.
In the 47th International Colloquium on Automata, Languages and Programming (ICALP 2020). Arxiv Version.
More Effective Randomized Search Heuristics for Graph Coloring Through Dynamic Optimization.
Jakob Bossek, Frank Neumann, Pan Peng and Dirk Sudholt.
In the Genetic and Evolutionary Computation Conference (GECCO 2020). Arxiv Version.
Jakob Bossek, Frank Neumann, Pan Peng and Dirk Sudholt.
In the Genetic and Evolutionary Computation Conference (GECCO 2020). Arxiv Version.
Constant-Time Dynamic $(\Delta+1)$-Coloring.
Monika Henzinger, Pan Peng.
In the 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Part I of Arxiv Version.
Monika Henzinger, Pan Peng.
In the 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Part I of Arxiv Version.
Robust Clustering Oracle and Local Reconstructor of Cluster Structure of Graphs.
Pan Peng.
In the 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2020). Arxiv Version.
Pan Peng.
In the 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2020). Arxiv Version.
Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring.
Jakob Bossek, Frank Neumann, Pan Peng and Dirk Sudholt.
In the Genetic and Evolutionary Computation Conference (GECCO 2019). DOI.
Jakob Bossek, Frank Neumann, Pan Peng and Dirk Sudholt.
In the Genetic and Evolutionary Computation Conference (GECCO 2019). DOI.
Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty.
Hendrik Fichtenberger, Pan Peng and Christian Sohler.
In the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019). Arxiv Version.
Hendrik Fichtenberger, Pan Peng and Christian Sohler.
In the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019). Arxiv Version.
Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs.
Gramoz Goranci, Monika Henzinger, Pan Peng.
In Proceedings of the 26th European Symposium on Algorithms (ESA 2018). Arxiv Version.
Gramoz Goranci, Monika Henzinger, Pan Peng.
In Proceedings of the 26th European Symposium on Algorithms (ESA 2018). Arxiv Version.
Estimating Graph Parameters from Random Order Streams.
Pan Peng, Christian Sohler.
In the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018). Arxiv Version.
Pan Peng, Christian Sohler.
In the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018). Arxiv Version.
The Power of Vertex Sparsifiers in Dynamic Graph Algorithms.
Gramoz Goranci, Monika Henzinger, Pan Peng.
In the 25th Annual European Symposium on Algorithms (ESA 2017). Arxiv Version.
Gramoz Goranci, Monika Henzinger, Pan Peng.
In the 25th Annual European Symposium on Algorithms (ESA 2017). Arxiv Version.
Improved Guarantees for Vertex Sparsification in Planar Graphs.
Gramoz Goranci, Monika Henzinger, Pan Peng.
In the 25th Annual European Symposium on Algorithms (ESA 2017). Arxiv Version.
Gramoz Goranci, Monika Henzinger, Pan Peng.
In the 25th Annual European Symposium on Algorithms (ESA 2017). Arxiv Version.
Testable Bounded Degree Graph Properties Are Random Order Streamable.
Morteza Monemizadeh, S. Muthukrishnan, Pan Peng and Christian Sohler.
In the 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Arxiv Version.
Morteza Monemizadeh, S. Muthukrishnan, Pan Peng and Christian Sohler.
In the 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Arxiv Version.
Dynamic Graph Stream Algorithms in o(n) Space.
Zengfeng Huang, Pan Peng.
In the 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Arxiv Version.
Zengfeng Huang, Pan Peng.
In the 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Arxiv Version.
Relating Two Property Testing Models for Bounded Degree Directed Graphs.
Artur Czumaj, Pan Peng, Christian Sohler.
In 48th ACM Symposium on Theory of Computing (STOC 2016). DOI. Arxiv Version.
Artur Czumaj, Pan Peng, Christian Sohler.
In 48th ACM Symposium on Theory of Computing (STOC 2016). DOI. Arxiv Version.
On Constant Size Graphs That Preserve the Local Structure of High Girth Graphs.
Hendrik Fichtenberger, Pan Peng and Christian Sohler.
In the 19th International Workshop on Randomization and Computation (RANDOM'2015). DOI.
Hendrik Fichtenberger, Pan Peng and Christian Sohler.
In the 19th International Workshop on Randomization and Computation (RANDOM'2015). DOI.
Testing Cluster Structure of Graphs.
Artur Czumaj, Pan Peng, Christian Sohler.
In 47th ACM Symposium on Theory of Computing (STOC 2015). Arxiv Version.
Artur Czumaj, Pan Peng, Christian Sohler.
In 47th ACM Symposium on Theory of Computing (STOC 2015). Arxiv Version.
Testing Small Set Expansion in General Graphs.
Angsheng Li, Pan Peng.
In 32nd Symposium on Theoretical Aspects of Computer Science (STACS 2015). Arxiv Version.
Angsheng Li, Pan Peng.
In 32nd Symposium on Theoretical Aspects of Computer Science (STACS 2015). Arxiv Version.
Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure.
Angsheng Li, Pan Peng.
In 24th International Symposium on Algorithms and Computation (ISAAC 2013). Arxiv Version.
Angsheng Li, Pan Peng.
In 24th International Symposium on Algorithms and Computation (ISAAC 2013). Arxiv Version.
A Local Algorithm for Finding Dense Bipartite-Like Subgraphs.
Pan Peng.
In 18th Annual International Computing and Combinatorics Conference (COCOON 2012). DOI.
Pan Peng.
In 18th Annual International Computing and Combinatorics Conference (COCOON 2012). DOI.
The Small Community Phenomenon in Networks: Models, Algorithms and Applications.
Pan Peng.
In 9th Annual Conference on Theory and Applications of Models of Computation (TAMC 2012). DOI.
Journal Publications:Pan Peng.
In 9th Annual Conference on Theory and Applications of Models of Computation (TAMC 2012). DOI.
Testing Cluster Structure of Graphs.
Artur Czumaj, Pan Peng, Christian Sohler.
ACM Trans. Algorithms (TALG), 2026. DOI. Arxiv Version.
Artur Czumaj, Pan Peng, Christian Sohler.
ACM Trans. Algorithms (TALG), 2026. DOI. Arxiv Version.
Streaming algorithms for triangle counting: adversarial robustness and the weighted case.
Jing Cao, Yicheng Pan, Pan Peng.
Frontiers Comput. Sci. 20(1): 2001401 (2026). DOI.
Jing Cao, Yicheng Pan, Pan Peng.
Frontiers Comput. Sci. 20(1): 2001401 (2026). DOI.
On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing.
Isolde Adler, Noleen Köhler, Pan Peng.
SIAM J. Comput. 53(4): 825-883 (2024). DOI. Arxiv Version.
Isolde Adler, Noleen Köhler, Pan Peng.
SIAM J. Comput. 53(4): 825-883 (2024). DOI. Arxiv Version.
Constant-time Dynamic (Δ +1)-Coloring.
Monika Henzinger, Pan Peng.
ACM Trans. Algorithms 18(2): 16:1-16:21 (2022). Arxiv Version.
Monika Henzinger, Pan Peng.
ACM Trans. Algorithms 18(2): 16:1-16:21 (2022). Arxiv Version.
Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem.
Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt.
Algorithmica 83(10): 3148-3179 (2021). DOI. Arxiv Version.
Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt.
Algorithmica 83(10): 3148-3179 (2021). DOI. Arxiv Version.
Constant-time dynamic weight approximation for minimum spanning forest.
Monika Henzinger, Pan Peng.
Inf. Comput. 281: 104805 (2021). Arxiv Version.
Monika Henzinger, Pan Peng.
Inf. Comput. 281: 104805 (2021). Arxiv Version.
Mixed-order spectral clustering for complex networks.
Yan Ge, Pan Peng, Haiping Lu.
Pattern Recognit. 117: 107964 (2021). DOI.
Yan Ge, Pan Peng, Haiping Lu.
Pattern Recognit. 117: 107964 (2021). DOI.
Improved Guarantees for Vertex Sparsification in Planar Graphs.
Gramoz Goranci, Monika Henzinger, Pan Peng.
SIAM J. Discret. Math. 34(1): 130-162 (2020). Arxiv Version.
Gramoz Goranci, Monika Henzinger, Pan Peng.
SIAM J. Discret. Math. 34(1): 130-162 (2020). Arxiv Version.
Dynamic Graph Stream Algorithms in o(n) Space.
Zengfeng Huang, Pan Peng.
Algorithmica 81(5): 1965-1987 (2019). Arxiv Version.
Zengfeng Huang, Pan Peng.
Algorithmica 81(5): 1965-1987 (2019). Arxiv Version.
Spectral concentration and greedy k-clustering.
Tamal K. Dey, Pan Peng, Alfred Rossi, Anastasios Sidiropoulos.
Comput. Geom. 76: 19-32 (2019). Arxiv Version.
Tamal K. Dey, Pan Peng, Alfred Rossi, Anastasios Sidiropoulos.
Comput. Geom. 76: 19-32 (2019). Arxiv Version.
Global core, and galaxy structure of networks.
Wei Zhang, Yicheng Pan, Pan Peng, Jiankou Li, Xuechen Li, Angsheng Li.
Sci. China Inf. Sci. 57(7): 1-20 (2014). DOI.
Wei Zhang, Yicheng Pan, Pan Peng, Jiankou Li, Xuechen Li, Angsheng Li.
Sci. China Inf. Sci. 57(7): 1-20 (2014). DOI.
Equilibrium Games in Networks.
Angsheng Li, Xiaohui Zhang, Yicheng Pan, Pan Peng.
Physica A: Statistical Mechanics and its Applications, Volume 416, Pages 49-60, 2014. DOI.
Angsheng Li, Xiaohui Zhang, Yicheng Pan, Pan Peng.
Physica A: Statistical Mechanics and its Applications, Volume 416, Pages 49-60, 2014. DOI.
The small-community phenomenon in networks.
Angsheng Li, Pan Peng.
Math. Struct. Comput. Sci. 22(3): 373-407 (2012). Arxiv Version.
Angsheng Li, Pan Peng.
Math. Struct. Comput. Sci. 22(3): 373-407 (2012). Arxiv Version.
Community Structures in Classical Network Models.
Angsheng Li, Pan Peng.
Internet Math. 7(2): 81-106 (2011). DOI.
Angsheng Li, Pan Peng.
Internet Math. 7(2): 81-106 (2011). DOI.
Some papers are listed under more than one topic.
Program Committees:
SODA 2027,
STOC 2026,
ICALP 2026,
COCOON 2026,
WALCOM 2025,
RANDOM 2024,
IJTCS-FAW 2024,
STACS 2024,
WAW 2024,
WAW 2023,
SWAT 2022,
LATIN 2020,
IJCAI 2019,
AAAI 2019,
TAMC 2019,
FAW 2019,
WAW 2019,
FAW 2018,
WAW 2018,
WAW 2017,
WAW 2016,
TAMC 2016,
WAW 2015,
TAMC 2015,
WAW 2014,
TAMC 2014
Teaching:
Graph Theory (Honor Class). 2025, 2026 Fall.
Algorithms for Big Data. 2022, 2023, 2025 Spring.
Design and Analysis of Algorithms. 2022, 2023, 2024 Fall; 2026 Spring.
Advanced Algorithms. 2018-2019, 2019-2020, 2020-2021.
Automata, Computation and Complexity. 2018-2019, 2019-2020, 2020-2021.
Algorithms for Big Data. 2022, 2023, 2025 Spring.
Design and Analysis of Algorithms. 2022, 2023, 2024 Fall; 2026 Spring.
Advanced Algorithms. 2018-2019, 2019-2020, 2020-2021.
Automata, Computation and Complexity. 2018-2019, 2019-2020, 2020-2021.
Contact Information:
Pan Peng
School of Computer Science and Technology
University of Science and Technology of China
School of Computer Science and Technology
University of Science and Technology of China