🏛️ The Data Structures & Algorithms Crypt

R.I.P. 👻 Ghosted

A Unified Approach to Discrepancy Minimization

Nikhil Bansal, Aditi Laddha, Santosh S. Vempala

cs.DS 🏛 APPROX W 📚 10 cites 4 years ago

R.I.P. 👻 Ghosted

Properly learning monotone functions via local reconstruction

Jane Lange, Ronitt Rubinfeld, Arsen Vasilyan

cs.DS 🏛 FOCS 📚 10 cites 4 years ago

R.I.P. 👻 Ghosted

Subquadratic Dynamic Path Reporting in Directed Graphs Against an Adaptive Adversary

Adam Karczmarz, Anish Mukherjee, Piotr Sankowski

cs.DS 🏛 STOC 📚 10 cites 4 years ago

R.I.P. 👻 Ghosted

An improved approximation algorithm for maximizing a DR-submodular function over a convex set

Donglei Du, Zhicheng Liu, ... (+3 more)

cs.DS 🏛 arXiv 📚 10 cites 4 years ago

R.I.P. 👻 Ghosted

Online Task Assignment Problems with Reusable Resources

Hanna Sumita, Shinji Ito, ... (+5 more)

cs.DS 🏛 AAAI 📚 10 cites 4 years ago

R.I.P. 👻 Ghosted

The Role of Interactivity in Structured Estimation

Jayadev Acharya, Clément L. Canonne, ... (+2 more)

cs.DS 🏛 COLT 📚 10 cites 4 years ago

R.I.P. 👻 Ghosted

Online Unit Profit Knapsack with Untrusted Predictions

Joan Boyar, Lene M. Favrholdt, Kim S. Larsen

cs.DS 🏛 Scandinavian Workshop on Algorithm Theory 📚 10 cites 4 years ago

R.I.P. 👻 Ghosted

A PTAS for Packing Hypercubes into a Knapsack

Klaus Jansen, Arindam Khan, ... (+2 more)

cs.DS 🏛 ICALP 📚 10 cites 4 years ago

R.I.P. 👻 Ghosted

Improved bounds for randomly colouring simple hypergraphs

Weiming Feng, Heng Guo, Jiaheng Wang

cs.DS 🏛 APPROX W 📚 10 cites 4 years ago

R.I.P. 👻 Ghosted

Lossy Planarization: A Constant-Factor Approximate Kernelization for Planar Vertex Deletion

Bart M. P. Jansen, Michał Włodarczyk

cs.DS 🏛 STOC 📚 10 cites 4 years ago

R.I.P. 👻 Ghosted

An Asymptotically Optimal Algorithm for Maximum Matching in Dynamic Streams

Sepehr Assadi, Vihan Shah

cs.DS 🏛 ITCS 📚 10 cites 4 years ago

R.I.P. 👻 Ghosted

Sparsification of Decomposable Submodular Functions

Akbar Rafiey, Yuichi Yoshida

cs.DS 🏛 AAAI 📚 10 cites 4 years ago

R.I.P. 👻 Ghosted

Faster Counting and Sampling Algorithms using Colorful Decision Oracle

Anup Bhattacharya, Arijit Bishnu, ... (+2 more)

cs.DS 🏛 STACS 📚 10 cites 4 years ago

R.I.P. 👻 Ghosted

Fixation Maximization in the Positional Moran Process

Joachim Brendborg, Panagiotis Karras, ... (+3 more)

cs.DS 🏛 AAAI 📚 10 cites 4 years ago

📚 📚 The Cartographer

Modern Minimal Perfect Hashing: A Survey

Hans-Peter Lehmann, Thomas Mueller, ... (+5 more)

cs.DS 🏛 ACM CSUR 📚 9 cites 1 year ago

R.I.P. 👻 Ghosted

How to Protect Yourself from Threatening Skeletons: Optimal Padded Decompositions for Minor-Free Graphs

Jonathan Conroy, Arnold Filtser

cs.DS 🏛 STOC 📚 9 cites 1 year ago

R.I.P. 👻 Ghosted

Fully Dynamic $k$-Median with Near-Optimal Update Time and Recourse

Sayan Bhattacharya, Martín Costa, Ermiya Farokhnejad

cs.DS 🏛 arXiv 📚 9 cites 1 year ago

R.I.P. 👻 Ghosted

Parallel Sampling via Counting

Nima Anari, Ruiquan Gao, Aviad Rubinstein

cs.DS 🏛 STOC 📚 9 cites 1 year ago

R.I.P. 👻 Ghosted

Deterministic Online Bipartite Edge Coloring

Joakim Blikstad, Ola Svensson, ... (+2 more)

cs.DS 🏛 SODA 📚 9 cites 1 year ago

R.I.P. 👻 Ghosted

Simpler Optimal Sorting from a Directed Acyclic Graph

Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann

cs.DS 🏛 SOSA 📚 9 cites 1 year ago

R.I.P. 👻 Ghosted

Pairwise-Independent Contention Resolution

Anupam Gupta, Jinqiao Hu, ... (+2 more)

cs.DS 🏛 IPCO 📚 9 cites 2 years ago

R.I.P. 👻 Ghosted

Randomized Greedy Online Edge Coloring Succeeds for Dense and Randomly-Ordered Graphs

Aditi Dudeja, Rashmika Goswami, Michael Saks

cs.DS 🏛 SODA 📚 9 cites 2 years ago

R.I.P. 👻 Ghosted

Tolerant Algorithms for Learning with Arbitrary Covariate Shift

Surbhi Goel, Abhishek Shetty, ... (+2 more)

cs.DS 🏛 NeurIPS 📚 9 cites 2 years ago

R.I.P. 👻 Ghosted

Lower Bounds for Private Estimation of Gaussian Covariance Matrices under All Reasonable Parameter Regimes

Victor S. Portella, Nick Harvey

cs.DS 🏛 arXiv 📚 9 cites 2 years ago