💀 The Wall of Shame

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

Page 4, showing 50 papers

# Paper Cause of Death Category Citations Published
151 Perfect $L_p$ Sampling in a Data Stream
Rajesh Jayaram, David P. Woodruff
👻 Ghosted cs.DS 45 7 years ago
152 Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers
Li Chen, Gramoz Goranci, ... (+3 more)
👻 Ghosted cs.DS 44 6 years ago
153 Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures
Aparna Gupte, Neekon Vafa, Vinod Vaikuntanathan
👻 Ghosted cs.CR 44 4 years ago
154 The Power of Uniform Sampling for Coresets
Vladimir Braverman, Vincent Cohen-Addad, ... (+5 more)
👻 Ghosted cs.DS 44 3 years ago
155 Fast and Compact Exact Distance Oracle for Planar Graphs
Vincent Cohen-Addad, Søren Dahlgaard, Christian Wulff-Nilsen
👻 Ghosted cs.DS 43 9 years ago
156 Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time
Jan van den Brand, Danupon Nanongkai
👻 Ghosted cs.DS 43 6 years ago
157 Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems
Sepehr Assadi, Gillat Kol, ... (+2 more)
👻 Ghosted cs.DS 43 5 years ago
158 The Submodular Secretary Problem Goes Linear
Moran Feldman, Rico Zenklusen
👻 Ghosted cs.DS 42 10 years ago
159 A Robust Sparse Fourier Transform in the Continuous Setting
Eric Price, Zhao Song
👻 Ghosted cs.DS 42 9 years ago
160 Fusible HSTs and the randomized k-server conjecture
James R. Lee
👻 Ghosted cs.DS 42 8 years ago
161 Coded trace reconstruction in a constant number of traces
Joshua Brakensiek, Ray Li, Bruce Spang
👻 Ghosted cs.IT 42 6 years ago
162 Improved Truthful Mechanisms for Combinatorial Auctions with Submodular Bidders
Sepehr Assadi, Sahil Singla
👻 Ghosted cs.GT 42 6 years ago
163 QMA-hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge
Anne Broadbent, Alex B. Grilo
👻 Ghosted quant-ph 42 6 years ago
164 Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps
Bernhard Haeupler, Richard Hladík, ... (+3 more)
👻 Ghosted cs.DS 42 2 years ago
165 Explicit Non-Malleable Extractors, Multi-Source Extractors and Almost Optimal Privacy Amplification Protocols
Eshan Chattopadhyay, Xin Li
👻 Ghosted cs.CR 41 10 years ago
166 Generalized Uniformity Testing
Tuğkan Batu, Clément L. Canonne
👻 Ghosted cs.DS 41 8 years ago
167 Improved decoding of Folded Reed-Solomon and Multiplicity Codes
Swastik Kopparty, Noga Ron-Zewi, ... (+2 more)
👻 Ghosted cs.IT 41 8 years ago
168 New Notions and Constructions of Sparsification for Graphs and Hypergraphs
Nikhil Bansal, Ola Svensson, Luca Trevisan
👻 Ghosted cs.DS 41 7 years ago
169 Pandora's Box with Correlations: Learning and Approximation
Shuchi Chawla, Evangelia Gergatsouli, ... (+3 more)
👻 Ghosted cs.DS 41 6 years ago
170 Faster Exact and Approximate Algorithms for $k$-Cut
Anupam Gupta, Euiwoong Lee, Jason Li
👻 Ghosted cs.DS 40 8 years ago
171 Beyond trace reconstruction: Population recovery from the deletion channel
Frank Ban, Xi Chen, ... (+3 more)
👻 Ghosted cs.DS 40 7 years ago
172 Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time
Shiri Chechik, Tianyi Zhang
👻 Ghosted cs.DS 40 6 years ago
173 Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving
Simon Apers, Ronald de Wolf
👻 Ghosted quant-ph 40 6 years ago
174 Learning Deep ReLU Networks Is Fixed-Parameter Tractable
Sitan Chen, Adam R. Klivans, Raghu Meka
👻 Ghosted cs.LG 40 5 years ago
175 Differential Privacy from Locally Adjustable Graph Algorithms: $k$-Core Decomposition, Low Out-Degree Ordering, and Densest Subgraphs
Laxman Dhulipala, Quanquan C. Liu, ... (+4 more)
👻 Ghosted cs.DS 40 3 years ago
176 Certifying almost all quantum states with few single-qubit measurements
Hsin-Yuan Huang, John Preskill, Mehdi Soleimanifar
👻 Ghosted quant-ph 40 2 years ago
177 Pattern-avoiding access in binary search trees
Parinya Chalermsook, Mayank Goswami, ... (+3 more)
👻 Ghosted cs.DS 39 11 years ago
178 Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization
Yi-Jun Chang, Thatchaphol Saranurak
👻 Ghosted cs.DS 39 5 years ago
179 Kernel Density Estimation through Density Constrained Near Neighbor Search
Moses Charikar, Michael Kapralov, ... (+2 more)
👻 Ghosted cs.DS 39 5 years ago
180 On Light Spanners, Low-treewidth Embeddings and Efficient Traversing in Minor-free Graphs
Vincent Cohen-Addad, Arnold Filtser, ... (+2 more)
👻 Ghosted cs.DS 38 5 years ago
181 Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets
Zeyu Guo, Zihan Zhang
👻 Ghosted cs.IT 38 3 years ago
182 Tight Bounds for Online Edge Coloring
Ilan Reuven Cohen, Binghui Peng, David Wajc
👻 Ghosted cs.DS 37 7 years ago
183 LDPC Codes Achieve List Decoding Capacity
Jonathan Mosheiff, Nicolas Resch, ... (+3 more)
👻 Ghosted cs.IT 37 6 years ago
184 On Approximating Maximum Independent Set of Rectangles
Julia Chuzhoy, Alina Ene
👻 Ghosted cs.DS 36 9 years ago
185 Near-linear Size Hypergraph Cut Sparsifiers
Yu Chen, Sanjeev Khanna, Ansh Nagda
👻 Ghosted cs.DS 36 5 years ago
186 Coordinate Methods for Matrix Games
Yair Carmon, Yujia Jin, ... (+2 more)
👻 Ghosted cs.DS 36 5 years ago
187 Online and Distribution-Free Robustness: Regression and Contextual Bandits with Huber Contamination
Sitan Chen, Frederic Koehler, ... (+2 more)
👻 Ghosted cs.LG 36 5 years ago
188 Handling Correlated Rounding Error via Preclustering: A 1.73-approximation for Correlation Clustering
Vincent Cohen-Addad, Euiwoong Lee, ... (+2 more)
👻 Ghosted cs.DS 36 2 years ago
189 Sample Efficient Estimation and Recovery in Sparse FFT via Isolation on Average
Michael Kapralov
👻 Ghosted cs.DS 35 8 years ago
190 General Framework for Metric Optimization Problems with Delay or with Deadlines
Yossi Azar, Noam Touitou
👻 Ghosted cs.DS 35 7 years ago
191 Fully Online Matching II: Beating Ranking and Water-filling
Zhiyi Huang, Zhihao Gavin Tang, ... (+2 more)
👻 Ghosted cs.DS 35 6 years ago
192 Almost 3-Approximate Correlation Clustering in Constant Rounds
Soheil Behnezhad, Moses Charikar, ... (+2 more)
👻 Ghosted cs.DS 35 4 years ago
193 Subexponential parameterized algorithms for planar and apex-minor-free graphs via low treewidth pattern covering
Fedor V. Fomin, Daniel Lokshtanov, ... (+4 more)
👻 Ghosted cs.DS 34 10 years ago
194 Decidability of Non-Interactive Simulation of Joint Distributions
Badih Ghazi, Pritish Kamath, Madhu Sudan
👻 Ghosted cs.IT 34 10 years ago
195 Linear algebraic analogues of the graph isomorphism problem and the Erdős-Rényi model
Yinan Li, Youming Qiao
👻 Ghosted cs.DS 34 8 years ago
196 Planar Graph Perfect Matching is in NC
Nima Anari, Vijay V. Vazirani
👻 Ghosted cs.DS 34 8 years ago
197 Minor-free graphs have light spanners
Glencora Borradaile, Hung Le, Christian Wulff-Nilsen
👻 Ghosted cs.DS 34 8 years ago
198 Efficiently Learning Mixtures of Mallows Models
Allen Liu, Ankur Moitra
👻 Ghosted cs.DS 34 7 years ago
199 Faster Matroid Intersection
Deeparnab Chakrabarty, Yin Tat Lee, ... (+3 more)
👻 Ghosted cs.DS 34 6 years ago
200 A proof that Reed-Muller codes achieve Shannon capacity on symmetric channels
Emmanuel Abbe, Colin Sandon
👻 Ghosted cs.IT 34 3 years ago