| 401 |
A Near-Linear Time Sampler for the Ising Model with External Field
Xiaoyu Chen, Xinyuan Zhang
|
👻
Ghosted
|
math.PR
|
16 |
4 years ago |
| 402 |
Online Prediction in Sub-linear Space
Binghui Peng, Fred Zhang
|
👻
Ghosted
|
cs.DS
|
16 |
4 years ago |
| 403 |
Passing the Limits of Pure Local Search for Weighted $k$-Set Packing
Meike Neuwohner
|
👻
Ghosted
|
cs.DS
|
16 |
4 years ago |
| 404 |
Fast Sampling of $b$-Matchings and $b$-Edge Covers
Zongchen Chen, Yuzhou Gu
|
👻
Ghosted
|
cs.DS
|
15 |
3 years ago |
| 405 |
Constrained-Order Prophet Inequalities
Makis Arsenis, Odysseas Drosis, Robert Kleinberg
|
👻
Ghosted
|
cs.DS
|
15 |
5 years ago |
| 406 |
Splay trees on trees
Benjamin Aram Berendsohn, László Kozma
|
👻
Ghosted
|
cs.DS
|
15 |
5 years ago |
| 407 |
Deterministic algorithms for the Lovasz Local Lemma: simpler, more general, and more parallel
David G. Harris
|
👻
Ghosted
|
cs.DS
|
15 |
6 years ago |
| 408 |
Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability
Karl Bringmann, Marvin Künnemann, André Nusser
|
👻
Ghosted
|
cs.DS
|
15 |
7 years ago |
| 409 |
A time- and space-optimal algorithm for the many-visits TSP
André Berger, László Kozma, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
15 |
8 years ago |
| 410 |
A PTAS for subset TSP in minor-free graphs
Hung Le
|
👻
Ghosted
|
cs.DS
|
15 |
8 years ago |
| 411 |
Optimal Distributed Coloring Algorithms for Planar Graphs in the LOCAL model
Shiri Chechik, Doron Mukhtar
|
👻
Ghosted
|
cs.DS
|
15 |
8 years ago |
| 412 |
Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting
Alfonso Cevallos, Stefan Weltge, Rico Zenklusen
|
🔮
The Ethereal
|
cs.DM
|
15 |
8 years ago |
| 413 |
Quasi-regular sequences and optimal schedules for security games
David Kempe, Leonard J. Schulman, Omer Tamuz
|
👻
Ghosted
|
cs.GT
|
15 |
9 years ago |
| 414 |
Doubly Balanced Connected Graph Partitioning
Saleh Soltan, Mihalis Yannakakis, Gil Zussman
|
🔮
The Ethereal
|
math.CO
|
15 |
10 years ago |
| 415 |
Tight Bounds for the Distribution-Free Testing of Monotone Conjunctions
Xi Chen, Jinyu Xie
|
🔮
The Ethereal
|
cs.DM
|
15 |
10 years ago |
| 416 |
Metric embedding with outliers
Anastasios Sidiropoulos, Yusu Wang
|
👻
Ghosted
|
cs.DS
|
15 |
10 years ago |
| 417 |
A Nearly Tight Analysis of Greedy k-means++
Christoph Grunau, Ahmet Alper Özüdoğru, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
15 |
4 years ago |
| 418 |
Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates
Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak
|
👻
Ghosted
|
cs.DS
|
15 |
4 years ago |
| 419 |
Beating Greedy Matching in Sublinear Time
Soheil Behnezhad, Mohammad Roghani, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
15 |
4 years ago |
| 420 |
The Johnson-Lindenstrauss Lemma for Clustering and Subspace Approximation: From Coresets to Dimension Reduction
Moses Charikar, Erik Waingarten
|
👻
Ghosted
|
cs.DS
|
15 |
4 years ago |
| 421 |
On Deterministically Approximating Total Variation Distance
Weiming Feng, Liqiang Liu, Tianren Liu
|
👻
Ghosted
|
cs.DS
|
14 |
2 years ago |
| 422 |
Tight Bounds for Online Graph Partitioning
Monika Henzinger, Stefan Neumann, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
14 |
5 years ago |
| 423 |
Static and Streaming Data Structures for Fréchet Distance Queries
Arnold Filtser, Omrit Filtser
|
👻
Ghosted
|
cs.CG
|
14 |
6 years ago |
| 424 |
Dynamic Set Cover: Improved Amortized and Worst-Case Update Time
Sayan Bhattacharya, Monika Henzinger, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
14 |
6 years ago |
| 425 |
Achieving Optimal Backlog in the Vanilla Multi-Processor Cup Game
William Kuszmaul
|
👻
Ghosted
|
cs.DS
|
14 |
6 years ago |
| 426 |
Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and Triconnectivity
Jacob Holm, Eva Rotenberg
|
👻
Ghosted
|
cs.DS
|
14 |
6 years ago |
| 427 |
Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty
Hendrik Fichtenberger, Pan Peng, Christian Sohler
|
👻
Ghosted
|
cs.DS
|
14 |
7 years ago |
| 428 |
Stochastic $\ell_p$ Load Balancing and Moment Problems via the $L$-Function Method
Marco Molinaro
|
👻
Ghosted
|
cs.DS
|
14 |
7 years ago |
| 429 |
Zeros of Holant problems: locations and algorithms
Heng Guo, Chao Liao, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
14 |
8 years ago |
| 430 |
Improving the smoothed complexity of FLIP for max cut problems
Ali Bibak, Charles Carlson, Karthekeyan Chandrasekaran
|
👻
Ghosted
|
cs.DS
|
14 |
8 years ago |
| 431 |
Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
Zachary Friggstad, Kamyar Khodamoradi, Mohammad R. Salavatipour
|
👻
Ghosted
|
cs.DS
|
14 |
8 years ago |
| 432 |
Localization of Electrical Flows
Aaron Schild, Satish Rao, Nikhil Srivastava
|
👻
Ghosted
|
cs.DS
|
14 |
8 years ago |
| 433 |
Near-Optimal Compression for the Planar Graph Metric
Amir Abboud, Pawel Gawrychowski, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
14 |
9 years ago |
| 434 |
An FPTAS for Counting Proper Four-Colorings on Cubic Graphs
Pinyan Lu, Kuan Yang, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
14 |
9 years ago |
| 435 |
An Efficient Representation for Filtrations of Simplicial Complexes
Jean-Daniel Boissonnat, Karthik C. S.
|
👻
Ghosted
|
cs.CG
|
14 |
9 years ago |
| 436 |
LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs
Nikhil Bansal, Daniel Reichman, Seeun William Umboh
|
👻
Ghosted
|
cs.DS
|
14 |
10 years ago |
| 437 |
Bridging the Capacity Gap Between Interactive and One-Way Communication
Bernhard Haeupler, Ameya Velingker
|
👻
Ghosted
|
cs.IT
|
14 |
10 years ago |
| 438 |
A Cut-Matching Game for Constant-Hop Expanders
Bernhard Haeupler, Jonas Huebotter, Mohsen Ghaffari
|
👻
Ghosted
|
cs.DS
|
14 |
3 years ago |
| 439 |
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results
Jacob Focke, Dániel Marx, ... (+5 more)
|
🔮
The Ethereal
|
cs.CC
|
14 |
3 years ago |
| 440 |
A Framework for Approximation Schemes on Disk Graphs
Daniel Lokshtanov, Fahad Panolan, ... (+3 more)
|
👻
Ghosted
|
cs.CG
|
14 |
3 years ago |
| 441 |
Adaptive Out-Orientations with Applications
Aleksander B. G. Christiansen, Jacob Holm, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
14 |
3 years ago |
| 442 |
Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints
Eun Jung Kim, Stefan Kratsch, ... (+2 more)
|
🔮
The Ethereal
|
cs.CC
|
14 |
4 years ago |
| 443 |
From algorithms to connectivity and back: finding a giant component in random k-SAT
Zongchen Chen, Nitya Mani, Ankur Moitra
|
👻
Ghosted
|
cs.DS
|
14 |
4 years ago |
| 444 |
Faster Vizing and Near-Vizing Edge Coloring Algorithms
Sepehr Assadi
|
👻
Ghosted
|
cs.DS
|
13 |
2 years ago |
| 445 |
Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds
Nairen Cao, Shang-En Huang, Hsin-Hao Su
|
👻
Ghosted
|
cs.DS
|
13 |
3 years ago |
| 446 |
Fast Low-Space Algorithms for Subset Sum
Ce Jin, Nikhil Vyas, Ryan Williams
|
👻
Ghosted
|
cs.DS
|
13 |
5 years ago |
| 447 |
Approximating the Median under the Ulam Metric
Diptarka Chakraborty, Debarati Das, Robert Krauthgamer
|
👻
Ghosted
|
cs.DS
|
13 |
5 years ago |
| 448 |
Strongly refuting all semi-random Boolean CSPs
Jackson Abascal, Venkatesan Guruswami, Pravesh K. Kothari
|
🔮
The Ethereal
|
cs.CC
|
13 |
5 years ago |
| 449 |
Improved Approximations for Min Sum Vertex Cover and Generalized Min Sum Set Cover
Nikhil Bansal, Jatin Batra, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
13 |
6 years ago |
| 450 |
Dynamic Graph Algorithms with Batch Updates in the Massively Parallel Computation Model
Krzysztof Nowicki, Krzysztof Onak
|
👻
Ghosted
|
cs.DS
|
13 |
6 years ago |