| 451 |
Quartic quantum speedups for planted inference
Alexander Schmidhuber, Ryan O'Donnell, ... (+2 more)
|
👻
Ghosted
|
quant-ph
|
12 |
2 years ago |
| 452 |
Online Probabilistic Metric Embedding: A General Framework for Bypassing Inherent Bounds
Yair Bartal, Ora N. Fandina, Seeun William Umboh
|
👻
Ghosted
|
cs.DS
|
12 |
2 years ago |
| 453 |
Simple and Fast Rounding Algorithms for Directed and Node-weighted Multiway Cut
Chandra Chekuri, Vivek Madan
|
👻
Ghosted
|
cs.DS
|
11 |
11 years ago |
| 454 |
Algorithmic and Hardness Results for the Hub Labeling Problem
Haris Angelidakis, Yury Makarychev, Vsevolod Oparin
|
👻
Ghosted
|
cs.DS
|
11 |
9 years ago |
| 455 |
A Framework for the Secretary Problem on the Intersection of Matroids
Moran Feldman, Ola Svensson, Rico Zenklusen
|
👻
Ghosted
|
cs.DS
|
11 |
9 years ago |
| 456 |
Boolean function analysis meets stochastic optimization: An approximation scheme for stochastic knapsack
Anindya De
|
👻
Ghosted
|
cs.DS
|
11 |
8 years ago |
| 457 |
Perron-Frobenius Theory in Nearly Linear Time: Positive Eigenvectors, M-matrices, Graph Kernels, and Other Applications
AmirMahdi Ahmadinejad, Arun Jambulapati, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
11 |
7 years ago |
| 458 |
Testing Halfspaces over Rotation-Invariant Distributions
Nathaniel Harms
|
👻
Ghosted
|
cs.DS
|
11 |
7 years ago |
| 459 |
Exponential Separations in Local Differential Privacy
Matthew Joseph, Jieming Mao, Aaron Roth
|
👻
Ghosted
|
cs.LG
|
11 |
7 years ago |
| 460 |
Towards PTAS for Precedence Constrained Scheduling via Combinatorial Algorithms
Shi Li
|
👻
Ghosted
|
cs.DS
|
11 |
6 years ago |
| 461 |
Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints
Janardhan Kulkarni, Shi Li, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
11 |
6 years ago |
| 462 |
A Local Search Framework for Experimental Design
Lap Chi Lau, Hong Zhou
|
👻
Ghosted
|
cs.DS
|
11 |
5 years ago |
| 463 |
Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection
Shang-En Huang, Seth Pettie, Leqi Zhu
|
👻
Ghosted
|
cs.DC
|
11 |
4 years ago |
| 464 |
Near-Linear Sample Complexity for $L_p$ Polynomial Regression
Raphael A. Meyer, Cameron Musco, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
11 |
3 years ago |
| 465 |
VC Set Systems in Minor-free (Di)Graphs and Applications
Hung Le, Christian Wulff-Nilsen
|
👻
Ghosted
|
cs.DS
|
11 |
3 years ago |
| 466 |
Optimality of Glauber dynamics for general-purpose Ising model sampling and free energy approximation
Dmitriy Kunisky
|
👻
Ghosted
|
cs.DS
|
11 |
3 years ago |
| 467 |
Optimal Bounds on Private Graph Approximation
Jingcheng Liu, Jalaj Upadhyay, Zongrui Zou
|
👻
Ghosted
|
cs.DS
|
11 |
2 years ago |
| 468 |
Code Sparsification and its Applications
Sanjeev Khanna, Aaron L Putterman, Madhu Sudan
|
👻
Ghosted
|
cs.DS
|
11 |
2 years ago |
| 469 |
Fast and Simple Sorting Using Partial Information
Bernhard Haeupler, Richard Hladík, ... (+4 more)
|
👻
Ghosted
|
cs.DS
|
11 |
2 years ago |
| 470 |
Approximation of non-boolean 2CSP
Guy Kindler, Alexandra Kolla, Luca Trevisan
|
👻
Ghosted
|
cs.DS
|
10 |
11 years ago |
| 471 |
Faster Sublinear Algorithms using Conditional Sampling
Themistoklis Gouleakis, Christos Tzamos, Manolis Zampetakis
|
👻
Ghosted
|
cs.DS
|
10 |
10 years ago |
| 472 |
Exact Computation of a Manifold Metric, via Lipschitz Embeddings and Shortest Paths on a Graph
Timothy Chu, Gary Miller, Donald Sheehy
|
👻
Ghosted
|
cs.CG
|
10 |
8 years ago |
| 473 |
Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter
Krishnendu Chatterjee, Wolfgang Dvořák, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
10 |
8 years ago |
| 474 |
Instance-Optimality in the Noisy Value-and Comparison-Model --- Accept, Accept, Strong Accept: Which Papers get in?
Vincent Cohen-Addad, Frederik Mallmann-Trenn, Claire Mathieu
|
👻
Ghosted
|
cs.DS
|
10 |
8 years ago |
| 475 |
Optimal Ball Recycling
Michael A. Bender, Jake Christensen, ... (+4 more)
|
👻
Ghosted
|
cs.DS
|
10 |
8 years ago |
| 476 |
Lower bounds for text indexing with mismatches and differences
Vincent Cohen-Addad, Laurent Feuilloley, Tatiana Starikovskaya
|
👻
Ghosted
|
cs.DS
|
10 |
7 years ago |
| 477 |
Algorithms for weighted independent transversals and strong colouring
Alessandra Graf, David G. Harris, Penny Haxell
|
👻
Ghosted
|
cs.DS
|
10 |
7 years ago |
| 478 |
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
|
👻
Ghosted
|
cs.DS
|
10 |
7 years ago |
| 479 |
Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol
Xiaohui Bei, Xiaoming Sun, ... (+4 more)
|
👻
Ghosted
|
cs.DS
|
10 |
7 years ago |
| 480 |
Improved Local Computation Algorithm for Set Cover via Sparsification
Christoph Grunau, Slobodan Mitrović, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
10 |
6 years ago |
| 481 |
Approximate Distance Oracles Subject to Multiple Vertex Failures
Ran Duan, Yong Gu, Hanlin Ren
|
👻
Ghosted
|
cs.DS
|
10 |
6 years ago |
| 482 |
Tightening Curves on Surfaces Monotonically with Applications
Hsien-Chih Chang, Arnaud de Mesmay
|
👻
Ghosted
|
math.GT
|
10 |
6 years ago |
| 483 |
On Distribution Testing in the Conditional Sampling Model
Shyam Narayanan
|
👻
Ghosted
|
cs.DS
|
10 |
6 years ago |
| 484 |
Tight Distributed Sketching Lower Bound for Connectivity
Huacheng Yu
|
👻
Ghosted
|
cs.DS
|
10 |
6 years ago |
| 485 |
On Two-Handed Planar Assembly Partitioning with Connectivity Constraints
Pankaj K. Agarwal, Boris Aronov, ... (+2 more)
|
👻
Ghosted
|
cs.CG
|
10 |
5 years ago |
| 486 |
EPTAS for $k$-means Clustering of Affine Subspaces
Eduard Eiben, Fedor V. Fomin, ... (+4 more)
|
👻
Ghosted
|
cs.DS
|
10 |
5 years ago |
| 487 |
Kernelization for Graph Packing Problems via Rainbow Matching
Stéphane Bessy, Marin Bougeret, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
10 |
4 years ago |
| 488 |
Almost Tight Bounds for Online Facility Location in the Random-Order Model
Haim Kaplan, David Naori, Danny Raz
|
👻
Ghosted
|
cs.DS
|
10 |
4 years ago |
| 489 |
Steiner Connectivity Augmentation and Splitting-off in Poly-logarithmic Maximum Flows
Ruoxu Cen, William He, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
10 |
3 years ago |
| 490 |
Higher degree sum-of-squares relaxations robust against oblivious outliers
Tommaso d'Orsi, Rajai Nasser, ... (+2 more)
|
👻
Ghosted
|
cs.LG
|
10 |
3 years ago |
| 491 |
Improved Approximations for Unrelated Machine Scheduling
Sungjin Im, Shi Li
|
👻
Ghosted
|
cs.DS
|
10 |
3 years ago |
| 492 |
Testing Convex Truncation
Anindya De, Shivam Nadimpalli, Rocco A. Servedio
|
👻
Ghosted
|
cs.DS
|
10 |
3 years ago |
| 493 |
Linear-Sized Sparsifiers via Near-Linear Time Discrepancy Theory
Arun Jambulapati, Victor Reis, Kevin Tian
|
👻
Ghosted
|
cs.DS
|
10 |
3 years ago |
| 494 |
Almost Tight Bounds for Differentially Private Densest Subgraph
Michael Dinitz, Satyen Kale, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
10 |
3 years ago |
| 495 |
2-Approximation for Prize-Collecting Steiner Forest
Ali Ahmadi, Iman Gholami, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
10 |
3 years ago |
| 496 |
Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization
Daniel Gibney, Ce Jin, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
10 |
2 years ago |
| 497 |
The Complexity of All-switches Strategy Improvement
John Fearnley, Rahul Savani
|
👻
Ghosted
|
cs.DS
|
9 |
11 years ago |
| 498 |
In-Place Sparse Suffix Sorting
Nicola Prezza
|
👻
Ghosted
|
cs.DS
|
9 |
10 years ago |
| 499 |
Derandomized concentration bounds for polynomials, and hypergraph maximal independent set
David G. Harris
|
👻
Ghosted
|
cs.DS
|
9 |
10 years ago |
| 500 |
Short Cycles via Low-Diameter Decompositions
Yang P. Liu, Sushant Sachdeva, Zejun Yu
|
👻
Ghosted
|
cs.DS
|
9 |
7 years ago |