| 301 |
Vertex Sparsification for Edge Connectivity
Parinya Chalermsook, Syamantak Das, ... (+6 more)
|
👻
Ghosted
|
cs.DS
|
23 |
6 years ago |
| 302 |
Robust Learning of Mixtures of Gaussians
Daniel M. Kane
|
👻
Ghosted
|
cs.DS
|
23 |
6 years ago |
| 303 |
Weighted dynamic finger in binary search trees
John Iacono, Stefan Langerman
|
👻
Ghosted
|
cs.DS
|
23 |
7 years ago |
| 304 |
Strategies for Stable Merge Sorting
Sam Buss, Alexander Knop
|
👻
Ghosted
|
cs.DS
|
23 |
8 years ago |
| 305 |
An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles
Pankaj K. Agarwal, Kyle Fox, Oren Salzman
|
👻
Ghosted
|
cs.CG
|
23 |
9 years ago |
| 306 |
Erdős-Pósa property of chordless cycles and its applications
Eun Jung Kim, O-joung Kwon
|
🔮
The Ethereal
|
math.CO
|
23 |
8 years ago |
| 307 |
Steiner Point Removal --- Distant Terminals Don't (Really) Bother
Yun Kuen Cheung
|
👻
Ghosted
|
cs.DS
|
23 |
9 years ago |
| 308 |
Optimization of Bootstrapping in Circuits
Fabrice Benhamouda, Tancrède Lepoint, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
23 |
9 years ago |
| 309 |
Online Lower Bounds via Duality
Yossi Azar, Ilan Reuven Cohen, Alan Roytman
|
👻
Ghosted
|
cs.DS
|
23 |
10 years ago |
| 310 |
Parallel algorithms and concentration bounds for the Lovasz Local Lemma via witness DAGs
Bernhard Haeupler, David G. Harris
|
🔮
The Ethereal
|
cs.DM
|
23 |
10 years ago |
| 311 |
On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
Calum MacRury, Will Ma, Nathaniel Grammel
|
👻
Ghosted
|
cs.DS
|
23 |
3 years ago |
| 312 |
Deterministic Near-Linear Time Minimum Cut in Weighted Graphs
Monika Henzinger, Jason Li, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
22 |
2 years ago |
| 313 |
An Improved Classical Singular Value Transformation for Quantum Machine Learning
Ainesh Bakshi, Ewin Tang
|
👻
Ghosted
|
quant-ph
|
22 |
3 years ago |
| 314 |
Tight Distributed Listing of Cliques
Keren Censor-Hillel, Yi-Jun Chang, ... (+2 more)
|
👻
Ghosted
|
cs.DC
|
22 |
5 years ago |
| 315 |
Competitive Online Search Trees on Trees
Prosenjit Bose, Jean Cardinal, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
22 |
6 years ago |
| 316 |
Stochastic Submodular Cover with Limited Adaptivity
Arpit Agarwal, Sepehr Assadi, Sanjeev Khanna
|
👻
Ghosted
|
cs.DS
|
22 |
7 years ago |
| 317 |
Composable Core-sets for Determinant Maximization Problems via Spectral Spanners
Piotr Indyk, Sepideh Mahabadi, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
22 |
7 years ago |
| 318 |
On Approximating (Sparse) Covering Integer Programs
Chandra Chekuri, Kent Quanrud
|
👻
Ghosted
|
cs.DS
|
22 |
7 years ago |
| 319 |
On Facility Location with General Lower Bounds
Shi Li
|
👻
Ghosted
|
cs.DS
|
22 |
8 years ago |
| 320 |
The threshold for SDP-refutation of random regular NAE-3SAT
Yash Deshpande, Andrea Montanari, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
22 |
8 years ago |
| 321 |
Optimal Lower Bounds for Sketching Graph Cuts
Charles Carlson, Alexandra Kolla, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
22 |
8 years ago |
| 322 |
Uniform generation of random graphs with power-law degree sequences
Pu Gao, Nicholas Wormald
|
🔮
The Ethereal
|
math.CO
|
22 |
8 years ago |
| 323 |
Estimating graph parameters with random walks
Anna Ben-Hamou, Roberto I. Oliveira, Yuval Peres
|
👻
Ghosted
|
math.ST
|
22 |
8 years ago |
| 324 |
Testing bounded arboricity
Talya Eden, Reut Levi, Dana Ron
|
👻
Ghosted
|
cs.DS
|
22 |
9 years ago |
| 325 |
Conflict-Free Coloring of Planar Graphs
Zachary Abel, Victor Alvarez, ... (+6 more)
|
🔮
The Ethereal
|
cs.DM
|
22 |
9 years ago |
| 326 |
Nearly-optimal bounds for sparse recovery in generic norms, with applications to $k$-median sketching
Arturs Backurs, Piotr Indyk, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
22 |
11 years ago |
| 327 |
A Sublinear-Time Quantum Algorithm for Approximating Partition Functions
Arjan Cornelissen, Yassine Hamoudi
|
👻
Ghosted
|
quant-ph
|
22 |
4 years ago |
| 328 |
New Trade-Offs for Fully Dynamic Matching via Hierarchical EDCS
Soheil Behnezhad, Sanjeev Khanna
|
👻
Ghosted
|
cs.DS
|
22 |
4 years ago |
| 329 |
Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition
Tuukka Korhonen, Daniel Lokshtanov
|
👻
Ghosted
|
cs.DS
|
21 |
2 years ago |
| 330 |
Approximating pathwidth for graphs of small treewidth
Carla Groenland, Gwenaël Joret, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
21 |
5 years ago |
| 331 |
Tight Bounds for the Subspace Sketch Problem with Applications
Yi Li, Ruosong Wang, David P. Woodruff
|
👻
Ghosted
|
cs.DS
|
21 |
7 years ago |
| 332 |
A Truthful Cardinal Mechanism for One-Sided Matching
Rediet Abebe, Richard Cole, ... (+2 more)
|
👻
Ghosted
|
cs.GT
|
21 |
7 years ago |
| 333 |
The Communication Complexity of Set Intersection and Multiple Equality Testing
Dawei Huang, Seth Pettie, ... (+2 more)
|
👻
Ghosted
|
cs.IT
|
21 |
6 years ago |
| 334 |
Stochastic Matching with Few Queries: New Algorithms and Tools
Soheil Behnezhad, Alireza Farhadi, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
21 |
7 years ago |
| 335 |
On the discrepancy of random low degree set systems
Nikhil Bansal, Raghu Meka
|
👻
Ghosted
|
cs.DS
|
21 |
7 years ago |
| 336 |
Opting Into Optimal Matchings
Avrim Blum, Ioannis Caragiannis, ... (+4 more)
|
👻
Ghosted
|
cs.DS
|
21 |
9 years ago |
| 337 |
About the Structure of the Integer Cone and its Application to Bin Packing
Klaus Jansen, Kim-Manuel Klein
|
👻
Ghosted
|
cs.DS
|
21 |
10 years ago |
| 338 |
On the insertion time of random walk cuckoo hashing
Alan Frieze, Tony Johansson
|
👻
Ghosted
|
cs.DS
|
21 |
10 years ago |
| 339 |
Improved Distributed Algorithms for the Lovász Local Lemma and Edge Coloring
Peter Davies
|
👻
Ghosted
|
cs.DC
|
21 |
3 years ago |
| 340 |
Improved List Size for Folded Reed-Solomon Codes
Shashank Srivastava
|
👻
Ghosted
|
cs.IT
|
20 |
1 year ago |
| 341 |
Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More
Hsien-Chih Chang, Jonathan Conroy, ... (+4 more)
|
👻
Ghosted
|
cs.DS
|
20 |
2 years ago |
| 342 |
Approximating Knapsack and Partition via Dense Subset Sums
Mingyang Deng, Ce Jin, Xiao Mao
|
👻
Ghosted
|
cs.DS
|
20 |
3 years ago |
| 343 |
Adaptive Shivers Sort: An Alternative Sorting Algorithm
Vincent Jugé
|
👻
Ghosted
|
cs.DS
|
20 |
7 years ago |
| 344 |
A New Algorithm for the Robust Semi-random Independent Set Problem
Theo McKenzie, Hermish Mehta, Luca Trevisan
|
👻
Ghosted
|
cs.DS
|
20 |
7 years ago |
| 345 |
Minimum Cut of Directed Planar Graphs in O(nloglogn) Time
Shay Mozes, Cyril Nikolaev, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
20 |
10 years ago |
| 346 |
Bandit Algorithms for Prophet Inequality and Pandora's Box
Khashayar Gatmiry, Thomas Kesselheim, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
20 |
3 years ago |
| 347 |
Fast Distributed Brooks' Theorem
Manuela Fischer, Yannic Maus, Magnús M. Halldórsson
|
👻
Ghosted
|
cs.DS
|
20 |
3 years ago |
| 348 |
Testing matrix product states
Mehdi Soleimanifar, John Wright
|
👻
Ghosted
|
quant-ph
|
20 |
4 years ago |
| 349 |
Faster Algorithms for Bounded Knapsack and Bounded Subset Sum Via Fine-Grained Proximity Results
Lin Chen, Jiayi Lian, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
19 |
2 years ago |
| 350 |
Algorithmic Extensions of Dirac's Theorem
Fedor V. Fomin, Petr A. Golovach, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
19 |
5 years ago |