default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBrice Huang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j5]Ryan Alweiss, Brice Huang, Mark Sellke:
Improved Lower Bound for Frankl's Union-Closed Sets Conjecture. Electron. J. Comb. 31(3) (2024)- [j4]Matthew S. Brennan, Guy Bresler, Brice Huang:
Threshold for detecting high dimensional geometry in anisotropic random geometric graphs. Random Struct. Algorithms 64(1): 125-137 (2024) - 2020
- [j3]Brice Huang:
Cyclic descents for general skew tableaux. J. Comb. Theory A 169 (2020) - 2019
- [j2]Brice Huang:
An upper bound on the number of (132, 213)-avoiding cyclic permutations. Discret. Math. 342(6): 1762-1771 (2019) - [j1]Brice Huang, Mustazee Rahman
:
On the local geometry of graphs in terms of their spectra. Eur. J. Comb. 81: 378-393 (2019)
Conference and Workshop Papers
- 2024
- [c5]Brice Huang:
Capacity Threshold for the Ising Perceptron. FOCS 2024: 1126-1136 - 2023
- [c4]Sitan Chen, Brice Huang, Jerry Li, Allen Liu, Mark Sellke:
When Does Adaptivity Help for Quantum State Learning? FOCS 2023: 391-404 - 2022
- [c3]Brice Huang, Mark Sellke:
Tight Lipschitz Hardness for optimizing Mean Field Spin Glasses. FOCS 2022: 312-322 - [c2]Sitan Chen, Jerry Li, Brice Huang, Allen Liu:
Tight Bounds for Quantum State Certification with Incoherent Measurements. FOCS 2022: 1205-1213 - 2021
- [c1]Guy Bresler, Brice Huang:
The Algorithmic Phase Transition of Random k-SAT for Low Degree Polynomials. FOCS 2021: 298-309
Informal and Other Publications
- 2024
- [i9]Brice Huang, Sidhanth Mohanty, Amit Rajaraman, David X. Wu:
Weak Poincaré Inequalities, Simulated Annealing, and Sampling from Spherical Spin Glasses. CoRR abs/2411.09075 (2024) - 2023
- [i8]Brice Huang, Mark Sellke:
Algorithmic Threshold for Multi-Species Spherical Spin Glasses. CoRR abs/2303.12172 (2023) - 2022
- [i7]Sitan Chen, Brice Huang, Jerry Li, Allen Liu:
Tight Bounds for Quantum State Certification with Incoherent Measurements. CoRR abs/2204.07155 (2022) - [i6]Sitan Chen, Brice Huang, Jerry Li, Allen Liu, Mark Sellke:
Tight Bounds for State Tomography with Incoherent Measurements. CoRR abs/2206.05265 (2022) - [i5]Matthew S. Brennan, Guy Bresler, Brice Huang:
Threshold for Detecting High Dimensional Geometry in Anisotropic Random Geometric Graphs. CoRR abs/2206.14896 (2022) - 2021
- [i4]Matthew S. Brennan, Guy Bresler, Brice Huang:
De Finetti-Style Results for Wishart Matrices: Combinatorial Structure and Phase Transitions. CoRR abs/2103.14011 (2021) - [i3]Guy Bresler, Brice Huang:
The Algorithmic Phase Transition of Random k-SAT for Low Degree Polynomials. CoRR abs/2106.02129 (2021) - [i2]Brice Huang, Mark Sellke:
Tight Lipschitz Hardness for Optimizing Mean Field Spin Glasses. CoRR abs/2110.07847 (2021) - 2018
- [i1]Brice Huang, Mustazee Rahman:
On the Local Geometry of Graphs in Terms of Their Spectra. CoRR abs/1807.06034 (2018)
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 2025-01-21 00:21 CET 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:
