| 251 |
On the Structure, Covering, and Learning of Poisson Multinomial Distributions
Constantinos Daskalakis, Gautam Kamath, Christos Tzamos
|
👻
Ghosted
|
cs.DS
|
28 |
11 years ago |
| 252 |
Efficient and Near-Optimal Noise Generation for Streaming Differential Privacy
Krishnamurthy Dvijotham, H. Brendan McMahan, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
27 |
2 years ago |
| 253 |
Sparse PCA: Algorithms, Adversarial Perturbations and Certificates
Tommaso d'Orsi, Pravesh K. Kothari, ... (+2 more)
|
👻
Ghosted
|
cs.LG
|
27 |
5 years ago |
| 254 |
Beyond Tree Embeddings -- a Deterministic Framework for Network Design with Deadlines or Delay
Yossi Azar, Noam Touitou
|
👻
Ghosted
|
cs.DS
|
27 |
6 years ago |
| 255 |
Learning sums of powers of low-degree polynomials in the non-degenerate case
Ankit Garg, Neeraj Kayal, Chandan Saha
|
🔮
The Ethereal
|
cs.CC
|
27 |
6 years ago |
| 256 |
How to Use Heuristics for Differential Privacy
Seth Neel, Aaron Roth, Zhiwei Steven Wu
|
👻
Ghosted
|
cs.LG
|
27 |
7 years ago |
| 257 |
Spectral Subspace Sparsification
Huan Li, Aaron Schild
|
👻
Ghosted
|
cs.DS
|
27 |
7 years ago |
| 258 |
Testing Graph Clusterability: Algorithms and Lower Bounds
Ashish Chiplunkar, Michael Kapralov, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
27 |
7 years ago |
| 259 |
Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS
Mohsen Ghaffari, Christoph Grunau
|
👻
Ghosted
|
cs.DS
|
26 |
1 year ago |
| 260 |
Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster!
Karl Bringmann, Alejandro Cassis, Nick Fischer
|
👻
Ghosted
|
cs.DS
|
26 |
3 years ago |
| 261 |
Towards the sampling Lovász Local Lemma
Vishesh Jain, Huy Tuan Pham, Thuy Duong Vuong
|
👻
Ghosted
|
cs.DS
|
26 |
5 years ago |
| 262 |
A New Deterministic Algorithm for Dynamic Set Cover
Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai
|
👻
Ghosted
|
cs.DS
|
26 |
6 years ago |
| 263 |
Local List Recovery of High-rate Tensor Codes and Applications
Brett Hemenway, Noga Ron-Zewi, Mary Wootters
|
👻
Ghosted
|
cs.IT
|
26 |
9 years ago |
| 264 |
Minor Containment and Disjoint Paths in almost-linear time
Tuukka Korhonen, Michał Pilipczuk, Giannos Stamoulis
|
👻
Ghosted
|
cs.DS
|
25 |
2 years ago |
| 265 |
Simply Exponential Approximation of the Permanent of Positive Semidefinite Matrices
Nima Anari, Leonid Gurvits, ... (+2 more)
|
🔮
The Ethereal
|
math.CO
|
25 |
9 years ago |
| 266 |
Memory Bounds for Continual Learning
Xi Chen, Christos Papadimitriou, Binghui Peng
|
👻
Ghosted
|
cs.LG
|
25 |
4 years ago |
| 267 |
Minor Sparsifiers and the Distributed Laplacian Paradigm
Sebastian Forster, Gramoz Goranci, ... (+4 more)
|
👻
Ghosted
|
cs.DS
|
24 |
5 years ago |
| 268 |
(Nearly) Sample-Optimal Sparse Fourier Transform in Any Dimension; RIPless and Filterless
Vasileios Nakos, Zhao Song, Zhengyu Wang
|
👻
Ghosted
|
cs.DS
|
24 |
6 years ago |
| 269 |
An ETH-Tight Exact Algorithm for Euclidean TSP
Mark de Berg, Hans L. Bodlaender, ... (+2 more)
|
👻
Ghosted
|
cs.CG
|
24 |
7 years ago |
| 270 |
Approximating the Permanent of a Random Matrix with Vanishing Mean
Lior Eldar, Saeed Mehraban
|
👻
Ghosted
|
cs.DS
|
24 |
8 years ago |
| 271 |
Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Time
Chandra Chekuri, Kent Quanrud
|
👻
Ghosted
|
cs.DS
|
24 |
9 years ago |
| 272 |
Optimal Las Vegas Locality Sensitive Data Structures
Thomas Dybdahl Ahle
|
👻
Ghosted
|
cs.DS
|
23 |
9 years ago |
| 273 |
Online Buy-at-Bulk Network Design
Deeparnab Chakrabarty, Alina Ene, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
23 |
10 years ago |
| 274 |
An O(1)-Approximation for Minimum Spanning Tree Interdiction
Rico Zenklusen
|
👻
Ghosted
|
cs.DS
|
23 |
10 years ago |
| 275 |
Near-Optimal Deterministic Vertex-Failure Connectivity Oracles
Yaowei Long, Thatchaphol Saranurak
|
👻
Ghosted
|
cs.DS
|
23 |
4 years ago |
| 276 |
Cut query algorithms with star contraction
Simon Apers, Yuval Efron, ... (+4 more)
|
👻
Ghosted
|
cs.DS
|
23 |
4 years ago |
| 277 |
Near-Optimal Algorithms for Omniprediction
Princewill Okoroafor, Robert Kleinberg, Michael P. Kim
|
👻
Ghosted
|
stat.ML
|
22 |
1 year ago |
| 278 |
Cut-Equivalent Trees are Optimal for Min-Cut Queries
Amir Abboud, Robert Krauthgamer, Ohad Trabelsi
|
👻
Ghosted
|
cs.DS
|
22 |
5 years ago |
| 279 |
Junta correlation is testable
Anindya De, Elchanan Mossel, Joe Neeman
|
🔮
The Ethereal
|
cs.CC
|
22 |
7 years ago |
| 280 |
Binary Iterative Hard Thresholding Converges with Optimal Number of Measurements for 1-Bit Compressed Sensing
Namiko Matsumoto, Arya Mazumdar
|
👻
Ghosted
|
cs.IT
|
22 |
3 years ago |
| 281 |
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 |
| 282 |
Tensor cumulants for statistical inference on invariant distributions
Dmitriy Kunisky, Cristopher Moore, Alexander S. Wein
|
👻
Ghosted
|
math.ST
|
21 |
2 years ago |
| 283 |
Hardness Results for Structured Linear Systems
Rasmus Kyng, Peng Zhang
|
🔮
The Ethereal
|
cs.CC
|
21 |
9 years ago |
| 284 |
The minimal canonical form of a tensor network
Arturo Acuaviva, Visu Makam, ... (+5 more)
|
👻
Ghosted
|
quant-ph
|
21 |
3 years ago |
| 285 |
Optimal PAC Bounds Without Uniform Convergence
Ishaq Aden-Ali, Yeshwanth Cherapanamjeri, ... (+2 more)
|
👻
Ghosted
|
cs.LG
|
20 |
3 years ago |
| 286 |
Parameterized Approximation Schemes for Clustering with General Norm Objectives
Fateme Abbasi, Sandip Banerjee, ... (+7 more)
|
👻
Ghosted
|
cs.DS
|
20 |
3 years ago |
| 287 |
Strong spatial mixing for colorings on trees and its algorithmic applications
Zongchen Chen, Kuikui Liu, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
20 |
3 years ago |
| 288 |
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 |
| 289 |
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 |
| 290 |
Robust and Sample Optimal Algorithms for PSD Low-Rank Approximation
Ainesh Bakshi, Nadiia Chepurko, David P. Woodruff
|
👻
Ghosted
|
cs.DS
|
20 |
6 years ago |
| 291 |
Smoothed Analysis in Unsupervised Learning via Decoupling
Aditya Bhaskara, Aidao Chen, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
20 |
7 years ago |
| 292 |
Waring Rank, Parameterized and Exact Algorithms
Kevin Pratt
|
👻
Ghosted
|
cs.DS
|
20 |
7 years ago |
| 293 |
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 |
| 294 |
Weighted k-Server Bounds via Combinatorial Dichotomies
Nikhil Bansal, Marek Elias, Grigorios Koumoutsos
|
👻
Ghosted
|
cs.DS
|
20 |
9 years ago |
| 295 |
Testing hereditary properties of ordered graphs and matrices
Noga Alon, Omri Ben-Eliezer, Eldar Fischer
|
👻
Ghosted
|
cs.DS
|
20 |
9 years ago |
| 296 |
Nearly Optimal Communication and Query Complexity of Bipartite Matching
Joakim Blikstad, Jan van den Brand, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
20 |
3 years ago |
| 297 |
ReSQueing Parallel and Private Stochastic Convex Optimization
Yair Carmon, Arun Jambulapati, ... (+5 more)
|
👻
Ghosted
|
math.OC
|
19 |
3 years ago |
| 298 |
Fully-Dynamic Submodular Cover with Bounded Recourse
Anupam Gupta, Roie Levin
|
👻
Ghosted
|
cs.DS
|
19 |
5 years ago |
| 299 |
List-decodability with large radius for Reed-Solomon codes
Asaf Ferber, Matthew Kwan, Lisa Sauermann
|
👻
Ghosted
|
cs.IT
|
19 |
5 years ago |
| 300 |
Efficient unitary designs and pseudorandom unitaries from permutations
Chi-Fang Chen, Adam Bouland, ... (+4 more)
|
👻
Ghosted
|
quant-ph
|
19 |
2 years ago |