Pan Peng
Orcid: 0000-0003-2700-5699Affiliations:
- University of Science and Technology of China, China
- University of Sheffield, Department of Computer Science, UK (former)
- University of Vienna, Austria (2016 - 2018)
- TU Dortmund, Germany (2013 - 2016)
- Chinese Academy of Sciences, Institute of Software, State Key Laboratory of Computer Science, Beijing, China (PhD 2013)
According to our database1,
Pan Peng
authored at least 47 papers
between 2011 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on scopus.com
-
on orcid.org
-
on panpeng.me
On csauthors.net:
Bibliography
2024
On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing.
SIAM J. Comput., 2024
Proceedings of the ACM on Web Conference 2024, 2024
Proceedings of the Twelfth International Conference on Learning Representations, 2024
2023
Sublinear-Time Algorithms for Max Cut, Max E2Lin(<i>q</i>), and Unique Label Cover on Expanders.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
Recovering Unbalanced Communities in the Stochastic Block Model with Application to Clustering with a Faulty Oracle.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
An Optimal Separation Between Two Property Testing Models for Bounded Degree Directed Graphs.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023
Proceedings of the 31st Annual European Symposium on Algorithms, 2023
Proceedings of the 31st Annual European Symposium on Algorithms, 2023
2022
Sublinear-Time Algorithms for Max Cut, Max E2Lin(q), and Unique Label Cover on Expanders.
CoRR, 2022
Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022
Proceedings of the International Conference on Machine Learning, 2022
2021
Inf. Comput., 2021
Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem.
Algorithmica, 2021
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021
Towards a Query-Optimal and Time-Efficient Algorithm for Clustering with a Faulty Oracle.
Proceedings of the Conference on Learning Theory, 2021
Proceedings of the 36th Computational Complexity Conference, 2021
2020
SIAM J. Discret. Math., 2020
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
Proceedings of the KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2020
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020
More effective randomized search heuristics for graph coloring through dynamic optimization.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020
Proceedings of the 28th Annual European Symposium on Algorithms, 2020
Proceedings of the Approximation, 2020
2019
Constant-Time Dynamic (Δ+1)-Coloring and Weight Approximation for Minimum Spanning Forest: Dynamic Algorithms Meet Property Testing.
CoRR, 2019
Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
Proceedings of the Genetic and Evolutionary Computation Conference, 2019
2018
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
Proceedings of the 26th Annual European Symposium on Algorithms, 2018
2017
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017
Proceedings of the 25th Annual European Symposium on Algorithms, 2017
2016
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016
2015
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015
Proceedings of the Approximation, 2015
2014
2013
Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013
2012
Proceedings of the Theory and Applications of Models of Computation, 2012
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012
2011