| 351 |
Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements
Martin Grohe, Moritz Lichter, ... (+2 more)
|
🔮
The Ethereal
|
cs.DM
|
12 |
2 years ago |
| 352 |
Optimal Algorithms for Bounded Weighted Edit Distance
Alejandro Cassis, Tomasz Kociumaka, Philip Wellnitz
|
👻
Ghosted
|
cs.DS
|
12 |
3 years ago |
| 353 |
Folklore Sampling is Optimal for Exact Hopsets: Confirming the $\sqrt{n}$ Barrier
Greg Bodwin, Gary Hoppenworth
|
👻
Ghosted
|
cs.DS
|
12 |
3 years ago |
| 354 |
Scheduling Precedence-Constrained Jobs on Related Machines with Communication Delay
Biswaroop Maiti, Rajmohan Rajaraman, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
12 |
6 years ago |
| 355 |
Isomorphism Testing for Graphs Excluding Small Minors
Martin Grohe, Daniel Neuen, Daniel Wiebking
|
👻
Ghosted
|
cs.DS
|
12 |
6 years ago |
| 356 |
Random $k$-out subgraph leaves only $O(n/k)$ inter-component edges
Jacob Holm, Valerie King, ... (+3 more)
|
🔮
The Ethereal
|
cs.DM
|
12 |
6 years ago |
| 357 |
A characterization of graph properties testable for general planar graphs with one-sided error (It is all about forbidden subgraphs)
Artur Czumaj, Christian Sohler
|
👻
Ghosted
|
cs.DS
|
12 |
6 years ago |
| 358 |
Multi-Resolution Hashing for Fast Pairwise Summations
Moses Charikar, Paris Siminelakis
|
👻
Ghosted
|
cs.DS
|
12 |
8 years ago |
| 359 |
Subdeterminant Maximization via Nonconvex Relaxations and Anti-concentration
Javad B. Ebrahimi, Damian Straszak, Nisheeth K. Vishnoi
|
👻
Ghosted
|
cs.DS
|
12 |
9 years ago |
| 360 |
A PTAS for the Steiner Forest Problem in Doubling Metrics
T-H. Hubert Chan, Shuguang Hu, Shaofeng H. -C. Jiang
|
👻
Ghosted
|
cs.DS
|
12 |
9 years ago |
| 361 |
Computing linear sections of varieties: quantum entanglement, tensor decompositions and beyond
Nathaniel Johnston, Benjamin Lovitz, Aravindan Vijayaraghavan
|
👻
Ghosted
|
cs.DS
|
12 |
3 years ago |
| 362 |
Having Hope in Hops: New Spanners, Preservers and Lower Bounds for Hopsets
Shimon Kogan, Merav Parter
|
👻
Ghosted
|
cs.DS
|
12 |
3 years ago |
| 363 |
Rounds vs Communication Tradeoffs for Maximal Independent Sets
Sepehr Assadi, Gillat Kol, Zhijun Zhang
|
👻
Ghosted
|
cs.DS
|
12 |
3 years ago |
| 364 |
On Weighted Graph Sparsification by Linear Sketching
Yu Chen, Sanjeev Khanna, Huan Li
|
👻
Ghosted
|
cs.DS
|
12 |
3 years ago |
| 365 |
Improved Lower Bounds for Submodular Function Minimization
Deeparnab Chakrabarty, Andrei Graur, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
12 |
4 years ago |
| 366 |
Approximation Algorithms and Hardness for $n$-Pairs Shortest Paths and All-Nodes Shortest Cycles
Mina Dalirrooyfard, Ce Jin, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
12 |
4 years ago |
| 367 |
Sampling Lovász Local Lemma For General Constraint Satisfaction Solutions In Near-Linear Time
Kun He, Chunyang Wang, Yitong Yin
|
👻
Ghosted
|
cs.DS
|
12 |
4 years ago |
| 368 |
Cheeger Inequalities for Vertex Expansion and Reweighted Eigenvalues
Tsz Chiu Kwok, Lap Chi Lau, Kam Chuen Tung
|
👻
Ghosted
|
cs.DS
|
12 |
4 years ago |
| 369 |
Shortest Paths without a Map, but with an Entropic Regularizer
Sébastien Bubeck, Christian Coester, Yuval Rabani
|
👻
Ghosted
|
cs.DS
|
12 |
4 years ago |
| 370 |
Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
Niv Buchbinder, Moran Feldman
|
👻
Ghosted
|
cs.DS
|
11 |
1 year ago |
| 371 |
Fully Dynamic $k$-Clustering with Fast Update Time and Small Recourse
Sayan Bhattacharya, Martín Costa, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
11 |
1 year ago |
| 372 |
Locally Stationary Distributions: A Framework for Analyzing Slow-Mixing Markov Chains
Kuikui Liu, Sidhanth Mohanty, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
11 |
2 years ago |
| 373 |
Fast Mixing in Sparse Random Ising Models
Kuikui Liu, Sidhanth Mohanty, ... (+2 more)
|
👻
Ghosted
|
math.PR
|
11 |
2 years ago |
| 374 |
Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric
Zeyu Guo, Chaoping Xing, ... (+2 more)
|
👻
Ghosted
|
cs.IT
|
11 |
2 years ago |
| 375 |
Faster Algorithms for Text-to-Pattern Hamming Distances
Timothy M. Chan, Ce Jin, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
11 |
2 years ago |
| 376 |
A Randomized Algorithm for Single-Source Shortest Path on Undirected Real-Weighted Graphs
Ran Duan, Jiayi Mao, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
11 |
3 years ago |
| 377 |
Krylov Methods are (nearly) Optimal for Low-Rank Approximation
Ainesh Bakshi, Shyam Narayanan
|
👻
Ghosted
|
cs.DS
|
11 |
3 years ago |
| 378 |
Near Optimal Memory-Regret Tradeoff for Online Learning
Binghui Peng, Aviad Rubinstein
|
👻
Ghosted
|
cs.DS
|
11 |
3 years ago |
| 379 |
Quantum learning algorithms imply circuit lower bounds
Srinivasan Arunachalam, Alex B. Grilo, ... (+3 more)
|
👻
Ghosted
|
quant-ph
|
11 |
5 years ago |
| 380 |
Finding monotone patterns in sublinear time
Omri Ben-Eliezer, Clément L. Canonne, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
11 |
6 years ago |
| 381 |
A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs
Vincent Cohen-Addad, Marcin Pilipczuk, Michał Pilipczuk
|
👻
Ghosted
|
cs.DS
|
11 |
7 years ago |
| 382 |
Linear-Time and Efficient Distributed Algorithms for List Coloring Graphs on Surfaces
Luke Postle
|
🔮
The Ethereal
|
math.CO
|
11 |
7 years ago |
| 383 |
Classical Verification of Quantum Computations in Linear Time
Jiayu Zhang
|
👻
Ghosted
|
quant-ph
|
11 |
4 years ago |
| 384 |
Fitting Metrics and Ultrametrics with Minimum Disagreements
Vincent Cohen-Addad, Chenglin Fan, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
11 |
3 years ago |
| 385 |
Maximum Flow by Augmenting Paths in $n^{2+o(1)}$ Time
Aaron Bernstein, Joakim Blikstad, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
10 |
2 years ago |
| 386 |
An Improved Pseudopolynomial Time Algorithm for Subset Sum
Lin Chen, Jiayi Lian, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
10 |
2 years ago |
| 387 |
Local Computation Algorithms for Maximum Matching: New Lower Bounds
Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein
|
👻
Ghosted
|
cs.DS
|
10 |
2 years ago |
| 388 |
Tight Cell-Probe Lower Bounds for Dynamic Succinct Dictionaries
Tianxiao Li, Jingxun Liang, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
10 |
3 years ago |
| 389 |
Faster High Accuracy Multi-Commodity Flow from Single-Commodity Techniques
Jan van den Brand, Daniel Zhang
|
👻
Ghosted
|
cs.DS
|
10 |
3 years ago |
| 390 |
Maximizing Determinants under Matroid Constraints
Vivek Madan, Aleksandar Nikolov, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
10 |
6 years ago |
| 391 |
Spectral analysis of matrix scaling and operator scaling
Tsz Chiu Kwok, Lap Chi Lau, Akshay Ramachandran
|
👻
Ghosted
|
cs.DS
|
10 |
7 years ago |
| 392 |
Amplification and Derandomization Without Slowdown
Ofer Grossman, Dana Moshkovitz
|
👻
Ghosted
|
cs.DS
|
10 |
10 years ago |
| 393 |
Linear Hashing with $\ell_\infty$ guarantees and two-sided Kakeya bounds
Manik Dhar, Zeev Dvir
|
🔮
The Ethereal
|
math.CO
|
10 |
4 years ago |
| 394 |
Separating MAX 2-AND, MAX DI-CUT and MAX CUT
Joshua Brakensiek, Neng Huang, ... (+2 more)
|
🔮
The Ethereal
|
cs.CC
|
10 |
3 years ago |
| 395 |
Improved Streaming Algorithms for Maximum Directed Cut via Smoothed Snapshots
Raghuvansh R. Saxena, Noah G. Singer, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
10 |
3 years ago |
| 396 |
Polynomial-Time Power-Sum Decomposition of Polynomials
Mitali Bafna, Jun-Ting Hsieh, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
10 |
3 years ago |
| 397 |
Balanced Allocations: The Heavily Loaded Case with Deletions
Nikhil Bansal, William Kuszmaul
|
👻
Ghosted
|
cs.DS
|
10 |
4 years ago |
| 398 |
Properly learning monotone functions via local reconstruction
Jane Lange, Ronitt Rubinfeld, Arsen Vasilyan
|
👻
Ghosted
|
cs.DS
|
10 |
4 years ago |
| 399 |
Random Reed-Solomon Codes and Random Linear Codes are Locally Equivalent
Matan Levi, Jonathan Mosheiff, Nikhil Shagrithaya
|
👻
Ghosted
|
cs.IT
|
9 |
2 years ago |
| 400 |
Agnostically Learning Multi-index Models with Queries
Ilias Diakonikolas, Daniel M. Kane, ... (+3 more)
|
👻
Ghosted
|
cs.LG
|
9 |
2 years ago |