R.I.P.
👻
Ghosted
🏛️ The Data Structures & Algorithms Crypt
cs.DS: Where Data Structures & Algorithms papers rest without their code.
12855
Total Papers
12053
No Code
76
Twilight
726
Has Code
5.6%
Survival Rate
R.I.P.
👻
Ghosted
Structural Equivalence in Subgraph Matching
R.I.P.
👻
Ghosted
Testing Product Distributions: A Closer Look
R.I.P.
👻
Ghosted
Approximate Trace Reconstruction
R.I.P.
👻
Ghosted
Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding
R.I.P.
👻
Ghosted
Efficient Algorithms to Mine Maximal Span-Trusses From Temporal Graphs
R.I.P.
👻
Ghosted
Similarity Search with Tensor Core Units
R.I.P.
👻
Ghosted
Bundled References: An Abstraction for Highly-Concurrent Linearizable Range Queries
R.I.P.
👻
Ghosted
Isomorphism Testing for Graphs Excluding Small Topological Subgraphs
R.I.P.
👻
Ghosted
Near-linear-time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs
R.I.P.
👻
Ghosted
Making mean-estimation more efficient using an MCMC trace variance approach: DynaMITE
R.I.P.
👻
Ghosted
Non-Adaptive Matroid Prophet Inequalities
R.I.P.
👻
Ghosted
Towards Better Approximation of Graph Crossing Number
R.I.P.
👻
Ghosted
Counting Homomorphic Cycles in Degenerate Graphs
R.I.P.
👻
Ghosted
Unique Decoding of Explicit $ε$-balanced Codes Near the Gilbert-Varshamov Bound
R.I.P.
👻
Ghosted
The Hierarchical Chinese Postman Problem: the slightest disorder makes it hard, yet disconnectedness is manageable
R.I.P.
👻
Ghosted
Distance problems within Helly graphs and $k$-Helly graphs
R.I.P.
👻
Ghosted
Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs
R.I.P.
👻
Ghosted
Linear-Delay Enumeration for Minimal Steiner Problems
R.I.P.
👻
Ghosted
Sorting Short Keys in Circuits of Size o(n log n)
R.I.P.
👻
Ghosted
Succinct Navigational Oracles for Families of Intersection Graphs on a Circle
R.I.P.
👻
Ghosted
Query Minimization under Stochastic Uncertainty
R.I.P.
👻
Ghosted
The smoothed complexity of Frank-Wolfe methods via conditioning of random matrices and polytopes
R.I.P.
👻
Ghosted