default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuzhou Gu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Yuzhou Gu, Aaradhya Pandey:
Community detection in the hypergraph stochastic block model and reconstruction on hypertrees. COLT 2024: 2166-2203- [c11]Yuzhou Gu, Zhao Song, Junze Yin, Lichen Zhang:
Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time. ICLR 2024 - [c10]Zongchen Chen, Yuzhou Gu:
Fast Sampling of b-Matchings and b-Edge Covers. SODA 2024: 4972-4987 - [i18]Yuzhou Gu, Aaradhya Pandey:
Community detection in the hypergraph stochastic block model and reconstruction on hypertrees. CoRR abs/2402.06856 (2024) - [i17]Yeqi Gao, Yuzhou Gu, Zhao Song:
Binary Hypothesis Testing for Softmax Models and Leverage Score Models. CoRR abs/2405.06003 (2024) - [i16]Pietro Caputo, Zongchen Chen, Yuzhou Gu, Yury Polyanskiy:
Entropy Contractions in Markov Chains: Half-Step, Full-Step and Continuous-Time. CoRR abs/2409.07689 (2024) - 2023
- [b1]Yuzhou Gu:
Channel Comparison Methods and Statistical Problems on Graphs. MIT, USA, 2023 - [c9]Yuzhou Gu, Yury Polyanskiy:
Uniqueness of BP fixed point for the Potts model and applications to community detection. COLT 2023: 837-884 - [c8]Yuzhou Gu, Yury Polyanskiy:
Weak Recovery Threshold for the Hypergraph Stochastic Block Model. COLT 2023: 885-920 - [c7]Yuzhou Gu, Yinzhan Xu:
Optimal Bounds for Noisy Sorting. STOC 2023: 1502-1515 - [i15]Yuzhou Gu, Zhao Song, Junze Yin, Lichen Zhang:
Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time. CoRR abs/2302.11068 (2023) - [i14]Yuzhou Gu, Yinzhan Xu:
Optimal Bounds for Noisy Sorting. CoRR abs/2302.12440 (2023) - [i13]Yuzhou Gu, Yury Polyanskiy:
Uniqueness of BP fixed point for the Potts model and applications to community detection. CoRR abs/2303.14688 (2023) - [i12]Yuzhou Gu, Yury Polyanskiy:
Weak Recovery Threshold for the Hypergraph Stochastic Block Model. CoRR abs/2303.14689 (2023) - [i11]Zongchen Chen, Yuzhou Gu:
Fast Sampling of b-Matchings and b-Edge Covers. CoRR abs/2304.14289 (2023) - [i10]Yuzhou Gu, Zhao Song, Lichen Zhang:
A Nearly-Linear Time Algorithm for Structured Support Vector Machines. CoRR abs/2307.07735 (2023) - [i9]Yuzhou Gu, Ziqi Zhou, Onur Günlü, Rafael G. L. D'Oliveira, Parastoo Sadeghi, Muriel Médard, Rafael F. Schaefer:
Generalized Rainbow Differential Privacy. CoRR abs/2309.05871 (2023) - 2022
- [i8]Yuzhou Gu, Zhao Song:
A Faster Small Treewidth SDP Solver. CoRR abs/2211.06033 (2022) - 2021
- [c6]Emmanuel Abbe, Elisabetta Cornacchia, Yuzhou Gu, Yury Polyanskiy:
Stochastic block model entropy and broadcasting on trees with survey. COLT 2021: 1-25 - [c5]Yuzhou Gu, Adam Polak
, Virginia Vassilevska Williams, Yinzhan Xu:
Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths. ICALP 2021: 75:1-75:20 - [i7]Emmanuel Abbe, Elisabetta Cornacchia, Yuzhou Gu, Yury Polyanskiy:
Stochastic block model entropy and broadcasting on trees with survey. CoRR abs/2101.12601 (2021) - [i6]Yuzhou Gu, Adam Polak, Virginia Vassilevska Williams, Yinzhan Xu:
Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths. CoRR abs/2105.02806 (2021) - 2020
- [j1]Zeev Dvir, Sivakanth Gopi, Yuzhou Gu, Avi Wigderson:
Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs. SIAM J. Comput. 49(3): 465-496 (2020) - [c4]Yuzhou Gu, Hajir Roozbehani, Yury Polyanskiy:
Broadcasting on trees near criticality. ISIT 2020: 1504-1509 - [i5]Yuzhou Gu, Yury Polyanskiy:
Non-linear Log-Sobolev inequalities for the Potts semigroup and applications to reconstruction problems. CoRR abs/2005.05444 (2020) - [i4]Yuzhou Gu, Hajir Roozbehani, Yury Polyanskiy:
Broadcasting on trees near criticality. CoRR abs/2005.07801 (2020)
2010 – 2019
- 2019
- [c3]Zeev Dvir, Sivakanth Gopi, Yuzhou Gu, Avi Wigderson:
Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs. ITCS 2019: 32:1-32:20 - 2018
- [c2]Lijie Chen, Erik D. Demaine, Yuzhou Gu, Virginia Vassilevska Williams, Yinzhan Xu, Yuancheng Yu:
Nearly Optimal Separation Between Partially and Fully Retroactive Data Structures. SWAT 2018: 33:1-33:12 - [i3]Lijie Chen, Erik D. Demaine, Yuzhou Gu, Virginia Vassilevska Williams, Yinzhan Xu, Yuancheng Yu:
Nearly Optimal Separation Between Partially And Fully Retroactive Data Structures. CoRR abs/1804.06932 (2018) - [i2]Yuzhou Gu:
Zero-error communication over adder MAC. CoRR abs/1809.07364 (2018) - 2016
- [c1]Yuzhou Gu, Shilin Wang, Xiang Lin, Tanfeng Sun:
USM Sharpening Detection Based on Sparse Coding. DICTA 2016: 1-5 - [i1]Yuzhou Gu:
Some Results on Reversible Gate Classes Over Non-Binary Alphabets. CoRR abs/1606.00804 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 20:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
