彭攀 特任教授
发布时间：2022-02-28浏览次数：11
E-Mail： ppeng@ustc.edu.cn
个人主页：http://staff.ustc.edu.cn/~ppeng/
主要研究方向：理论计算机科学，图算法、大数据算法的理论与应用
彭攀，中国科学技术大学计算机学院特任教授。2007年获得北京师范大学数学学士学位。2013年获得中国科学院软件研究所博士学位。曾任中科院软件所助理研究员，曾于德国多特蒙德工业大学、奥地利维也纳大学做博士后，曾担任英国谢菲尔德大学终身制讲师（助理教授）。主要研究理论计算机科学，图算法、大数据算法的理论及其（在机器学习、数据挖掘等领域的）应用。相关成果已发表在STOC、SODA、CCC、ICALP、COLT、KDD等一流国际会议上。多次受邀担任国际知名会议(如LATIN、AAAI、IJCAI等)的程序委员会成员。曾受邀参加欧洲研究委员会(ERC)及以色列科学基金的项目评审工作。目前担任Frontiers of Computer Science, International Journal of Software and Informatics等期刊的(青年)编委。
代表性论著：
（根据理论计算机科学惯例，以下有关理论研究的论文作者按姓氏字母排序；带*号的论文作者按照贡献排序）
Isolde Adler, Noleen Köhler, Pan Peng. On Testability of First-Order Properties in Bounded-Degree Graphs. In the 32nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021).
Pan Peng, Jiapeng Zhang. Towards a Query-Optimal and Time-Efficient Algorithm for Clustering with a Faulty Oracle. In the 34th Annual Conference on Learning Theory (COLT 2021).
Isolde Adler, Noleen Köhler, Pan Peng. GSF-Locality Is Not Sufficient for Proximity-Oblivious Testing. In the Computational Complexity Conference (CCC 2021).
(*) Pan Peng, Daniel Lopatta, Yuichi Yoshida, Gramoz Goranci. Local Algorithms for Estimating Effective Resistance. In the 27th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (KDD 2021).
Pan Peng. Robust Clustering Oracle and Local Reconstructor of Cluster Structure of Graphs. In the 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2020).
Pan Peng, Yuichi Yoshida. Average Sensitivity of Spectral Clustering. In the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (KDD 2020).
Hendrik Fichtenberger, Pan Peng and Christian Sohler. Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty. In the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019).
Pan Peng, Christian Sohler. Estimating Graph Parameters from Random Order Streams. In the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018).
Artur Czumaj, Pan Peng, Christian Sohler. Relating Two Property Testing Models for Bounded Degree Directed Graphs. In 48th ACM Symposium on Theory of Computing (STOC 2016).
Artur Czumaj, Pan Peng, Christian Sohler. Testing Cluster Structure of Graphs. In 47th ACM Symposium on Theory of Computing (STOC 2015).