default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNike Sun
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c10]Elchanan Mossel, Jonathan Niles-Weed, Youngtak Sohn, Nike Sun, Ilias Zadik:
Sharp thresholds in inference of planted subgraphs. COLT 2023: 5573-5577- [c9]Shuta Nakajima, Nike Sun:
Sharp threshold sequence and universality for Ising perceptron models. SODA 2023: 638-674 - [i7]Elchanan Mossel, Jonathan Niles-Weed, Youngtak Sohn, Nike Sun, Ilias Zadik:
Sharp thresholds in inference of planted subgraphs. CoRR abs/2302.14830 (2023) - 2022
- [c8]Erwin Bolthausen, Shuta Nakajima, Nike Sun, Changji Xu:
Gardner formula for Ising perceptron models at small densities. COLT 2022: 1787-1911 - [i6]Elchanan Mossel, Jonathan Niles-Weed, Nike Sun, Ilias Zadik:
On the Second Kahn-Kalai Conjecture. CoRR abs/2209.03326 (2022) - [i5]Elchanan Mossel, Jonathan Niles-Weed, Nike Sun, Ilias Zadik:
A second moment proof of the spread lemma. CoRR abs/2209.11347 (2022) - 2021
- [c7]Nike Sun:
Statistical physics of random CSPs (tutorial). STOC 2021: 13
2010 – 2019
- 2019
- [c6]Zsolt Bartha
, Nike Sun, Yumeng Zhang:
Breaking of 1RSB in Random Regular MAX-NAE-SAT. FOCS 2019: 1405-1416 - [c5]Jian Ding, Nike Sun:
Capacity lower bound for the Ising perceptron. STOC 2019: 816-827 - 2016
- [c4]Allan Sly, Nike Sun, Yumeng Zhang:
The Number of Solutions for Random Regular NAE-SAT. FOCS 2016: 724-731 - [i4]Andrea Montanari, Nike Sun:
Spectral algorithms for tensor completion. CoRR abs/1612.07866 (2016) - 2015
- [c3]Jian Ding, Allan Sly, Nike Sun:
Proof of the Satisfiability Conjecture for Large k. STOC 2015: 59-68 - 2014
- [c2]Jian Ding, Allan Sly, Nike Sun:
Satisfiability threshold for random regular NAE-SAT. STOC 2014: 814-822 - [i3]Jian Ding, Allan Sly, Nike Sun:
Proof of the satisfiability conjecture for large k. CoRR abs/1411.0650 (2014) - 2012
- [c1]Allan Sly, Nike Sun:
The Computational Hardness of Counting in Two-Spin Models on d-Regular Graphs. FOCS 2012: 361-369 - [i2]Allan Sly, Nike Sun:
The computational hardness of counting in two-spin models on d-regular graphs. CoRR abs/1203.2602 (2012) - 2011
- [i1]Amir Dembo, Andrea Montanari, Nike Sun:
Factor models on locally tree-like graphs. CoRR abs/1110.4821 (2011)
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-04-25 05:50 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:
