| 251 |
Analysis of Ward's Method
Anna Großwendt, Heiko Röglin, Melanie Schmidt
|
👻
Ghosted
|
cs.DS
|
27 |
7 years ago |
| 252 |
Hitting minors on bounded treewidth graphs. IV. An optimal algorithm
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
|
👻
Ghosted
|
cs.DS
|
27 |
7 years ago |
| 253 |
Reducing approximate Longest Common Subsequence to approximate Edit Distance
Aviad Rubinstein, Zhao Song
|
👻
Ghosted
|
cs.DS
|
27 |
7 years ago |
| 254 |
New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs
Amir Abboud, Robert Krauthgamer, Ohad Trabelsi
|
👻
Ghosted
|
cs.DS
|
27 |
7 years ago |
| 255 |
$k$-Servers with a Smile: Online Algorithms via Projections
Niv Buchbinder, Anupam Gupta, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
27 |
7 years ago |
| 256 |
Fast Modular Subset Sum using Linear Sketching
Kyriakos Axiotis, Arturs Backurs, Christos Tzamos
|
👻
Ghosted
|
cs.DS
|
27 |
8 years ago |
| 257 |
Losing Treewidth by Separating Subsets
Anupam Gupta, Euiwoong Lee, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
27 |
8 years ago |
| 258 |
Recognizing Weak Embeddings of Graphs
Hugo A. Akitaya, Radoslav Fulek, Csaba D. Tóth
|
👻
Ghosted
|
cs.CG
|
27 |
8 years ago |
| 259 |
Dynamic Bridge-Finding in $\tilde{O}(\log ^2 n)$ Amortized Time
Jacob Holm, Eva Rotenberg, Mikkel Thorup
|
👻
Ghosted
|
cs.DS
|
27 |
9 years ago |
| 260 |
Steiner Point Removal with Distortion $O(\log k)$
Arnold Filtser
|
👻
Ghosted
|
cs.DS
|
27 |
9 years ago |
| 261 |
A Framework for Analyzing Resparsification Algorithms
Rasmus Kyng, Jakub Pachocki, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
27 |
9 years ago |
| 262 |
Computing minimum cuts in hypergraphs
Chandra Chekuri, Chao Xu
|
👻
Ghosted
|
cs.DS
|
27 |
9 years ago |
| 263 |
Consistent k-Clustering for General Metrics
Hendrik Fichtenberger, Silvio Lattanzi, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
26 |
5 years ago |
| 264 |
Planar Distance Oracles with Better Time-Space Tradeoffs
Yaowei Long, Seth Pettie
|
👻
Ghosted
|
cs.DS
|
26 |
6 years ago |
| 265 |
Peeling Close to the Orientability Threshold: Spatial Coupling in Hashing-Based Data Structures
Stefan Walzer
|
👻
Ghosted
|
cs.DS
|
26 |
6 years ago |
| 266 |
Dimension-independent Sparse Fourier Transform
Michael Kapralov, Ameya Velingker, Amir Zandieh
|
👻
Ghosted
|
cs.DS
|
26 |
7 years ago |
| 267 |
Estimating Graph Parameters from Random Order Streams
Pan Peng, Christian Sohler
|
👻
Ghosted
|
cs.DS
|
26 |
8 years ago |
| 268 |
A $o(d) \cdot \text{polylog}~n$ Monotonicity Tester for Boolean Functions over the Hypergrid $[n]^d$
Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
|
🔮
The Ethereal
|
cs.DM
|
26 |
8 years ago |
| 269 |
A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank
Radu Curticapean, Nathan Lindzey, Jesper Nederlof
|
👻
Ghosted
|
cs.DS
|
26 |
8 years ago |
| 270 |
Approximate Distance Oracles for Planar Graphs with Improved Query Time-Space Tradeoff
Christian Wulff-Nilsen
|
👻
Ghosted
|
cs.DS
|
26 |
10 years ago |
| 271 |
Building a Good Team: Secretary Problems and the Supermodular Degree
Moran Feldman, Rani Izsak
|
👻
Ghosted
|
cs.DS
|
26 |
11 years ago |
| 272 |
Pricing Online Decisions: Beyond Auctions
Ilan Reuven Cohen, Alon Eden, ... (+2 more)
|
👻
Ghosted
|
cs.GT
|
26 |
11 years ago |
| 273 |
A Unifying Framework for Differentially Private Sums under Continual Observation
Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay
|
👻
Ghosted
|
cs.LG
|
26 |
3 years ago |
| 274 |
A simple and sharper proof of the hypergraph Moore bound
Jun-Ting Hsieh, Pravesh K. Kothari, Sidhanth Mohanty
|
🔮
The Ethereal
|
math.CO
|
26 |
4 years ago |
| 275 |
Improved Algorithms for Solving Polynomial Systems over GF(2) by Multiple Parity-Counting
Itai Dinur
|
👻
Ghosted
|
cs.DS
|
25 |
6 years ago |
| 276 |
Stochastic Load Balancing on Unrelated Machines
Anupam Gupta, Amit Kumar, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
25 |
7 years ago |
| 277 |
Ramsey Spanning Trees and their Applications
Ittai Abraham, Shiri Chechik, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
25 |
8 years ago |
| 278 |
On Notions of Distortion and an Almost Minimum Spanning Tree with Constant Average Distortion
Yair Bartal, Arnold Filtser, Ofer Neiman
|
👻
Ghosted
|
cs.DS
|
25 |
9 years ago |
| 279 |
Canonical Paths for MCMC: from Art to Science
Lingxiao Huang, Pinyan Lu, Chihao Zhang
|
👻
Ghosted
|
cs.DS
|
25 |
10 years ago |
| 280 |
Lower bounds for the parameterized complexity of Minimum Fill-in and other completion problems
Ivan Bliznets, Marek Cygan, ... (+3 more)
|
🔮
The Ethereal
|
cs.CC
|
25 |
10 years ago |
| 281 |
Mean estimation when you have the source code; or, quantum Monte Carlo methods
Robin Kothari, Ryan O'Donnell
|
👻
Ghosted
|
quant-ph
|
25 |
3 years ago |
| 282 |
A logic-based algorithmic meta-theorem for mim-width
Benjamin Bergougnoux, Jan Dreier, Lars Jaffke
|
👻
Ghosted
|
cs.DS
|
25 |
4 years ago |
| 283 |
Faster Rectangular Matrix Multiplication by Combination Loss Analysis
François Le Gall
|
👻
Ghosted
|
cs.DS
|
24 |
3 years ago |
| 284 |
Online Discrepancy Minimization for Stochastic Arrivals
Nikhil Bansal, Haotian Jiang, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
24 |
6 years ago |
| 285 |
Optimal Vertex Fault-Tolerant Spanners in Polynomial Time
Greg Bodwin, Michael Dinitz, Caleb Robelle
|
👻
Ghosted
|
cs.DS
|
24 |
6 years ago |
| 286 |
Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
Walter Didimo, Giuseppe Liotta, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
24 |
6 years ago |
| 287 |
Nearly optimal edge estimation with independent set queries
Xi Chen, Amit Levi, Erik Waingarten
|
👻
Ghosted
|
cs.DS
|
24 |
7 years ago |
| 288 |
Quasi-popular Matchings, Optimality, and Extended Formulations
Yuri Faenza, Telikepalli Kavitha
|
👻
Ghosted
|
cs.DS
|
24 |
7 years ago |
| 289 |
Testing Matrix Rank, Optimally
Maria-Florina Balcan, Yi Li, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
24 |
7 years ago |
| 290 |
Approximation Schemes for Capacitated Clustering in Doubling Metrics
Vincent Cohen-Addad
|
👻
Ghosted
|
cs.DS
|
24 |
7 years ago |
| 291 |
On the Structure of Unique Shortest Paths in Graphs
Greg Bodwin
|
👻
Ghosted
|
cs.DS
|
24 |
8 years ago |
| 292 |
Tight Bounds for $\ell_p$ Oblivious Subspace Embeddings
Ruosong Wang, David P. Woodruff
|
👻
Ghosted
|
cs.DS
|
24 |
8 years ago |
| 293 |
Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs
Shiri Chechik, Thomas Dueholm Hansen, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
24 |
9 years ago |
| 294 |
Exploring an Infinite Space with Finite Memory Scouts
Lihi Cohen, Yuval Emek, ... (+2 more)
|
👻
Ghosted
|
math.PR
|
24 |
9 years ago |
| 295 |
Average-radius list-recovery of random linear codes: it really ties the room together
Atri Rudra, Mary Wootters
|
👻
Ghosted
|
cs.IT
|
24 |
9 years ago |
| 296 |
Sparse Suffix Tree Construction in Optimal Time and Space
Paweł Gawrychowski, Tomasz Kociumaka
|
👻
Ghosted
|
cs.DS
|
24 |
9 years ago |
| 297 |
An O(m^2 log m)-Competitive Algorithm for Online Machine Minimization
Lin Chen, Nicole Megow, Kevin Schewior
|
👻
Ghosted
|
cs.DS
|
24 |
11 years ago |
| 298 |
Online Lewis Weight Sampling
David P. Woodruff, Taisuke Yasuda
|
👻
Ghosted
|
cs.DS
|
24 |
4 years ago |
| 299 |
Competitive Allocation of a Mixed Manna
Bhaskar Ray Chaudhury, Jugal Garg, ... (+2 more)
|
👻
Ghosted
|
cs.GT
|
23 |
5 years ago |
| 300 |
Quantum algorithms for graph problems with cut queries
Troy Lee, Miklos Santha, Shengyu Zhang
|
👻
Ghosted
|
cs.DS
|
23 |
6 years ago |