| 301 |
A Strong Separation for Adversarially Robust $\ell_0$ Estimation for Linear Sketches
Elena Gribelyuk, Honghao Lin, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
15 |
1 year ago |
| 302 |
Amortized Dynamic Cell-Probe Lower Bounds from Four-Party Communication
Omri Weinstein, Huacheng Yu
|
👻
Ghosted
|
cs.DS
|
14 |
10 years ago |
| 303 |
NP-Hardness of Reed-Solomon Decoding, and the Prouhet-Tarry-Escott Problem
Venkata Gandikota, Badih Ghazi, Elena Grigorescu
|
👻
Ghosted
|
cs.IT
|
14 |
9 years ago |
| 304 |
Algorithms for the ferromagnetic Potts model on expanders
Charlie Carlson, Ewan Davies, ... (+4 more)
|
👻
Ghosted
|
cs.DS
|
14 |
4 years ago |
| 305 |
Faster Pattern Matching under Edit Distance
Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz
|
👻
Ghosted
|
cs.DS
|
14 |
4 years ago |
| 306 |
Interior point methods are not worse than Simplex
Xavier Allamigeon, Daniel Dadush, ... (+3 more)
|
👻
Ghosted
|
math.OC
|
14 |
4 years ago |
| 307 |
Deterministic Small Vertex Connectivity in Almost Linear Time
Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
|
👻
Ghosted
|
cs.DS
|
14 |
3 years ago |
| 308 |
Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes
Rohan Goyal, Prahladh Harsha, ... (+2 more)
|
👻
Ghosted
|
cs.IT
|
14 |
2 years ago |
| 309 |
The ESPRIT algorithm under high noise: Optimal error scaling and noisy super-resolution
Zhiyan Ding, Ethan N. Epperly, ... (+2 more)
|
👻
Ghosted
|
cs.IT
|
14 |
2 years ago |
| 310 |
Testing Assignments to Constraint Satisfaction Problems
Hubie Chen, Matt Valeriote, Yuichi Yoshida
|
👻
Ghosted
|
cs.DS
|
13 |
9 years ago |
| 311 |
Improved Online Algorithm for Weighted Flow Time
Yossi Azar, Noam Touitou
|
👻
Ghosted
|
cs.DS
|
13 |
8 years ago |
| 312 |
Graph Sketching Against Adaptive Adversaries Applied to the Minimum Degree Algorithm
Matthew Fahrbach, Gary L. Miller, ... (+4 more)
|
👻
Ghosted
|
cs.DS
|
13 |
8 years ago |
| 313 |
A Tight Lower Bound on Adaptively Secure Full-Information Coin Flip
Iftach Haitner, Yonatan Karidi-Heller
|
👻
Ghosted
|
cs.CR
|
13 |
6 years ago |
| 314 |
A Gap-ETH-Tight Approximation Scheme for Euclidean TSP
Sándor Kisfaludi-Bak, Jesper Nederlof, Karol Węgrzycki
|
👻
Ghosted
|
cs.CG
|
13 |
5 years ago |
| 315 |
Computing in Anonymous Dynamic Networks Is Linear
Giuseppe A. Di Luna, Giovanni Viglietta
|
👻
Ghosted
|
cs.DC
|
13 |
4 years ago |
| 316 |
Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1
Vincent Cohen-Addad, Hung Le, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
13 |
3 years ago |
| 317 |
A PTAS for the Steiner Forest Problem in Doubling Metrics
T-H. Hubert Chan, Shuguang Hu, Shaofeng H. -C. Jiang
|
👻
Ghosted
|
cs.DS
|
12 |
9 years ago |
| 318 |
Subdeterminant Maximization via Nonconvex Relaxations and Anti-concentration
Javad B. Ebrahimi, Damian Straszak, Nisheeth K. Vishnoi
|
👻
Ghosted
|
cs.DS
|
12 |
9 years ago |
| 319 |
Multi-Resolution Hashing for Fast Pairwise Summations
Moses Charikar, Paris Siminelakis
|
👻
Ghosted
|
cs.DS
|
12 |
8 years ago |
| 320 |
A characterization of graph properties testable for general planar graphs with one-sided error (It is all about forbidden subgraphs)
Artur Czumaj, Christian Sohler
|
👻
Ghosted
|
cs.DS
|
12 |
6 years ago |
| 321 |
Isomorphism Testing for Graphs Excluding Small Minors
Martin Grohe, Daniel Neuen, Daniel Wiebking
|
👻
Ghosted
|
cs.DS
|
12 |
6 years ago |
| 322 |
Scheduling Precedence-Constrained Jobs on Related Machines with Communication Delay
Biswaroop Maiti, Rajmohan Rajaraman, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
12 |
6 years ago |
| 323 |
Shortest Paths without a Map, but with an Entropic Regularizer
Sébastien Bubeck, Christian Coester, Yuval Rabani
|
👻
Ghosted
|
cs.DS
|
12 |
4 years ago |
| 324 |
Cheeger Inequalities for Vertex Expansion and Reweighted Eigenvalues
Tsz Chiu Kwok, Lap Chi Lau, Kam Chuen Tung
|
👻
Ghosted
|
cs.DS
|
12 |
4 years ago |
| 325 |
Sampling Lovász Local Lemma For General Constraint Satisfaction Solutions In Near-Linear Time
Kun He, Chunyang Wang, Yitong Yin
|
👻
Ghosted
|
cs.DS
|
12 |
4 years ago |
| 326 |
Approximation Algorithms and Hardness for $n$-Pairs Shortest Paths and All-Nodes Shortest Cycles
Mina Dalirrooyfard, Ce Jin, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
12 |
4 years ago |
| 327 |
Improved Lower Bounds for Submodular Function Minimization
Deeparnab Chakrabarty, Andrei Graur, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
12 |
4 years ago |
| 328 |
On Weighted Graph Sparsification by Linear Sketching
Yu Chen, Sanjeev Khanna, Huan Li
|
👻
Ghosted
|
cs.DS
|
12 |
3 years ago |
| 329 |
Rounds vs Communication Tradeoffs for Maximal Independent Sets
Sepehr Assadi, Gillat Kol, Zhijun Zhang
|
👻
Ghosted
|
cs.DS
|
12 |
3 years ago |
| 330 |
Having Hope in Hops: New Spanners, Preservers and Lower Bounds for Hopsets
Shimon Kogan, Merav Parter
|
👻
Ghosted
|
cs.DS
|
12 |
3 years ago |
| 331 |
Computing linear sections of varieties: quantum entanglement, tensor decompositions and beyond
Nathaniel Johnston, Benjamin Lovitz, Aravindan Vijayaraghavan
|
👻
Ghosted
|
cs.DS
|
12 |
3 years ago |
| 332 |
Folklore Sampling is Optimal for Exact Hopsets: Confirming the $\sqrt{n}$ Barrier
Greg Bodwin, Gary Hoppenworth
|
👻
Ghosted
|
cs.DS
|
12 |
3 years ago |
| 333 |
Optimal Algorithms for Bounded Weighted Edit Distance
Alejandro Cassis, Tomasz Kociumaka, Philip Wellnitz
|
👻
Ghosted
|
cs.DS
|
12 |
3 years ago |
| 334 |
A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs
Vincent Cohen-Addad, Marcin Pilipczuk, Michał Pilipczuk
|
👻
Ghosted
|
cs.DS
|
11 |
7 years ago |
| 335 |
Finding monotone patterns in sublinear time
Omri Ben-Eliezer, Clément L. Canonne, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
11 |
6 years ago |
| 336 |
Quantum learning algorithms imply circuit lower bounds
Srinivasan Arunachalam, Alex B. Grilo, ... (+3 more)
|
👻
Ghosted
|
quant-ph
|
11 |
5 years ago |
| 337 |
Classical Verification of Quantum Computations in Linear Time
Jiayu Zhang
|
👻
Ghosted
|
quant-ph
|
11 |
4 years ago |
| 338 |
Fitting Metrics and Ultrametrics with Minimum Disagreements
Vincent Cohen-Addad, Chenglin Fan, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
11 |
3 years ago |
| 339 |
Near Optimal Memory-Regret Tradeoff for Online Learning
Binghui Peng, Aviad Rubinstein
|
👻
Ghosted
|
cs.DS
|
11 |
3 years ago |
| 340 |
Krylov Methods are (nearly) Optimal for Low-Rank Approximation
Ainesh Bakshi, Shyam Narayanan
|
👻
Ghosted
|
cs.DS
|
11 |
3 years ago |
| 341 |
A Randomized Algorithm for Single-Source Shortest Path on Undirected Real-Weighted Graphs
Ran Duan, Jiayi Mao, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
11 |
3 years ago |
| 342 |
Faster Algorithms for Text-to-Pattern Hamming Distances
Timothy M. Chan, Ce Jin, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
11 |
2 years ago |
| 343 |
Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric
Zeyu Guo, Chaoping Xing, ... (+2 more)
|
👻
Ghosted
|
cs.IT
|
11 |
2 years ago |
| 344 |
Fast Mixing in Sparse Random Ising Models
Kuikui Liu, Sidhanth Mohanty, ... (+2 more)
|
👻
Ghosted
|
math.PR
|
11 |
2 years ago |
| 345 |
Locally Stationary Distributions: A Framework for Analyzing Slow-Mixing Markov Chains
Kuikui Liu, Sidhanth Mohanty, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
11 |
2 years ago |
| 346 |
Fully Dynamic $k$-Clustering with Fast Update Time and Small Recourse
Sayan Bhattacharya, Martín Costa, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
11 |
1 year ago |
| 347 |
Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
Niv Buchbinder, Moran Feldman
|
👻
Ghosted
|
cs.DS
|
11 |
1 year ago |
| 348 |
Amplification and Derandomization Without Slowdown
Ofer Grossman, Dana Moshkovitz
|
👻
Ghosted
|
cs.DS
|
10 |
10 years ago |
| 349 |
Spectral analysis of matrix scaling and operator scaling
Tsz Chiu Kwok, Lap Chi Lau, Akshay Ramachandran
|
👻
Ghosted
|
cs.DS
|
10 |
7 years ago |
| 350 |
Maximizing Determinants under Matroid Constraints
Vivek Madan, Aleksandar Nikolov, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
10 |
6 years ago |