default search action
Joe Neeman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j9]Joe Neeman, Charles Radin, Lorenzo Sadun:
Moderate deviations in cycle count. Random Struct. Algorithms 63(3): 779-820 (2023) - [c13]Yeongwoo Hwang, Joe Neeman, Ojas Parekh, Kevin Thompson, John Wright:
Unique Games hardness of Quantum Max-Cut, and a conjectured vector-valued Borell's inequality. SODA 2023: 1319-1384 - 2021
- [c12]Anindya De, Elchanan Mossel, Joe Neeman:
Robust testing of low dimensional functions. STOC 2021: 584-597 - [i22]Yeongwoo Hwang, Joe Neeman, Ojas Parekh, Kevin Thompson, John Wright:
Unique Games hardness of Quantum Max-Cut, and a vector-valued Borell's inequality. CoRR abs/2111.01254 (2021) - [i21]Anindya De, Elchanan Mossel, Joe Neeman:
Robust testing of low-dimensional functions. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j8]Uriel Feige, David Gamarnik, Joe Neeman, Miklós Z. Rácz, Prasad Tetali:
Finding cliques using few probes. Random Struct. Algorithms 56(1): 142-153 (2020) - [i20]Anindya De, Elchanan Mossel, Joe Neeman:
Robust testing of low-dimensional functions. CoRR abs/2004.11642 (2020)
2010 – 2019
- 2019
- [j7]Anindya De, Elchanan Mossel, Joe Neeman:
Noise Stability is Computable and Approximately Low-Dimensional. Theory Comput. 15: 1-47 (2019) - [c11]Anindya De, Elchanan Mossel, Joe Neeman:
Is your function low dimensional? COLT 2019: 979-993 - [c10]Anindya De, Elchanan Mossel, Joe Neeman:
Junta Correlation is Testable. FOCS 2019: 1549-1563 - [i19]Anindya De, Elchanan Mossel, Joe Neeman:
Junta correlation is testable. CoRR abs/1904.04216 (2019) - 2018
- [j6]Elchanan Mossel, Joe Neeman, Allan Sly:
A Proof of the Block Model Threshold Conjecture. Comb. 38(3): 665-708 (2018) - [c9]Anindya De, Elchanan Mossel, Joe Neeman:
Non interactive simulation of correlated distributions is decidable. SODA 2018: 2728-2746 - [i18]Anindya De, Elchanan Mossel, Joe Neeman:
Is your data low-dimensional? CoRR abs/1806.10057 (2018) - [i17]Uriel Feige, David Gamarnik, Joe Neeman, Miklós Z. Rácz, Prasad Tetali:
Finding cliques using few probes. CoRR abs/1809.06950 (2018) - 2017
- [j5]Avik Ray, Joe Neeman, Sujay Sanghavi, Sanjay Shakkottai:
The Search Problem in Mixture Models. J. Mach. Learn. Res. 18: 206:1-206:61 (2017) - [c8]Anindya De, Elchanan Mossel, Joe Neeman:
Noise Stability Is Computable and Approximately Low-Dimensional. CCC 2017: 10:1-10:11 - [i16]Anindya De, Elchanan Mossel, Joe Neeman:
Noise Stability is computable and low dimensional. CoRR abs/1701.01483 (2017) - [i15]Anindya De, Elchanan Mossel, Joe Neeman:
Non interactive simulation of correlated distributions is decidable. CoRR abs/1701.01485 (2017) - 2016
- [j4]Anindya De, Elchanan Mossel, Joe Neeman:
Majority is Stablest: Discrete and SoS. Theory Comput. 12(1): 1-50 (2016) - [c7]Jess Banks, Cristopher Moore, Joe Neeman, Praneeth Netrapalli:
Information-theoretic thresholds for community detection in sparse networks. COLT 2016: 383-416 - [i14]Elchanan Mossel, Joe Neeman:
Noise Stability and Correlation with Half Spaces. CoRR abs/1603.01799 (2016) - [i13]Jess Banks, Cristopher Moore, Joe Neeman, Praneeth Netrapalli:
Information-theoretic thresholds for community detection in sparse networks. CoRR abs/1607.01760 (2016) - [i12]Avik Ray, Joe Neeman, Sujay Sanghavi, Sanjay Shakkottai:
The Search Problem in Mixture Models. CoRR abs/1610.00843 (2016) - 2015
- [c6]Dohyung Park, Joe Neeman, Jin Zhang, Sujay Sanghavi, Inderjit S. Dhillon:
Preference Completion: Large-scale Collaborative Ranking from Pairwise Comparisons. ICML 2015: 1907-1916 - [c5]Steven Heilman, Elchanan Mossel, Joe Neeman:
Standard Simplices and Pluralities are Not the Most Noise Stable. ITCS 2015: 255 - [c4]Elchanan Mossel, Joe Neeman, Allan Sly:
Consistency Thresholds for the Planted Bisection Model. STOC 2015: 69-75 - [i11]Dohyung Park, Joe Neeman, Jin Zhang, Sujay Sanghavi, Inderjit S. Dhillon:
Preference Completion: Large-scale Collaborative Ranking from Pairwise Comparisons. CoRR abs/1507.04457 (2015) - 2014
- [j3]Elchanan Mossel, Joe Neeman, Omer Tamuz:
Majority dynamics and aggregation of information in social networks. Auton. Agents Multi Agent Syst. 28(3): 408-429 (2014) - [j2]Joe Neeman:
A law of large numbers for weighted plurality. Soc. Choice Welf. 42(1): 99-109 (2014) - [j1]Siu On Chan, Elchanan Mossel, Joe Neeman:
On Extracting Common Random Bits From Correlated Sources on Large Alphabets. IEEE Trans. Inf. Theory 60(3): 1630-1637 (2014) - [c3]Elchanan Mossel, Joe Neeman, Allan Sly:
Belief propagation, robust reconstruction and optimal recovery of block models. COLT 2014: 356-370 - [c2]Joe Neeman:
Testing surface area with arbitrary accuracy. STOC 2014: 393-397 - [i10]Steven Heilman, Elchanan Mossel, Joe Neeman:
Standard Simplices and Pluralities are Not the Most Noise Stable. CoRR abs/1403.0885 (2014) - [i9]Joe Neeman, Praneeth Netrapalli:
Non-Reconstructability in the Stochastic Block Model. CoRR abs/1404.6304 (2014) - [i8]Elchanan Mossel, Joe Neeman, Allan Sly:
Consistency Thresholds for Binary Symmetric Block Models. CoRR abs/1407.1591 (2014) - 2013
- [c1]Anindya De, Elchanan Mossel, Joe Neeman:
Majority is stablest: discrete and SoS. STOC 2013: 477-486 - [i7]Florent Krzakala, Cristopher Moore, Elchanan Mossel, Joe Neeman, Allan Sly, Lenka Zdeborová, Pan Zhang:
Spectral redemption: clustering sparse networks. CoRR abs/1306.5550 (2013) - [i6]Elchanan Mossel, Joe Neeman, Allan Sly:
Belief Propagation, Robust Reconstruction, and Optimal Recovery of Block Models. CoRR abs/1309.1380 (2013) - [i5]Elchanan Mossel, Joe Neeman, Allan Sly:
A Proof Of The Block Model Threshold Conjecture. CoRR abs/1311.4115 (2013) - 2012
- [i4]Elchanan Mossel, Joe Neeman, Omer Tamuz:
Majority Dynamics and Aggregation of Information in Social Networks. CoRR abs/1207.0893 (2012) - [i3]Siu On Chan, Elchanan Mossel, Joe Neeman:
On extracting common random bits from correlated sources on large alphabets. CoRR abs/1208.5946 (2012) - [i2]Anindya De, Elchanan Mossel, Joe Neeman:
Majority is Stablest : Discrete and SoS. CoRR abs/1211.1001 (2012) - 2011
- [i1]Joe Neeman:
A law of large numbers for weighted plurality. CoRR abs/1106.5423 (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-09-13 00:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint