💀 The Wall of Shame

The most cited papers with no code. Sorted by the weight of their sins.

Page 1

# Paper Cause of Death Category Citations Published
1 Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure
Matthew Brennan, Guy Bresler, Wasim Huleihel
🔮 The Ethereal cs.CC 120 7 years ago
2 Improved Sum-of-Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problems
Yash Deshpande, Andrea Montanari
🔮 The Ethereal cs.CC 85 11 years ago
3 Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent
Matthew Brennan, Guy Bresler, ... (+3 more)
🔮 The Ethereal cs.CC 72 5 years ago
4 How Hard Is Robust Mean Estimation?
Samuel B. Hopkins, Jerry Li
🔮 The Ethereal cs.CC 41 7 years ago
5 Spectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs
Afonso S. Bandeira, Jess Banks, ... (+3 more)
🔮 The Ethereal cs.CC 35 5 years ago
6 Reconstructing Trees from Traces
Sami Davies, Miklos Z. Racz, Cyrus Rashtchian
🔮 The Ethereal cs.CC 29 7 years ago
7 Reasoning in Bayesian Opinion Exchange Networks Is PSPACE-Hard
Jan Hązła, Ali Jadbabaie, ... (+2 more)
🔮 The Ethereal cs.CC 19 7 years ago
8 Geometric Barriers for Stable and Online Algorithms for Discrepancy Minimization
David Gamarnik, Eren C. Kızıldağ, ... (+2 more)
🔮 The Ethereal cs.CC 19 3 years ago
9 Is Planted Coloring Easier than Planted Clique?
Pravesh K. Kothari, Santosh S. Vempala, ... (+2 more)
🔮 The Ethereal cs.CC 16 3 years ago
10 Is your function low-dimensional?
Anindya De, Elchanan Mossel, Joe Neeman
🔮 The Ethereal cs.CC 13 7 years ago
11 Some easy optimization problems have the overlap-gap property
Shuangping Li, Tselil Schramm
🔮 The Ethereal cs.CC 12 1 year ago
12 Non-Clashing Teaching Maps for Balls in Graphs
Jérémie Chalopin, Victor Chepoi, ... (+2 more)
🔮 The Ethereal cs.CC 11 2 years ago
13 Hardness of Maximum Likelihood Learning of DPPs
Elena Grigorescu, Brendan Juba, ... (+2 more)
🔮 The Ethereal cs.CC 7 3 years ago
14 Optimal group testing
Amin Coja-Oghlan, Oliver Gebhard, ... (+2 more)
🔮 The Ethereal cs.DM 3 6 years ago
15 Superconstant Inapproximability of Decision Tree Learning
Caleb Koch, Carmen Strassle, Li-Yang Tan
🔮 The Ethereal cs.CC 3 1 year ago
16 Testing Juntas and Junta Subclasses with Relative Error
Xi Chen, William Pires, ... (+2 more)
🔮 The Ethereal cs.CC 2 11 months ago
17 Partial and Exact Recovery of a Random Hypergraph from its Graph Projection
Guy Bresler, Chenghao Guo, ... (+2 more)
🔮 The Ethereal math.CO 1 1 year ago