💀 The Wall of Shame

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

Page 2, showing 50 papers

# Paper Cause of Death Category Citations Published
51 Seeded Graph Matching via Large Neighborhood Statistics
Elchanan Mossel, Jiaming Xu
👻 Ghosted cs.LG 82 7 years ago
52 The Price of Information in Combinatorial Optimization
Sahil Singla
👻 Ghosted cs.DS 82 8 years ago
53 Nash Social Welfare for Indivisible Items under Separable, Piecewise-Linear Concave Utilities
Nima Anari, Tung Mai, ... (+2 more)
👻 Ghosted cs.GT 81 9 years ago
54 Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce
Mahdi Boroujeni, Soheil Ehsani, ... (+3 more)
👻 Ghosted cs.DS 80 7 years ago
55 Fast Generation of Random Spanning Trees and the Effective Resistance Metric
Aleksander Madry, Damian Straszak, Jakub Tarnawski
👻 Ghosted cs.DS 80 11 years ago
56 Multivariate Fine-Grained Complexity of Longest Common Subsequence
Karl Bringmann, Marvin Künnemann
🔮 The Ethereal cs.CC 78 8 years ago
57 Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs
Sergio Cabello
👻 Ghosted cs.DS 78 9 years ago
58 A $(2+ε)$-Approximation for Maximum Weight Matching in the Semi-Streaming Model
Ami Paz, Gregory Schwartzman
👻 Ghosted cs.DS 78 9 years ago
59 A Logarithmic Additive Integrality Gap for Bin Packing
Rebecca Hoberg, Thomas Rothvoss
👻 Ghosted cs.DS 78 11 years ago
60 Fast Space Optimal Leader Election in Population Protocols
Leszek Gasieniec, Grzegorz Stachowiak
👻 Ghosted cs.DC 77 8 years ago
61 A Hierarchy of Lower Bounds for Sublinear Additive Spanners
Amir Abboud, Greg Bodwin, Seth Pettie
👻 Ghosted cs.DS 77 9 years ago
62 Stabilizing Consensus with Many Opinions
Luca Becchetti, Andrea Clementi, ... (+3 more)
👻 Ghosted cs.DC 77 10 years ago
63 A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching
Aaron Bernstein, Sebastian Forster, Monika Henzinger
👻 Ghosted cs.DS 76 7 years ago
64 Submodular Maximization with Nearly-optimal Approximation and Adaptivity in Nearly-linear Time
Alina Ene, Huy L. Nguyen
👻 Ghosted cs.DS 75 7 years ago
65 Random cluster dynamics for the Ising model is rapidly mixing
Heng Guo, Mark Jerrum
👻 Ghosted cs.DS 75 9 years ago
66 Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in $O(\log^3 n)$ Worst Case Update Time
Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai
👻 Ghosted cs.DS 73 8 years ago
67 Using Optimization to Obtain a Width-Independent, Parallel, Simpler, and Faster Positive SDP Solver
Zeyuan Allen-Zhu, Yin Tat Lee, Lorenzo Orecchia
👻 Ghosted cs.DS 73 10 years ago
68 Adaptivity Gaps for Stochastic Probing: Submodular and XOS Functions
Anupam Gupta, Viswanath Nagarajan, Sahil Singla
👻 Ghosted cs.DS 72 9 years ago
69 Quantum tomography using state-preparation unitaries
Joran van Apeldoorn, Arjan Cornelissen, ... (+2 more)
👻 Ghosted quant-ph 72 3 years ago
70 List Decodable Learning via Sum of Squares
Prasad Raghavendra, Morris Yau
👻 Ghosted cs.DS 70 6 years ago
71 Optimal Dynamic Strings
Paweł Gawrychowski, Adam Karczmarz, ... (+3 more)
👻 Ghosted cs.DS 70 10 years ago
72 The Expander Hierarchy and its Applications to Dynamic Graph Algorithms
Gramoz Goranci, Harald Räcke, ... (+2 more)
👻 Ghosted cs.DS 69 5 years ago
73 The Complexity of Contracts
Paul Duetting, Tim Roughgarden, Inbal Talgam-Cohen
👻 Ghosted cs.DS 68 6 years ago
74 Online Nash Social Welfare Maximization with Predictions
Siddhartha Banerjee, Vasilis Gkatzelis, ... (+2 more)
👻 Ghosted cs.GT 67 5 years ago
75 Locally Private k-Means Clustering
Uri Stemmer
👻 Ghosted cs.LG 67 6 years ago
76 Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis
Jiaqing Jiang, Xiaoming Sun, ... (+4 more)
👻 Ghosted quant-ph 66 6 years ago
77 Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
David Coudert, Guillaume Ducoffe, Alexandru Popa
👻 Ghosted cs.DS 66 8 years ago
78 Improved Bounds for Randomly Sampling Colorings via Linear Programming
Sitan Chen, Michelle Delcourt, ... (+3 more)
👻 Ghosted cs.DS 65 7 years ago
79 Submodular Function Maximization in Parallel via the Multilinear Relaxation
Chandra Chekuri, Kent Quanrud
👻 Ghosted cs.DS 65 7 years ago
80 Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in $\tilde{O}(m^{10/7} \log W)$ Time
Michael B. Cohen, Aleksander Madry, ... (+2 more)
👻 Ghosted cs.DS 65 9 years ago
81 Faster Online Matrix-Vector Multiplication
Kasper Green Larsen, Ryan Williams
👻 Ghosted cs.DS 65 9 years ago
82 Chasing Convex Bodies Optimally
Mark Sellke
👻 Ghosted cs.DS 64 6 years ago
83 Hierarchical Clustering better than Average-Linkage
Moses Charikar, Vaggos Chatziafratis, Rad Niazadeh
👻 Ghosted cs.DS 64 7 years ago
84 Submodular Maximization with Nearly Optimal Approximation, Adaptivity and Query Complexity
Matthew Fahrbach, Vahab Mirrokni, Morteza Zadimoghaddam
👻 Ghosted cs.DS 64 7 years ago
85 Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time
J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
👻 Ghosted cs.DS 64 9 years ago
86 Cheeger Inequalities for Submodular Transformations
Yuichi Yoshida
👻 Ghosted cs.DS 63 8 years ago
87 Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can)
Karl Bringmann, Paweł Gawrychowski, ... (+2 more)
👻 Ghosted cs.DS 63 9 years ago
88 Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion
Eden Chlamtáč, Michael Dinitz, Yury Makarychev
👻 Ghosted cs.DS 63 9 years ago
89 Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model
Zhiyi Huang, Binghui Peng, ... (+4 more)
👻 Ghosted cs.DS 62 7 years ago
90 Make Up Your Mind: The Price of Online Queries in Differential Privacy
Mark Bun, Thomas Steinke, Jonathan Ullman
👻 Ghosted cs.CR 62 9 years ago
91 Maximally Recoverable Codes for Grid-like Topologies
Parikshit Gopalan, Guangda Hu, ... (+4 more)
👻 Ghosted cs.IT 61 9 years ago
92 The k-mismatch problem revisited
Raphaël Clifford, Allyx Fontaine, ... (+3 more)
👻 Ghosted cs.DS 61 10 years ago
93 Range Predecessor and Lempel-Ziv Parsing
Djamal Belazzougui, Simon J. Puglisi
👻 Ghosted cs.DS 60 10 years ago
94 Stronger Privacy Amplification by Shuffling for Rényi and Approximate Differential Privacy
Vitaly Feldman, Audra McMillan, Kunal Talwar
👻 Ghosted cs.CR 60 3 years ago
95 Solving Sparse Linear Systems Faster than Matrix Multiplication
Richard Peng, Santosh Vempala
👻 Ghosted cs.DS 59 5 years ago
96 Rapid mixing from spectral independence beyond the Boolean domain
Weiming Feng, Heng Guo, ... (+2 more)
👻 Ghosted cs.DS 59 5 years ago
97 Rapid Mixing for Colorings via Spectral Independence
Zongchen Chen, Andreas Galanis, ... (+2 more)
👻 Ghosted cs.DS 59 5 years ago
98 Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings
Jugal Garg, Pooja Kulkarni, Rucha Kulkarni
👻 Ghosted cs.GT 57 6 years ago
99 Chasing Nested Convex Bodies Nearly Optimally
Sébastien Bubeck, Bo'az Klartag, ... (+3 more)
👻 Ghosted cs.DS 57 7 years ago
100 Spectral Sparsification of Hypergraphs
Tasuku Soma, Yuichi Yoshida
👻 Ghosted cs.DS 57 7 years ago