| 201 |
New Hardness Results for Routing on Disjoint Paths
Julia Chuzhoy, David H. K. Kim, Rachit Nimavat
|
👻
Ghosted
|
cs.DS
|
37 |
9 years ago |
| 202 |
Testing Cluster Structure of Graphs
Artur Czumaj, Pan Peng, Christian Sohler
|
👻
Ghosted
|
cs.DS
|
37 |
11 years ago |
| 203 |
Approximating Nash Social Welfare under Rado Valuations
Jugal Garg, Edin Husic, Laszlo A. Vegh
|
👻
Ghosted
|
cs.GT
|
36 |
5 years ago |
| 204 |
Planar Diameter via Metric Compression
Jason Li, Merav Parter
|
👻
Ghosted
|
cs.DS
|
36 |
6 years ago |
| 205 |
Online Vector Balancing and Geometric Discrepancy
Nikhil Bansal, Haotian Jiang, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
36 |
6 years ago |
| 206 |
Polynomial Pass Lower Bounds for Graph Streaming Algorithms
Sepehr Assadi, Yu Chen, Sanjeev Khanna
|
👻
Ghosted
|
cs.DS
|
36 |
7 years ago |
| 207 |
A Strongly Polynomial Algorithm for Linear Exchange Markets
Jugal Garg, László A. Végh
|
👻
Ghosted
|
cs.DS
|
36 |
7 years ago |
| 208 |
Constant-Factor Approximation for Ordered k-Median
Jarosław Byrka, Krzysztof Sornat, Joachim Spoerhase
|
👻
Ghosted
|
cs.DS
|
36 |
8 years ago |
| 209 |
On Approximating Functions of the Singular Values in a Stream
Yi Li, David P. Woodruff
|
👻
Ghosted
|
cs.DS
|
36 |
10 years ago |
| 210 |
The Fourier Transform of Poisson Multinomial Distributions and its Algorithmic Applications
Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart
|
👻
Ghosted
|
cs.DS
|
36 |
10 years ago |
| 211 |
Flows in Almost Linear Time via Adaptive Preconditioning
Rasmus Kyng, Richard Peng, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
35 |
6 years ago |
| 212 |
Nonlinear Dimension Reduction via Outer Bi-Lipschitz Extensions
Sepideh Mahabadi, Konstantin Makarychev, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
35 |
7 years ago |
| 213 |
Streaming Symmetric Norms via Measure Concentration
Jaroslaw Blasiok, Vladimir Braverman, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
35 |
10 years ago |
| 214 |
Faster Min-Plus Product for Monotone Instances
Shucheng Chi, Ran Duan, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
35 |
4 years ago |
| 215 |
First-Order Model Checking on Structurally Sparse Graph Classes
Jan Dreier, Nikolas Mählmann, Sebastian Siebertz
|
🔮
The Ethereal
|
cs.LO
|
34 |
3 years ago |
| 216 |
Efficient Two-Sided Markets with Limited Information
Paul Dütting, Federico Fusco, ... (+3 more)
|
👻
Ghosted
|
cs.GT
|
34 |
6 years ago |
| 217 |
Fine-grained reductions from approximate counting to decision
Holger Dell, John Lapinskas
|
👻
Ghosted
|
cs.DS
|
34 |
8 years ago |
| 218 |
An Improved Parameterized Algorithm for Treewidth
Tuukka Korhonen, Daniel Lokshtanov
|
👻
Ghosted
|
cs.DS
|
34 |
3 years ago |
| 219 |
Almost Optimal Distance Oracles for Planar Graphs
Panagiotis Charalampopoulos, Paweł Gawrychowski, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
33 |
7 years ago |
| 220 |
An exponential lower bound for Individualization-Refinement algorithms for Graph Isomorphism
Daniel Neuen, Pascal Schweitzer
|
🔮
The Ethereal
|
cs.CC
|
33 |
9 years ago |
| 221 |
The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation
Pierre-Étienne Meunier, Damien Woods
|
🔮
The Ethereal
|
cs.CC
|
33 |
9 years ago |
| 222 |
Asymptotically Good Quantum Codes with Transversal Non-Clifford Gates
Louis Golowich, Venkatesan Guruswami
|
👻
Ghosted
|
quant-ph
|
32 |
1 year ago |
| 223 |
On the Lovász Theta function for Independent Sets in Sparse Graphs
Nikhil Bansal, Anupam Gupta, Guru Guruganesh
|
👻
Ghosted
|
cs.DS
|
32 |
11 years ago |
| 224 |
Byzantine Agreement with Optimal Early Stopping, Optimal Resilience and Polynomial Complexity
Ittai Abraham, Danny Dolev
|
👻
Ghosted
|
cs.DC
|
32 |
11 years ago |
| 225 |
Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics
Amir Abboud, Karl Bringmann, Nick Fischer
|
👻
Ghosted
|
cs.DS
|
32 |
3 years ago |
| 226 |
Hardness of Approximation in P via Short Cycle Removal: Cycle Detection, Distance Oracles, and Beyond
Amir Abboud, Karl Bringmann, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
32 |
4 years ago |
| 227 |
Stronger Calibration Lower Bounds via Sidestepping
Mingda Qiao, Gregory Valiant
|
👻
Ghosted
|
cs.LG
|
31 |
5 years ago |
| 228 |
Algorithmic Foundations for the Diffraction Limit
Sitan Chen, Ankur Moitra
|
👻
Ghosted
|
cs.DS
|
31 |
6 years ago |
| 229 |
A Weighted Linear Matroid Parity Algorithm
Satoru Iwata, Yusuke Kobayashi
|
👻
Ghosted
|
cs.DS
|
31 |
6 years ago |
| 230 |
Towards the Locality of Vizing's Theorem
Hsin-Hao Su, Hoa T. Vu
|
👻
Ghosted
|
cs.DS
|
31 |
7 years ago |
| 231 |
Diff-DAC: Distributed Actor-Critic for Average Multitask Deep Reinforcement Learning
Sergio Valcarcel Macua, Aleksi Tukiainen, ... (+4 more)
|
👻
Ghosted
|
cs.LG
|
31 |
8 years ago |
| 232 |
A Converse to Banach's Fixed Point Theorem and its CLS Completeness
Constantinos Daskalakis, Christos Tzamos, Manolis Zampetakis
|
🔮
The Ethereal
|
cs.CC
|
31 |
9 years ago |
| 233 |
Removing Additive Structure in 3SUM-Based Reductions
Ce Jin, Yinzhan Xu
|
👻
Ghosted
|
cs.DS
|
31 |
3 years ago |
| 234 |
Faster Deterministic Distributed MIS and Approximate Matching
Mohsen Ghaffari, Christoph Grunau
|
👻
Ghosted
|
cs.DS
|
30 |
3 years ago |
| 235 |
Sample-efficient proper PAC learning with approximate differential privacy
Badih Ghazi, Noah Golowich, ... (+2 more)
|
👻
Ghosted
|
cs.LG
|
30 |
5 years ago |
| 236 |
Strong Self-Concordance and Sampling
Aditi Laddha, Yin Tat Lee, Santosh Vempala
|
👻
Ghosted
|
cs.DS
|
30 |
6 years ago |
| 237 |
Efficient sampling and counting algorithms for the Potts model on $\mathbb Z^d$ at all temperatures
Christian Borgs, Jennifer Chayes, ... (+3 more)
|
👻
Ghosted
|
math.PR
|
30 |
6 years ago |
| 238 |
Learning Restricted Boltzmann Machines via Influence Maximization
Guy Bresler, Frederic Koehler, ... (+2 more)
|
👻
Ghosted
|
cs.LG
|
30 |
8 years ago |
| 239 |
Tight Cell Probe Bounds for Succinct Boolean Matrix-Vector Multiplication
Diptarka Chakraborty, Lior Kamma, Kasper Green Larsen
|
👻
Ghosted
|
cs.DS
|
30 |
8 years ago |
| 240 |
Prediction with a Short Memory
Vatsal Sharan, Sham Kakade, ... (+2 more)
|
👻
Ghosted
|
cs.LG
|
30 |
9 years ago |
| 241 |
Sampling Constraint Satisfaction Solutions in the Local Lemma Regime
Weiming Feng, Kun He, Yitong Yin
|
👻
Ghosted
|
cs.DS
|
29 |
5 years ago |
| 242 |
Efficient Profile Maximum Likelihood for Universal Symmetric Property Estimation
Moses Charikar, Kirankumar Shiragur, Aaron Sidford
|
👻
Ghosted
|
cs.DS
|
29 |
7 years ago |
| 243 |
Extensor-Coding
Cornelius Brand, Holger Dell, Thore Husfeldt
|
👻
Ghosted
|
cs.DS
|
29 |
8 years ago |
| 244 |
Improved Approximation for Node-Disjoint Paths in Planar Graphs
Julia Chuzhoy, David H. K. Kim, Shi Li
|
👻
Ghosted
|
cs.DS
|
29 |
10 years ago |
| 245 |
Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, $s$-$t$ Shortest Path, and Minimum-Cost Flow
Li Chen, Rasmus Kyng, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
28 |
2 years ago |
| 246 |
Constrained Submodular Maximization via New Bounds for DR-Submodular Functions
Niv Buchbinder, Moran Feldman
|
👻
Ghosted
|
cs.DS
|
28 |
2 years ago |
| 247 |
Stochastic Matching with Few Queries: $(1-\varepsilon)$ Approximation
Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi
|
👻
Ghosted
|
cs.DS
|
28 |
6 years ago |
| 248 |
Hitting Topological Minors is FPT
Fedor V. Fomin, Daniel Lokshtanov, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
28 |
7 years ago |
| 249 |
A Simply Exponential Upper Bound on the Maximum Number of Stable Matchings
Anna R. Karlin, Shayan Oveis Gharan, Robbie Weber
|
🔮
The Ethereal
|
cs.DM
|
28 |
8 years ago |
| 250 |
Finding Even Cycles Faster via Capped k-Walks
Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Morten Stöckel
|
👻
Ghosted
|
cs.DS
|
28 |
9 years ago |