R.I.P.
👻
Ghosted
🏛️ The Data Structures & Algorithms Crypt
cs.DS: Where Data Structures & Algorithms papers rest without their code.
12943
Total Papers
12053
No Code
76
Twilight
814
Has Code
6.3%
Survival Rate
R.I.P.
👻
Ghosted
Optimal Static Dictionary with Worst-Case Constant Query Time
R.I.P.
👻
Ghosted
Computational Explorations of Total Variation Distance
R.I.P.
👻
Ghosted
The Two-Center Problem of Uncertain Points on Trees
R.I.P.
👻
Ghosted
The Cost of Consistency: Submodular Maximization with Constant Recourse
R.I.P.
👻
Ghosted
You (Almost) Can't Beat Brute Force for 3-Matroid Intersection
R.I.P.
👻
Ghosted
Near-Optimal Resilient Labeling Schemes
R.I.P.
👻
Ghosted
Better Approximation for Weighted $k$-Matroid Intersection
R.I.P.
👻
Ghosted
A Simple and Fast Algorithm for Fair Cuts
R.I.P.
👻
Ghosted
Near-Optimal Trace Reconstruction for Mildly Separated Strings
R.I.P.
👻
Ghosted
Optimal root recovery for uniform attachment trees and $d$-regular growing trees
R.I.P.
👻
Ghosted
Smoothed Analysis of the k-Swap Neighborhood for Makespan Scheduling
R.I.P.
👻
Ghosted
Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth
R.I.P.
👻
Ghosted
On the structure of normalized models of circular-arc graphs -- Hsu's approach revisited
R.I.P.
👻
Ghosted
Oblivious Algorithms for Maximum Directed Cut: New Upper and Lower Bounds
R.I.P.
👻
Ghosted
Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing
R.I.P.
👻
Ghosted
Matroid Secretary via Labeling Schemes
R.I.P.
👻
Ghosted
A Bicriterion Concentration Inequality and Prophet Inequalities for $k$-Fold Matroid Unions
R.I.P.
👻
Ghosted
Fully Dynamic Adversarially Robust Correlation Clustering in Polylogarithmic Update Time
R.I.P.
👻
Ghosted
Listing 6-Cycles in Sparse Graphs
R.I.P.
👻
Ghosted
Simple approximation algorithms for Polyamorous Scheduling
R.I.P.
👻
Ghosted
Monotone Submodular Multiway Partition
R.I.P.
👻
Ghosted
Safe Sequences via Dominators in DAGs for Path-Covering Problems
R.I.P.
👻
Ghosted