| 201 |
Quantum eigenvalue processing
Guang Hao Low, Yuan Su
|
👻
Ghosted
|
quant-ph
|
34 |
2 years ago |
| 202 |
Optimizing Star-Convex Functions
Jasper C. H. Lee, Paul Valiant
|
👻
Ghosted
|
cs.DS
|
33 |
10 years ago |
| 203 |
Fast Similarity Sketching
Søren Dahlgaard, Mathias Bæk Tejs Langhede, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
33 |
9 years ago |
| 204 |
Determinant-Preserving Sparsification of SDDM Matrices with Applications to Counting and Sampling Spanning Trees
David Durfee, John Peebles, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
33 |
9 years ago |
| 205 |
A Faster Isomorphism Test for Graphs of Small Degree
Martin Grohe, Daniel Neuen, Pascal Schweitzer
|
👻
Ghosted
|
cs.DS
|
33 |
8 years ago |
| 206 |
Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms
Sepehr Assadi, Ran Raz
|
👻
Ghosted
|
cs.DS
|
33 |
5 years ago |
| 207 |
Small Covers for Near-Zero Sets of Polynomials and Learning Latent Variable Models
Ilias Diakonikolas, Daniel M. Kane
|
👻
Ghosted
|
cs.LG
|
33 |
5 years ago |
| 208 |
New Unconditional Hardness Results for Dynamic and Online Problems
Raphael Clifford, Allan Grønlund, Kasper Green Larsen
|
👻
Ghosted
|
cs.DS
|
32 |
11 years ago |
| 209 |
A Matrix Chernoff Bound for Strongly Rayleigh Distributions and Spectral Sparsifiers from a few Random Spanning Trees
Rasmus Kyng, Zhao Song
|
👻
Ghosted
|
math.PR
|
32 |
7 years ago |
| 210 |
Reed-Muller codes polarize
Emmanuel Abbe, Min Ye
|
👻
Ghosted
|
cs.IT
|
32 |
7 years ago |
| 211 |
Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time
Mahdi Cheraghchi, Vasileios Nakos
|
👻
Ghosted
|
cs.IT
|
32 |
6 years ago |
| 212 |
Algorithms and Hardness for Linear Algebra on Geometric Graphs
Josh Alman, Timothy Chu, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
32 |
5 years ago |
| 213 |
Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space
Dominik Kempa, Tomasz Kociumaka
|
👻
Ghosted
|
cs.DS
|
32 |
2 years ago |
| 214 |
Commutativity in the Algorithmic Lovasz Local Lemma
Vladimir Kolmogorov
|
👻
Ghosted
|
cs.DS
|
31 |
11 years ago |
| 215 |
Efficient Truncated Statistics with Unknown Truncation
Vasilis Kontonis, Christos Tzamos, Manolis Zampetakis
|
👻
Ghosted
|
math.ST
|
31 |
6 years ago |
| 216 |
List Decodable Mean Estimation in Nearly Linear Time
Yeshwanth Cherapanamjeri, Sidhanth Mohanty, Morris Yau
|
👻
Ghosted
|
cs.DS
|
31 |
6 years ago |
| 217 |
Optimal mixing for two-state anti-ferromagnetic spin systems
Xiaoyu Chen, Weiming Feng, ... (+2 more)
|
👻
Ghosted
|
math-ph
|
31 |
4 years ago |
| 218 |
A Parameterized Approximation Scheme for Min $k$-Cut
Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan
|
👻
Ghosted
|
cs.DS
|
30 |
6 years ago |
| 219 |
Order Selection Prophet Inequality: From Threshold Optimization to Arrival Time Design
Bo Peng, Zhihao Gavin Tang
|
👻
Ghosted
|
cs.DS
|
30 |
4 years ago |
| 220 |
Optimal tradeoffs for estimating Pauli observables
Sitan Chen, Weiyuan Gong, Qi Ye
|
👻
Ghosted
|
quant-ph
|
30 |
2 years ago |
| 221 |
Covering Planar Metrics (and Beyond): O(1) Trees Suffice
Hsien-Chih Chang, Jonathan Conroy, ... (+4 more)
|
👻
Ghosted
|
cs.DS
|
29 |
3 years ago |
| 222 |
On the Structure, Covering, and Learning of Poisson Multinomial Distributions
Constantinos Daskalakis, Gautam Kamath, Christos Tzamos
|
👻
Ghosted
|
cs.DS
|
28 |
11 years ago |
| 223 |
Robust polynomial regression up to the information theoretic limit
Daniel Kane, Sushrut Karmalkar, Eric Price
|
👻
Ghosted
|
cs.DS
|
28 |
8 years ago |
| 224 |
The Sketching Complexity of Graph and Hypergraph Counting
John Kallaugher, Michael Kapralov, Eric Price
|
👻
Ghosted
|
cs.DS
|
28 |
7 years ago |
| 225 |
Near-Optimal Decremental SSSP in Dense Weighted Digraphs
Aaron Bernstein, Maximilian Probst Gutenberg, Christian Wulff-Nilsen
|
👻
Ghosted
|
cs.DS
|
28 |
6 years ago |
| 226 |
Collaborative Top Distribution Identifications with Limited Interaction
Nikolai Karpov, Qin Zhang, Yuan Zhou
|
👻
Ghosted
|
cs.DS
|
28 |
6 years ago |
| 227 |
Structure learning of Hamiltonians from real-time evolution
Ainesh Bakshi, Allen Liu, ... (+2 more)
|
👻
Ghosted
|
quant-ph
|
28 |
2 years ago |
| 228 |
Theoretical limitations of multi-layer Transformer
Lijie Chen, Binghui Peng, Hongxun Wu
|
👻
Ghosted
|
cs.LG
|
28 |
1 year ago |
| 229 |
Testing Graph Clusterability: Algorithms and Lower Bounds
Ashish Chiplunkar, Michael Kapralov, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
27 |
7 years ago |
| 230 |
Spectral Subspace Sparsification
Huan Li, Aaron Schild
|
👻
Ghosted
|
cs.DS
|
27 |
7 years ago |
| 231 |
How to Use Heuristics for Differential Privacy
Seth Neel, Aaron Roth, Zhiwei Steven Wu
|
👻
Ghosted
|
cs.LG
|
27 |
7 years ago |
| 232 |
Beyond Tree Embeddings -- a Deterministic Framework for Network Design with Deadlines or Delay
Yossi Azar, Noam Touitou
|
👻
Ghosted
|
cs.DS
|
27 |
6 years ago |
| 233 |
Sparse PCA: Algorithms, Adversarial Perturbations and Certificates
Tommaso d'Orsi, Pravesh K. Kothari, ... (+2 more)
|
👻
Ghosted
|
cs.LG
|
27 |
5 years ago |
| 234 |
Efficient and Near-Optimal Noise Generation for Streaming Differential Privacy
Krishnamurthy Dvijotham, H. Brendan McMahan, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
27 |
2 years ago |
| 235 |
Local List Recovery of High-rate Tensor Codes and Applications
Brett Hemenway, Noga Ron-Zewi, Mary Wootters
|
👻
Ghosted
|
cs.IT
|
26 |
9 years ago |
| 236 |
A New Deterministic Algorithm for Dynamic Set Cover
Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai
|
👻
Ghosted
|
cs.DS
|
26 |
6 years ago |
| 237 |
Towards the sampling Lovász Local Lemma
Vishesh Jain, Huy Tuan Pham, Thuy Duong Vuong
|
👻
Ghosted
|
cs.DS
|
26 |
5 years ago |
| 238 |
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 |
| 239 |
Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS
Mohsen Ghaffari, Christoph Grunau
|
👻
Ghosted
|
cs.DS
|
26 |
1 year ago |
| 240 |
Memory Bounds for Continual Learning
Xi Chen, Christos Papadimitriou, Binghui Peng
|
👻
Ghosted
|
cs.LG
|
25 |
4 years ago |
| 241 |
Minor Containment and Disjoint Paths in almost-linear time
Tuukka Korhonen, Michał Pilipczuk, Giannos Stamoulis
|
👻
Ghosted
|
cs.DS
|
25 |
2 years ago |
| 242 |
Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Time
Chandra Chekuri, Kent Quanrud
|
👻
Ghosted
|
cs.DS
|
24 |
9 years ago |
| 243 |
Approximating the Permanent of a Random Matrix with Vanishing Mean
Lior Eldar, Saeed Mehraban
|
👻
Ghosted
|
cs.DS
|
24 |
8 years ago |
| 244 |
An ETH-Tight Exact Algorithm for Euclidean TSP
Mark de Berg, Hans L. Bodlaender, ... (+2 more)
|
👻
Ghosted
|
cs.CG
|
24 |
8 years ago |
| 245 |
(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 |
| 246 |
Minor Sparsifiers and the Distributed Laplacian Paradigm
Sebastian Forster, Gramoz Goranci, ... (+4 more)
|
👻
Ghosted
|
cs.DS
|
24 |
5 years ago |
| 247 |
An O(1)-Approximation for Minimum Spanning Tree Interdiction
Rico Zenklusen
|
👻
Ghosted
|
cs.DS
|
23 |
10 years ago |
| 248 |
Online Buy-at-Bulk Network Design
Deeparnab Chakrabarty, Alina Ene, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
23 |
10 years ago |
| 249 |
Optimal Las Vegas Locality Sensitive Data Structures
Thomas Dybdahl Ahle
|
👻
Ghosted
|
cs.DS
|
23 |
9 years ago |
| 250 |
Cut query algorithms with star contraction
Simon Apers, Yuval Efron, ... (+4 more)
|
👻
Ghosted
|
cs.DS
|
23 |
4 years ago |