| 251 |
Near-Optimal Deterministic Vertex-Failure Connectivity Oracles
Yaowei Long, Thatchaphol Saranurak
|
👻
Ghosted
|
cs.DS
|
23 |
4 years ago |
| 252 |
Cut-Equivalent Trees are Optimal for Min-Cut Queries
Amir Abboud, Robert Krauthgamer, Ohad Trabelsi
|
👻
Ghosted
|
cs.DS
|
22 |
5 years ago |
| 253 |
Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications
Václav Rozhoň, Michael Elkin, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
22 |
4 years ago |
| 254 |
Binary Iterative Hard Thresholding Converges with Optimal Number of Measurements for 1-Bit Compressed Sensing
Namiko Matsumoto, Arya Mazumdar
|
👻
Ghosted
|
cs.IT
|
22 |
4 years ago |
| 255 |
Near-Optimal Algorithms for Omniprediction
Princewill Okoroafor, Robert Kleinberg, Michael P. Kim
|
👻
Ghosted
|
stat.ML
|
22 |
1 year ago |
| 256 |
The minimal canonical form of a tensor network
Arturo Acuaviva, Visu Makam, ... (+5 more)
|
👻
Ghosted
|
quant-ph
|
21 |
3 years ago |
| 257 |
Tensor cumulants for statistical inference on invariant distributions
Dmitriy Kunisky, Cristopher Moore, Alexander S. Wein
|
👻
Ghosted
|
math.ST
|
21 |
2 years ago |
| 258 |
Testing hereditary properties of ordered graphs and matrices
Noga Alon, Omri Ben-Eliezer, Eldar Fischer
|
👻
Ghosted
|
cs.DS
|
20 |
9 years ago |
| 259 |
Weighted k-Server Bounds via Combinatorial Dichotomies
Nikhil Bansal, Marek Elias, Grigorios Koumoutsos
|
👻
Ghosted
|
cs.DS
|
20 |
9 years ago |
| 260 |
Constant Factor Approximation Algorithm for Weighted Flow Time on a Single Machine in Pseudo-polynomial time
Jatin Batra, Naveen Garg, Amit Kumar
|
👻
Ghosted
|
cs.DS
|
20 |
8 years ago |
| 261 |
Waring Rank, Parameterized and Exact Algorithms
Kevin Pratt
|
👻
Ghosted
|
cs.DS
|
20 |
8 years ago |
| 262 |
Smoothed Analysis in Unsupervised Learning via Decoupling
Aditya Bhaskara, Aidao Chen, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
20 |
7 years ago |
| 263 |
Robust and Sample Optimal Algorithms for PSD Low-Rank Approximation
Ainesh Bakshi, Nadiia Chepurko, David P. Woodruff
|
👻
Ghosted
|
cs.DS
|
20 |
6 years ago |
| 264 |
Isotropy and Log-Concave Polynomials: Accelerated Sampling and High-Precision Counting of Matroid Bases
Nima Anari, Michał Dereziński
|
👻
Ghosted
|
cs.DS
|
20 |
6 years ago |
| 265 |
Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers
Daniel Dadush, Bento Natura, László A. Végh
|
👻
Ghosted
|
math.OC
|
20 |
5 years ago |
| 266 |
Nearly Optimal Communication and Query Complexity of Bipartite Matching
Joakim Blikstad, Jan van den Brand, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
20 |
3 years ago |
| 267 |
Strong spatial mixing for colorings on trees and its algorithmic applications
Zongchen Chen, Kuikui Liu, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
20 |
3 years ago |
| 268 |
Parameterized Approximation Schemes for Clustering with General Norm Objectives
Fateme Abbasi, Sandip Banerjee, ... (+7 more)
|
👻
Ghosted
|
cs.DS
|
20 |
3 years ago |
| 269 |
Optimal PAC Bounds Without Uniform Convergence
Ishaq Aden-Ali, Yeshwanth Cherapanamjeri, ... (+2 more)
|
👻
Ghosted
|
cs.LG
|
20 |
3 years ago |
| 270 |
Fully-Dynamic Submodular Cover with Bounded Recourse
Anupam Gupta, Roie Levin
|
👻
Ghosted
|
cs.DS
|
19 |
5 years ago |
| 271 |
List-decodability with large radius for Reed-Solomon codes
Asaf Ferber, Matthew Kwan, Lisa Sauermann
|
👻
Ghosted
|
cs.IT
|
19 |
5 years ago |
| 272 |
PPSZ is better than you think
Dominik Scheder
|
👻
Ghosted
|
cs.DS
|
19 |
4 years ago |
| 273 |
ReSQueing Parallel and Private Stochastic Convex Optimization
Yair Carmon, Arun Jambulapati, ... (+5 more)
|
👻
Ghosted
|
math.OC
|
19 |
3 years ago |
| 274 |
Efficient unitary designs and pseudorandom unitaries from permutations
Chi-Fang Chen, Adam Bouland, ... (+4 more)
|
👻
Ghosted
|
quant-ph
|
19 |
2 years ago |
| 275 |
Approximating ATSP by Relaxing Connectivity
Ola Svensson
|
👻
Ghosted
|
cs.DS
|
18 |
11 years ago |
| 276 |
Faster Minimum k-cut of a Simple Graph
Jason Li
|
👻
Ghosted
|
cs.DS
|
18 |
6 years ago |
| 277 |
Scheduling with Communication Delays via LP Hierarchies and Clustering
Sami Davies, Janardhan Kulkarni, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
18 |
6 years ago |
| 278 |
Sublinear-Time Algorithms for Computing & Embedding Gap Edit Distance
Tomasz Kociumaka, Barna Saha
|
👻
Ghosted
|
cs.DS
|
18 |
6 years ago |
| 279 |
Low Treewidth Embeddings of Planar and Minor-Free Metrics
Arnold Filtser, Hung Le
|
👻
Ghosted
|
cs.DS
|
18 |
4 years ago |
| 280 |
Streaming Facility Location in High Dimension via Geometric Hashing
Artur Czumaj, Arnold Filtser, ... (+4 more)
|
👻
Ghosted
|
cs.DS
|
18 |
4 years ago |
| 281 |
Optimal Sublinear Sampling of Spanning Trees and Determinantal Point Processes via Average-Case Entropic Independence
Nima Anari, Yang P. Liu, Thuy-Duong Vuong
|
👻
Ghosted
|
cs.DS
|
18 |
4 years ago |
| 282 |
Fast Multivariate Multipoint Evaluation Over All Finite Fields
Vishwas Bhargava, Sumanta Ghosh, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
18 |
4 years ago |
| 283 |
Local Computation of Maximal Independent Set
Mohsen Ghaffari
|
👻
Ghosted
|
cs.DS
|
18 |
3 years ago |
| 284 |
Sparsifying sums of norms
Arun Jambulapati, James R. Lee, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
18 |
3 years ago |
| 285 |
Better Unrelated Machine Scheduling for Weighted Completion Time via Random Offsets from Non-Uniform Distributions
Sungjin Im, Shi Li
|
👻
Ghosted
|
cs.DS
|
17 |
10 years ago |
| 286 |
Polylogarithmic approximation for minimum planarization (almost)
Ken-ichi Kawarabayashi, Anastasios Sidiropoulos
|
👻
Ghosted
|
cs.DS
|
17 |
8 years ago |
| 287 |
A Tight Analysis of Bethe Approximation for Permanent
Nima Anari, Alireza Rezaei
|
👻
Ghosted
|
cs.DS
|
17 |
7 years ago |
| 288 |
Network Coding Gaps for Completion Times of Multiple Unicasts
Bernhard Haeupler, David Wajc, Goran Zuzic
|
👻
Ghosted
|
cs.DS
|
17 |
7 years ago |
| 289 |
High-Dimensional Geometric Streaming in Polynomial Space
David P. Woodruff, Taisuke Yasuda
|
👻
Ghosted
|
cs.DS
|
17 |
4 years ago |
| 290 |
Streaming Euclidean $k$-median and $k$-means with $o(\log n)$ Space
Vincent Cohen-Addad, David P. Woodruff, Samson Zhou
|
👻
Ghosted
|
cs.DS
|
17 |
2 years ago |
| 291 |
An Optimized Hybrid Approach for Path Finding
Ahlam Ansari, Mohd Amin Sayyed, ... (+2 more)
|
👻
Ghosted
|
cs.AI
|
16 |
11 years ago |
| 292 |
Tight Bounds on Low-degree Spectral Concentration of Submodular and XOS functions
Vitaly Feldman, Jan Vondrak
|
👻
Ghosted
|
cs.DS
|
16 |
11 years ago |
| 293 |
On preparing ground states of gapped Hamiltonians: An efficient Quantum Lovász Local Lemma
András Gilyén, Or Sattath
|
👻
Ghosted
|
quant-ph
|
16 |
9 years ago |
| 294 |
Hypergraph $k$-cut for fixed $k$ in deterministic polynomial time
Karthekeyan Chandrasekaran, Chandra Chekuri
|
👻
Ghosted
|
cs.DS
|
16 |
5 years ago |
| 295 |
Minimax Rates for Robust Community Detection
Allen Liu, Ankur Moitra
|
👻
Ghosted
|
cs.DS
|
16 |
4 years ago |
| 296 |
Query lower bounds for log-concave sampling
Sinho Chewi, Jaume de Dios Pont, ... (+3 more)
|
👻
Ghosted
|
math.ST
|
16 |
3 years ago |
| 297 |
Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality
Jan van den Brand, Li Chen, ... (+5 more)
|
👻
Ghosted
|
cs.DS
|
16 |
2 years ago |
| 298 |
Testing Positive Semi-Definiteness via Random Submatrices
Ainesh Bakshi, Nadiia Chepurko, Rajesh Jayaram
|
👻
Ghosted
|
cs.DS
|
15 |
6 years ago |
| 299 |
Approximation Algorithms for Stochastic Minimum Norm Combinatorial Optimization
Sharat Ibrahimpur, Chaitanya Swamy
|
👻
Ghosted
|
cs.DS
|
15 |
5 years ago |
| 300 |
Towards derandomising Markov chain Monte Carlo
Weiming Feng, Heng Guo, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
15 |
3 years ago |