Pan Peng (彭攀)

Navedeno

	Vse	Od leta 2020
Navedbe	586	426
indeks h	17	13
indeks i10	20	18

100

2012201320142015201620172018201920202021202220232024202513 11 3 10 8 17 39 50 39 75 95 98 90 28

Javni dostop

Prikaži vse

19 člankov

1 članek

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Christian SohlerProfessor for Algorithmic Data Analysis, University of ColognePreverjeni e-poštni naslov na uni-koeln.de
Monika HenzingerProfessor of Computer Science, Institute of Science and Technology Austria (ISTA)Preverjeni e-poštni naslov na ist.ac.at
Hendrik FichtenbergerGoogle ResearchPreverjeni e-poštni naslov na google.com
Gramoz GoranciUniversity of ViennaPreverjeni e-poštni naslov na univie.ac.at
Artur CzumajProfessor of Computer Science, University of Warwick, UKPreverjeni e-poštni naslov na warwick.ac.uk
Yuichi YoshidaNational Institute of InformaticsPreverjeni e-poštni naslov na nii.ac.jp
Jakob BossekPaderborn UniversityPreverjeni e-poštni naslov na uni-paderborn.de
Frank NeumannOptimisation and Logistics, School of ComputerPreverjeni e-poštni naslov na adelaide.edu.au
Dirk SudholtUniversity of Passau, GermanyPreverjeni e-poštni naslov na uni-passau.de
Haiping LuProfessor of Machine Learning, University of SheffieldPreverjeni e-poštni naslov na sheffield.ac.uk
Jiapeng ZhangUniversity of Southern CaliforniaPreverjeni e-poštni naslov na usc.edu
Tamal K. DeyProfessor Computer Science, Purdue UniversityPreverjeni e-poštni naslov na purdue.edu
Anastasios SidiropoulosUniversity of Illinois at ChicagoPreverjeni e-poštni naslov na uic.edu
Zengfeng HuangFudan UniversityPreverjeni e-poštni naslov na fudan.edu.cn
Stefan NeumannTU WienPreverjeni e-poštni naslov na tuwien.ac.at
Yinhao Dong (董寅灏)PhD Student, University of Science and Technology of ChinaPreverjeni e-poštni naslov na mail.ustc.edu.cn
Chandra Sekhar MukherjeeUniversity of Southern CaliforniaPreverjeni e-poštni naslov na usc.edu
He SunReader in Algorithms & Complexity, University of EdinburghPreverjeni e-poštni naslov na ed.ac.uk
Ali VakilianToyota Technological Institute at Chicago (TTIC)Preverjeni e-poštni naslov na ttic.edu
Xianbin ZhuAalto UniversityPreverjeni e-poštni naslov na aalto.fi

Spremljaj

Pan Peng (彭攀)

University of Science and Technology of China

Preverjeni e-poštni naslov na ustc.edu.cn - Domača stran

algorithms graphs


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
Testing cluster structure of graphs A Czumaj, P Peng, C Sohler Proceedings of the forty-seventh annual ACM symposium on Theory of Computing …, 2015	52	2015
Improved Guarantees for Vertex Sparsification in Planar Graphs G Goranci, M Henzinger, P Peng SIAM Journal on Discrete Mathematics, 2020	46	2020
Estimating graph parameters from random order streams P Peng, C Sohler Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018	31	2018
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	29	2018
Average sensitivity of spectral clustering P Peng, Y Yoshida Proceedings of the 26th ACM SIGKDD international conference on knowledge …, 2020	28	2020
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	27	2016
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	26	2017
Dynamic Graph Stream Algorithms in o(n) Space Z Huang, P Peng Algorithmica 81, 1965-1987, 2019	24	2019
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	23	2021
Constant-Time Dynamic -Coloring M Henzinger, P Peng The 37th International Symposium on Theoretical Aspects of Computer Science …, 2020	23	2020
Mixed-order spectral clustering for complex networks Y Ge, P Peng, H Lu Pattern Recognition 117, 107964, 2021	22	2021
The power of vertex sparsifiers in dynamic graph algorithms G Goranci, M Henzinger, P Peng 25th Annual European Symposium on Algorithms (ESA 2017), 2017	22	2017
Community structures in classical network models A Li, P Peng Internet Mathematics 7 (2), 81-106, 2011	22	2011
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	21	2019
Sampling arbitrary subgraphs exactly uniformly in sublinear time H Fichtenberger, M Gao, P Peng arXiv preprint arXiv:2005.01861, 2020	20	2020
The small-community phenomenon in networks A Li, P Peng Mathematical Structures in Computer Science 22 (3), 373-407, 2012	20	2012
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	17	2019
Testable properties in general graphs and random order streaming A Czumaj, H Fichtenberger, P Peng, C Sohler arXiv preprint arXiv:1905.01644, 2019	15	2019
Robust clustering oracle and local reconstructor of cluster structure of graphs P Peng Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020	13	2020
Spectral concentration and greedy k-clustering TK Dey, P Peng, A Rossi, A Sidiropoulos Computational Geometry 76, 19-32, 2019	10	2019

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji