WebPeilin Zhong Columbia University New York City, New York, USA [email protected] ABSTRACT We present an O(logd +loglog m/n n)-time randomized PRAM al-gorithm for computing the connected components of an n-vertex, m-edge undirected graph with maximum component diameter d. WebPeilin Zhong Columbia University [email protected] Simon S. Du University of Washington, Seattle [email protected] Ruslan Salakhutdinov Carnegie Mellon University [email protected] Lin F. Yang University of California, Los Angeles [email protected] Abstract Standard sequential decision-making paradigms aim to …
Peilin Zhong DeepAI
WebAlexandr Andoni, Clifford Stein, Zhao Song, Zhengyu Wang, Peilin Zhong: Parallel Graph Connectivity in Log Diameter Rounds CoRR abs/1805.03055 (2024) 2024 Jelena Marasevic, Clifford Stein, Gil Zussman: Max-min Fair Rate Allocation and Routing in Energy Harvesting Networks: Algorithmic Analysis Algorithmica 78(2): 521-557 (2024) WebColumbia University [email protected] April 22, 2024 Abstract We present an O(logd + loglog m/nn)-time randomized PRAM algorithm for computing the con- nected components of an n-vertex, m-edge undirected graph with maximum component diameter d. photometric calibration of zoom lens systems
Peilin Zhong - Google Scholar
WebSearch ACM Digital Library. Search Search. Advanced Search WebSep 5, 2024 · Peilin Zhong, Columbia University Siddharth Bhandari, Tata Institute of Fundamental Research Soheil Behnezhad, University of Maryland at College Park Zhe Feng, Harvard University Computational Neuroscience Caroline Haimerl, New York University Mai Gamal, German University in Cairo WebPeilin Zhong. Google Research. Verified email at google.com - Homepage. ... P Zhong. Advances in Neural Information Processing Systems 32, 2024. 19: 2024: Log Diameter Rounds Algorithms for -Vertex and -Edge Connectivity. A Andoni, C Stein, P Zhong. arXiv preprint arXiv:1905.00850, 2024. 18: 2024: photometric constancy