| 551 |
Robust Clustering Oracle and Local Reconstructor of Cluster Structure of Graphs
Pan Peng
|
👻
Ghosted
|
cs.DS
|
9 |
7 years ago |
| 552 |
Finding a latent k-simplex in O(k . nnz(data)) time via Subset Smoothing
Chiranjib Bhattacharyya, Ravindran Kannan
|
👻
Ghosted
|
cs.LG
|
9 |
7 years ago |
| 553 |
Nearly ETH-Tight Algorithms for Planar Steiner Tree with Terminals on Few Faces
Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen
|
👻
Ghosted
|
cs.DS
|
9 |
7 years ago |
| 554 |
Short Cycles via Low-Diameter Decompositions
Yang P. Liu, Sushant Sachdeva, Zejun Yu
|
👻
Ghosted
|
cs.DS
|
9 |
7 years ago |
| 555 |
Near-optimal approximation algorithm for simultaneous Max-Cut
Amey Bhangale, Subhash Khot, ... (+3 more)
|
🔮
The Ethereal
|
cs.CC
|
9 |
8 years ago |
| 556 |
Derandomized concentration bounds for polynomials, and hypergraph maximal independent set
David G. Harris
|
👻
Ghosted
|
cs.DS
|
9 |
9 years ago |
| 557 |
In-Place Sparse Suffix Sorting
Nicola Prezza
|
👻
Ghosted
|
cs.DS
|
9 |
9 years ago |
| 558 |
The Complexity of All-switches Strategy Improvement
John Fearnley, Rahul Savani
|
👻
Ghosted
|
cs.DS
|
9 |
11 years ago |
| 559 |
Streaming algorithms for the missing item finding problem
Manuel Stoeckl
|
👻
Ghosted
|
cs.DS
|
9 |
3 years ago |
| 560 |
Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition
Parinya Chalermsook, Manoj Gupta, ... (+4 more)
|
👻
Ghosted
|
cs.DS
|
9 |
3 years ago |
| 561 |
A New Approach to Estimating Effective Resistances and Counting Spanning Trees in Expander Graphs
Lawrence Li, Sushant Sachdeva
|
👻
Ghosted
|
cs.DS
|
9 |
3 years ago |
| 562 |
Secretary Problems: The Power of a Single Sample
Pranav Nuti, Jan Vondrák
|
👻
Ghosted
|
cs.DS
|
9 |
3 years ago |
| 563 |
Exact Flow Sparsification Requires Unbounded Size
Robert Krauthgamer, Ron Mosenzon
|
👻
Ghosted
|
cs.DS
|
9 |
4 years ago |
| 564 |
Closing the Gap Between Directed Hopsets and Shortcut Sets
Aaron Bernstein, Nicole Wein
|
👻
Ghosted
|
cs.DS
|
9 |
4 years ago |
| 565 |
On complex roots of the independence polynomial
Ferenc Bencs, Péter Csikvári, ... (+2 more)
|
🔮
The Ethereal
|
cs.DM
|
9 |
4 years ago |
| 566 |
Maintaining Expander Decompositions via Sparse Cuts
Yiding Hua, Rasmus Kyng, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
9 |
4 years ago |
| 567 |
Counting Small Induced Subgraphs: Hardness via Fourier Analysis
Radu Curticapean, Daniel Neuen
|
🔮
The Ethereal
|
cs.CC
|
8 |
2 years ago |
| 568 |
Fréchet Distance in Subquadratic Time
Siu-Wing Cheng, Haoqiang Huang
|
👻
Ghosted
|
cs.CG
|
8 |
2 years ago |
| 569 |
Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemeredi Graphs
Sepehr Assadi, Sanjeev Khanna, Peter Kiss
|
👻
Ghosted
|
cs.DS
|
8 |
2 years ago |
| 570 |
Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time
Wenyu Jin, Xiaorui Sun, Mikkel Thorup
|
👻
Ghosted
|
cs.DS
|
8 |
2 years ago |
| 571 |
A Quasi-Monte Carlo Data Structure for Smooth Kernel Evaluations
Moses Charikar, Michael Kapralov, Erik Waingarten
|
👻
Ghosted
|
cs.DS
|
8 |
2 years ago |
| 572 |
Combinatorial Stationary Prophet Inequalities
Neel Patel, David Wajc
|
👻
Ghosted
|
cs.GT
|
8 |
2 years ago |
| 573 |
Near-Optimal Min-Sum Motion Planning for Two Square Robots in a Polygonal Environment
Pankaj K. Agarwal, Dan Halperin, ... (+2 more)
|
👻
Ghosted
|
cs.RO
|
8 |
2 years ago |
| 574 |
Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free
Greg Bodwin, Bernhard Haeupler, Merav Parter
|
👻
Ghosted
|
cs.DS
|
8 |
2 years ago |
| 575 |
A Distributed Palette Sparsification Theorem
Maxime Flin, Mohsen Ghaffari, ... (+3 more)
|
👻
Ghosted
|
cs.DC
|
8 |
3 years ago |
| 576 |
Isomorphism Testing for Graphs Excluding Small Topological Subgraphs
Daniel Neuen
|
👻
Ghosted
|
cs.DS
|
8 |
5 years ago |
| 577 |
Counting Homomorphic Cycles in Degenerate Graphs
Lior Gishboliner, Yevgeny Levanzov, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
8 |
5 years ago |
| 578 |
Sorting Short Keys in Circuits of Size o(n log n)
Gilad Asharov, Wei-Kai Lin, Elaine Shi
|
👻
Ghosted
|
cs.DS
|
8 |
5 years ago |
| 579 |
A Tight Analysis of Greedy Yields Subexponential Time Approximation for Uniform Decision Tree
Ray Li, Percy Liang, Stephen Mussmann
|
👻
Ghosted
|
cs.DS
|
8 |
7 years ago |
| 580 |
Learning from satisfying assignments under continuous distributions
Clément L. Canonne, Anindya De, Rocco A. Servedio
|
👻
Ghosted
|
cs.DS
|
8 |
7 years ago |
| 581 |
Normalizers and permutational isomorphisms in simply-exponential time
Daniel Wiebking
|
👻
Ghosted
|
cs.DS
|
8 |
7 years ago |
| 582 |
A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs
Nathaniel Lahn, Sharath Raghvendra
|
👻
Ghosted
|
cs.DS
|
8 |
8 years ago |
| 583 |
On the complexity of optimal homotopies
Erin Wolf Chambers, Arnaud de Mesmay, Tim Ophelders
|
👻
Ghosted
|
cs.CG
|
8 |
8 years ago |
| 584 |
Lempel-Ziv: a "one-bit catastrophe" but not a tragedy
Guillaume Lagarde, Sylvain Perifel
|
👻
Ghosted
|
cs.DS
|
8 |
9 years ago |
| 585 |
Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time
Yeshwanth Cherapanamjeri, Sandeep Silwal, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
8 |
3 years ago |
| 586 |
Tight Bounds for Monotone Minimal Perfect Hashing
Sepehr Assadi, Martin Farach-Colton, William Kuszmaul
|
👻
Ghosted
|
cs.DS
|
8 |
4 years ago |
| 587 |
Shrunk subspaces via operator Sinkhorn iteration
Cole Franks, Tasuku Soma, Michel X. Goemans
|
👻
Ghosted
|
cs.DS
|
8 |
4 years ago |
| 588 |
Approximation algorithms for Steiner Tree Augmentation Problems
R. Ravi, Weizhong Zhang, Michael Zlatin
|
👻
Ghosted
|
cs.DS
|
8 |
4 years ago |
| 589 |
Subexponential mixing for partition chains on grid-like graphs
Alan Frieze, Wesley Pegden
|
👻
Ghosted
|
math.PR
|
8 |
4 years ago |
| 590 |
Constant Approximating Parameterized $k$-SetCover is W[2]-hard
Bingkai Lin, Xuandi Ren, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
8 |
4 years ago |
| 591 |
A Tight VC-Dimension Analysis of Clustering Coresets with Applications
Vincent Cohen-Addad, Andrew Draganov, ... (+3 more)
|
👻
Ghosted
|
cs.CG
|
7 |
1 year ago |
| 592 |
Deterministic Edge Connectivity and Max Flow using Subquadratic Cut Queries
Aditya Anand, Thatchaphol Saranurak, Yunfan Wang
|
👻
Ghosted
|
cs.DS
|
7 |
1 year ago |
| 593 |
Parallel and Distributed Expander Decomposition: Simple, Fast, and Near-Optimal
Daoyuan Chen, Simon Meierhans, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
7 |
1 year ago |
| 594 |
From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs
Simon Döring, Dániel Marx, Philip Wellnitz
|
🔮
The Ethereal
|
cs.CC
|
7 |
2 years ago |
| 595 |
Faster Linear Systems and Matrix Norm Approximation via Multi-level Sketched Preconditioning
Michał Dereziński, Christopher Musco, Jiaming Yang
|
👻
Ghosted
|
cs.DS
|
7 |
2 years ago |
| 596 |
Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture
Andreas Björklund, Radu Curticapean, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
7 |
2 years ago |
| 597 |
Complexity of polytope diameters via perfect matchings
Christian Nöbel, Raphael Steiner
|
👻
Ghosted
|
math.OC
|
7 |
2 years ago |
| 598 |
Constraint Satisfaction Problems with Advice
Suprovat Ghoshal, Konstantin Makarychev, Yury Makarychev
|
👻
Ghosted
|
cs.DS
|
7 |
2 years ago |
| 599 |
Approximation Algorithms for the Weighted Nash Social Welfare via Convex and Non-Convex Programs
Adam Brown, Aditi Laddha, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
7 |
2 years ago |
| 600 |
A Whole New Ball Game: A Primal Accelerated Method for Matrix Games and Minimizing the Maximum of Smooth Functions
Yair Carmon, Arun Jambulapati, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
7 |
2 years ago |