💀 The Wall of Shame

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

Page 3, showing 50 papers

# Paper Cause of Death Category Citations Published
101 Consistent Hashing with Bounded Loads
Vahab Mirrokni, Mikkel Thorup, Morteza Zadimoghaddam
👻 Ghosted cs.DS 57 9 years ago
102 Fully dynamic all-pairs shortest paths with worst-case update-time revisited
Ittai Abraham, Shiri Chechik, Sebastian Krinninger
👻 Ghosted cs.DS 57 9 years ago
103 Faster Algorithms for Edge Connectivity via Random $2$-Out Contractions
Mohsen Ghaffari, Krzysztof Nowicki, Mikkel Thorup
👻 Ghosted cs.DS 56 6 years ago
104 Approximation Schemes for Clustering with Outliers
Zachary Friggstad, Kamyar Khodamoradi, ... (+2 more)
👻 Ghosted cs.DS 56 8 years ago
105 Parameterized Complexity and Approximability of Directed Odd Cycle Transversal
Daniel Lokshtanov, M. S. Ramanujan, ... (+2 more)
👻 Ghosted cs.DS 56 9 years ago
106 Fully Dynamic Connectivity in $O(\log n(\log\log n)^2)$ Amortized Expected Time
Shang-En Huang, Dawei Huang, ... (+3 more)
👻 Ghosted cs.DS 56 9 years ago
107 Better Distance Preservers and Additive Spanners
Greg Bodwin, Virginia Vassilevska Williams
👻 Ghosted cs.DS 56 10 years ago
108 CoveringLSH: Locality-sensitive Hashing without False Negatives
Rasmus Pagh
👻 Ghosted cs.DS 55 10 years ago
109 Chasing Convex Bodies with Linear Competitive Ratio
C. J. Argue, Anupam Gupta, ... (+2 more)
👻 Ghosted cs.DS 54 6 years ago
110 Stability of the Lanczos Method for Matrix Function Approximation
Cameron Musco, Christopher Musco, Aaron Sidford
👻 Ghosted cs.DS 54 8 years ago
111 Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design
Aleksandar Nikolov, Mohit Singh, Uthaipon Tao Tantipongpipat
👻 Ghosted cs.DS 53 8 years ago
112 The Complexity of Distributed Edge Coloring with Small Palettes
Yi-Jun Chang, Qizheng He, ... (+3 more)
👻 Ghosted cs.DC 53 8 years ago
113 Popular Matching in Roommates Setting is NP-hard
Sushmita Gupta, Pranabendu Misra, ... (+2 more)
👻 Ghosted cs.DS 52 8 years ago
114 Approximation algorithms for stochastic and risk-averse optimization
Jaroslaw Byrka, Aravind Srinivasan
👻 Ghosted cs.DS 52 8 years ago
115 Better Tradeoffs for Exact Distance Oracles in Planar Graphs
Paweł Gawrychowski, Shay Mozes, ... (+2 more)
👻 Ghosted cs.DS 52 8 years ago
116 A Framework for Similarity Search with Space-Time Tradeoffs using Locality-Sensitive Filtering
Tobias Christiani
👻 Ghosted cs.DS 52 9 years ago
117 Subtree Isomorphism Revisited
Amir Abboud, Arturs Backurs, ... (+3 more)
🔮 The Ethereal cs.CC 52 10 years ago
118 On the Difference Between Closest, Furthest, and Orthogonal Pairs: Nearly-Linear vs Barely-Subquadratic Complexity in Computational Geometry
Ryan Williams
👻 Ghosted cs.CG 51 8 years ago
119 An Equivalence Class for Orthogonal Vectors
Lijie Chen, Ryan Williams
👻 Ghosted cs.DS 50 7 years ago
120 Deterministic (1/2 + ε)-Approximation for Submodular Maximization over a Matroid
Niv Buchbinder, Moran Feldman, Mohit Garg
👻 Ghosted cs.DS 50 7 years ago
121 Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems
Alina Ene, Jan Vondrak, Yi Wu
👻 Ghosted cs.DS 50 11 years ago
122 Improved Approximation Algorithms for k-Submodular Function Maximization
Satoru Iwata, Shin-ichi Tanigawa, Yuichi Yoshida
👻 Ghosted cs.DS 50 11 years ago
123 Distributed Triangle Detection via Expander Decomposition
Yi-Jun Chang, Seth Pettie, Hengjie Zhang
👻 Ghosted cs.DS 49 7 years ago
124 Coresets for Clustering in Excluded-minor Graphs and Beyond
Vladimir Braverman, Shaofeng H. -C. Jiang, ... (+2 more)
👻 Ghosted cs.DS 48 6 years ago
125 Beating Greedy for Stochastic Bipartite Matching
Buddhima Gamlath, Sagar Kale, Ola Svensson
👻 Ghosted cs.DS 48 6 years ago
126 Tight Analysis of Randomized Greedy MIS
Manuela Fischer, Andreas Noever
👻 Ghosted cs.DS 48 8 years ago
127 Parameter-free Locality Sensitive Hashing for Spherical Range Reporting
Thomas D. Ahle, Martin Aumüller, Rasmus Pagh
👻 Ghosted cs.DS 48 9 years ago
128 Almost Tight Error Bounds on Differentially Private Continual Counting
Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay
👻 Ghosted cs.LG 48 3 years ago
129 Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms
Sebastian Forster, Danupon Nanongkai, ... (+3 more)
👻 Ghosted cs.DS 47 6 years ago
130 Optimal streaming and tracking distinct elements with high probability
Jarosław Błasiok
👻 Ghosted cs.DS 47 8 years ago
131 Competitive Analysis with a Sample and the Secretary Problem
Haim Kaplan, David Naori, Danny Raz
👻 Ghosted cs.DS 46 6 years ago
132 A 1.5-Approximation for Path TSP
Rico Zenklusen
🔮 The Ethereal cs.DM 46 7 years ago
133 Connecting Robust Shuffle Privacy and Pan-Privacy
Victor Balcer, Albert Cheu, ... (+2 more)
👻 Ghosted cs.CR 45 6 years ago
134 Detecting Feedback Vertex Sets of Size $k$ in $O^\star(2.7^k)$ Time
Jason Li, Jesper Nederlof
👻 Ghosted cs.DS 45 6 years ago
135 An Algorithmic Blend of LPs and Ring Equations for Promise CSPs
Joshua Brakensiek, Venkatesan Guruswami
🔮 The Ethereal cs.CC 45 7 years ago
136 An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market
Rann Duan, Jugal Garg, Kurt Mehlhorn
👻 Ghosted cs.DS 45 10 years ago
137 On Indexing and Compressing Finite Automata
Nicola Cotumaccio, Nicola Prezza
👻 Ghosted cs.DS 44 5 years ago
138 Tight Running Time Lower Bounds for Strong Inapproximability of Maximum $k$-Coverage, Unique Set Cover and Related Problems (via $t$-Wise Agreement Testing Theorem)
Pasin Manurangsi
🔮 The Ethereal cs.CC 44 6 years ago
139 Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples
Michael Kapralov, Slobodan Mitrović, ... (+2 more)
👻 Ghosted cs.DS 44 6 years ago
140 Metrical task systems on trees via mirror descent and unfair gluing
Sébastien Bubeck, Michael B. Cohen, ... (+2 more)
👻 Ghosted cs.DS 44 7 years ago
141 A Nearly Instance Optimal Algorithm for Top-k Ranking under the Multinomial Logit Model
Xi Chen, Yuanzhi Li, Jieming Mao
👻 Ghosted cs.DS 44 8 years ago
142 Approximation and Kernelization for Chordal Vertex Deletion
Bart M. P. Jansen, Marcin Pilipczuk
👻 Ghosted cs.DS 44 9 years ago
143 Explicit resilient functions matching Ajtai-Linial
Raghu Meka
🔮 The Ethereal cs.CC 44 10 years ago
144 Directed multicut is W[1]-hard, even for four terminal pairs
Marcin Pilipczuk, Magnus Wahlström
👻 Ghosted cs.DS 44 10 years ago
145 Ultrasparse Ultrasparsifiers and Faster Laplacian System Solvers
Arun Jambulapati, Aaron Sidford
👻 Ghosted cs.DS 43 5 years ago
146 Deterministically Maintaining a $(2+ε)$-Approximate Minimum Vertex Cover in $O(1/ε^2)$ Amortized Update Time
Sayan Bhattacharya, Janardhan Kulkarni
👻 Ghosted cs.DS 43 7 years ago
147 Improved Coresets for Kernel Density Estimates
Jeff M. Phillips, Wai Ming Tai
👻 Ghosted cs.LG 43 8 years ago
148 Kirchhoff Index As a Measure of Edge Centrality in Weighted Networks: Nearly Linear Time Algorithms
Huan Li, Zhongzhi Zhang
👻 Ghosted cs.DS 43 8 years ago
149 A constructive algorithm for the LLL on permutations
David G. Harris, Aravind Srinivasan
👻 Ghosted cs.DS 43 9 years ago
150 Iterative Refinement for $\ell_p$-norm Regression
Deeksha Adil, Rasmus Kyng, ... (+2 more)
👻 Ghosted cs.DS 42 7 years ago