R.I.P.
👻
Ghosted
🏛️ The Data Structures & Algorithms Crypt
cs.DS: Where Data Structures & Algorithms papers rest without their code.
12879
Total Papers
12053
No Code
76
Twilight
750
Has Code
5.8%
Survival Rate
R.I.P.
👻
Ghosted
Approximating activation edge-cover and facility location problems
R.I.P.
👻
Ghosted
Information theoretical clustering is hard to approximate
R.I.P.
👻
Ghosted
Partial Function Extension with Applications to Learning and Property Testing
R.I.P.
👻
Ghosted
A Polynomial Time Algorithm for Maximum Likelihood Estimation of Multivariate Log-concave Densities
R.I.P.
👻
Ghosted
$k$-Cut: A Simple Approximately-Uniform Method for Sampling Ballots in Post-Election Audits
R.I.P.
👻
Ghosted
On compact representations of Voronoi cells of lattices
R.I.P.
👻
Ghosted
Faster sublinear approximations of $k$-cliques for low arboricity graphs
R.I.P.
👻
Ghosted
Interactive coding resilient to an unknown number of erasures
R.I.P.
👻
Ghosted
The entropy of lies: playing twenty questions with a liar
R.I.P.
👻
Ghosted
Submodular Maximization Under A Matroid Constraint: Asking more from an old friend, the Greedy Algorithm
R.I.P.
👻
Ghosted
Distinct Sampling on Streaming Data with Near-Duplicates
R.I.P.
👻
Ghosted
A study on load-balanced variants of the bin packing problem
R.I.P.
👻
Ghosted
Fast and Longest Rollercoasters
R.I.P.
👻
Ghosted
On-line partitioning of width w posets into w^O(log log w) chains
R.I.P.
👻
Ghosted
Almost optimal algorithms for diameter-optimally augmenting trees
R.I.P.
👻
Ghosted
Multi-Modal Route Planning in Road and Transit Networks
R.I.P.
👻
Ghosted
Massively Parallel Dynamic Programming on Trees
R.I.P.
👻
Ghosted
Top-k Overlapping Densest Subgraphs: Approximation and Complexity
R.I.P.
👻
Ghosted
SOS lower bounds with hard constraints: think global, act local
R.I.P.
👻
Ghosted
Hashing with Linear Probing and Referential Integrity
R.I.P.
👻
Ghosted
Using statistical encoding to achieve tree succinctness never seen before
R.I.P.
👻
Ghosted
Approximating the shortest path problem with scenarios
R.I.P.
👻
Ghosted