💀 The Wall of Shame

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

Page 13, showing 29 papers

# Paper Cause of Death Category Citations Published
601 Entangled Mean Estimation in High-Dimensions
Ilias Diakonikolas, Daniel M. Kane, ... (+2 more)
👻 Ghosted cs.DS 1 1 year ago
602 A Generalized Trace Reconstruction Problem: Recovering a String of Probabilities
Joey Rivkin, Gregory Valiant, Paul Valiant
👻 Ghosted cs.DS 1 1 year ago
603 Statistical inference of a ranked community in a directed graph
Dmitriy Kunisky, Daniel A. Spielman, ... (+2 more)
👻 Ghosted math.ST 1 1 year ago
604 Fast, robust approximate message passing
Misha Ivkov, Tselil Schramm
👻 Ghosted cs.DS 1 1 year ago
605 Subexponential Parameterized Algorithms for Hitting Subgraphs
Daniel Lokshtanov, Fahad Panolan, ... (+3 more)
👻 Ghosted cs.DS 1 1 year ago
606 Dynamic Locality Sensitive Orderings in Doubling Metrics
An La, Hung Le
👻 Ghosted cs.DS 1 2 years ago
607 Explicit Orthogonal Arrays and Universal Hashing with Arbitrary Parameters
Nicholas Harvey, Arvin Sahami
👻 Ghosted cs.DS 1 2 years ago
608 Polylog-Competitive Deterministic Local Routing and Scheduling
Bernhard Haeupler, Shyamal Patel, ... (+3 more)
👻 Ghosted cs.DC 1 2 years ago
609 List-Decoding Capacity Implies Capacity on the q-ary Symmetric Channel
Francisco Pernice, Oscar Sprumont, Mary Wootters
👻 Ghosted cs.IT 1 1 year ago
610 Leakage-Resilient Extractors against Number-on-Forehead Protocols
Eshan Chattopadhyay, Jesse Goodman
🔮 The Ethereal cs.CC 1 1 year ago
611 On Reductions and Representations of Learning Problems in Euclidean Spaces
Bogdan Chornomaz, Shay Moran, Tom Waknine
👻 Ghosted cs.LG 1 1 year ago
612 Approximating binary longest common subsequence in almost-linear time
Xiaoyu He, Ray Li
👻 Ghosted cs.DS 1 3 years ago
613 A Framework for Building Data Structures from Communication Protocols
Alexandr Andoni, Shunhua Jiang, Omri Weinstein
👻 Ghosted cs.DS 0 1 year ago
614 Linear Hashing Is Optimal
Michael Jaber, Vinayak M. Kumar, David Zuckerman
👻 Ghosted cs.DS 0 1 year ago
615 Breaking the Barrier of Self-Concordant Barriers: Faster Interior Point Methods for M-Matrices
Adrian Vladu
👻 Ghosted cs.DS 0 1 year ago
616 A Tolerant Independent Set Tester
Cameron Seth
👻 Ghosted cs.DS 0 1 year ago
617 On the Hardness Hierarchy for the $O(n \sqrt{\log n})$ Complexity in the Word RAM
Dominik Kempa, Tomasz Kociumaka
👻 Ghosted cs.DS 0 1 year ago
618 History-Independent Concurrent Hash Tables
Hagit Attiya, Michael A. Bender, ... (+3 more)
👻 Ghosted cs.DC 0 1 year ago
619 Faster Distributed $Δ$-Coloring via Ruling Subgraphs
Yann Bourreau, Sebastian Brandt, Alexandre Nolin
👻 Ghosted cs.DC 0 1 year ago
620 Faster Lattice Basis Computation via a Natural Generalization of the Euclidean Algorithm
Kim-Manuel Klein, Janina Reuter
👻 Ghosted cs.DS 0 2 years ago
621 Harmonic Decomposition in Data Sketches
Dingyu Wang
👻 Ghosted cs.DS 0 2 years ago
622 Strong XOR Lemma for Information Complexity
Pachara Sawettamalya, Huacheng Yu
🔮 The Ethereal cs.CC 0 1 year ago
623 Backdoor attacks on DNN and GBDT -- A Case Study from the insurance domain
Robin Kühlem, Daniel Otten, ... (+4 more)
👻 Ghosted cs.LG 0 1 year ago
624 $(1-ε)$-Approximation of Knapsack in Nearly Quadratic Time
Xiao Mao
👻 Ghosted cs.DS 0 3 years ago
625 CREPE Notes: A new method for segmenting pitch contours into discrete notes
Xavier Riley, Simon Dixon
👻 Ghosted cs.SD 0 2 years ago
626 Climbing LP Algorithms
Leonid A. Levin
👻 Ghosted cs.DS 0 5 years ago
627 A limit field for orthogonal range searches in two-dimensional random point search trees
Nicolas Broutin, Henning Sulzbach
👻 Ghosted math.PR 0 8 years ago
628 A Scaling Analysis of a Star Network with Logarithmic Weights
Philippe Robert, Amandine Véber
👻 Ghosted math.PR 0 9 years ago
629 Near-Linear $\varepsilon$-Emulators for Planar Graphs
Hsien-Chih Chang, Robert Krauthgamer, Zihan Tan
👻 Ghosted cs.DS 0 4 years ago