| 401 |
The integrality gap of the Goemans--Linial SDP relaxation for Sparsest Cut is at least a constant multiple of $\sqrt{\log n}$
Assaf Naor, Robert Young
|
👻
Ghosted
|
cs.DS
|
9 |
9 years ago |
| 402 |
Incomplete Nested Dissection
Rasmus Kyng, Richard Peng, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
9 |
8 years ago |
| 403 |
Non-Gaussian Component Analysis using Entropy Methods
Navin Goyal, Abhishek Shetty
|
👻
Ghosted
|
cs.LG
|
9 |
8 years ago |
| 404 |
Information Diffusion in Social Networks: Friendship Paradox based Models and Statistical Inference
Vikram Krishnamurthy, Buddhika Nettasinghe
|
👻
Ghosted
|
cs.SI
|
9 |
7 years ago |
| 405 |
Constant Girth Approximation for Directed Graphs in Subquadratic Time
Shiri Chechik, Yang P. Liu, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
9 |
6 years ago |
| 406 |
Improved Dynamic Colouring of Sparse Graphs
Aleksander B. G. Christiansen, Krzysztof D. Nowicki, Eva Rotenberg
|
👻
Ghosted
|
cs.DS
|
9 |
3 years ago |
| 407 |
Cheeger Inequalities for Directed Graphs and Hypergraphs Using Reweighted Eigenvalues
Lap Chi Lau, Kam Chuen Tung, Robert Wang
|
👻
Ghosted
|
cs.DS
|
9 |
3 years ago |
| 408 |
Dynamic Maxflow via Dynamic Interior Point Methods
Jan van den Brand, Yang P. Liu, Aaron Sidford
|
👻
Ghosted
|
cs.DS
|
9 |
3 years ago |
| 409 |
Improved and Deterministic Online Service with Deadlines or Delay
Noam Touitou
|
👻
Ghosted
|
cs.DS
|
9 |
3 years ago |
| 410 |
Semidefinite programs simulate approximate message passing robustly
Misha Ivkov, Tselil Schramm
|
👻
Ghosted
|
cs.DS
|
9 |
2 years ago |
| 411 |
Sparsifying generalized linear models
Arun Jambulapati, James R. Lee, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
9 |
2 years ago |
| 412 |
Parallel Sampling via Counting
Nima Anari, Ruiquan Gao, Aviad Rubinstein
|
👻
Ghosted
|
cs.DS
|
9 |
1 year ago |
| 413 |
Single-copy stabilizer testing
Marcel Hinsche, Jonas Helsen
|
👻
Ghosted
|
quant-ph
|
9 |
1 year ago |
| 414 |
Quantum-Computable One-Way Functions without One-Way Functions
William Kretschmer, Luowen Qian, Avishay Tal
|
👻
Ghosted
|
quant-ph
|
9 |
1 year ago |
| 415 |
Model Stealing for Any Low-Rank Language Model
Allen Liu, Ankur Moitra
|
👻
Ghosted
|
cs.LG
|
9 |
1 year ago |
| 416 |
How to Protect Yourself from Threatening Skeletons: Optimal Padded Decompositions for Minor-Free Graphs
Jonathan Conroy, Arnold Filtser
|
👻
Ghosted
|
cs.DS
|
9 |
1 year ago |
| 417 |
Optimal Sequence Length Requirements for Phylogenetic Tree Reconstruction with Indels
Arun Ganesh, Qiuyi Zhang
|
👻
Ghosted
|
cs.DS
|
8 |
7 years ago |
| 418 |
Gradient-Based Empirical Risk Minimization using Local Polynomial Regression
Ali Jadbabaie, Anuran Makur, Devavrat Shah
|
👻
Ghosted
|
cs.LG
|
8 |
5 years ago |
| 419 |
Almost-Optimal Sublinear-Time Edit Distance in the Low Distance Regime
Karl Bringmann, Alejandro Cassis, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
8 |
4 years ago |
| 420 |
List-Decodable Covariance Estimation
Misha Ivkov, Pravesh K. Kothari
|
👻
Ghosted
|
cs.DS
|
8 |
4 years ago |
| 421 |
Fixed-parameter tractability of Graph Isomorphism in graphs with an excluded minor
Daniel Lokshtanov, Marcin Pilipczuk, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
8 |
3 years ago |
| 422 |
Tight Conditional Lower Bounds for Vertex Connectivity Problems
Zhiyi Huang, Yaowei Long, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
8 |
3 years ago |
| 423 |
Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques
Mina Dalirrooyfard, Surya Mathialagan, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
8 |
2 years ago |
| 424 |
Breaking the VLB Barrier for Oblivious Reconfigurable Networks
Tegan Wilson, Daniel Amir, ... (+4 more)
|
👻
Ghosted
|
cs.DS
|
8 |
2 years ago |
| 425 |
A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and their Applications
Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg
|
👻
Ghosted
|
cs.DS
|
8 |
2 years ago |
| 426 |
Ghost Value Augmentation for $k$-Edge-Connectivity
D Ellis Hershkowitz, Nathan Klein, Rico Zenklusen
|
👻
Ghosted
|
cs.DS
|
8 |
2 years ago |
| 427 |
Improving the Bit Complexity of Communication for Distributed Convex Optimization
Mehrdad Ghadiri, Yin Tat Lee, ... (+4 more)
|
👻
Ghosted
|
cs.DS
|
8 |
2 years ago |
| 428 |
Positive bias makes tensor-network contraction tractable
Jiaqing Jiang, Jielun Chen, ... (+2 more)
|
👻
Ghosted
|
quant-ph
|
8 |
1 year ago |
| 429 |
Sampling and Integration of Logconcave Functions by Algorithmic Diffusion
Yunbum Kook, Santosh S. Vempala
|
👻
Ghosted
|
cs.DS
|
8 |
1 year ago |
| 430 |
Tractable Agreement Protocols
Natalie Collina, Surbhi Goel, ... (+2 more)
|
👻
Ghosted
|
cs.LG
|
8 |
1 year ago |
| 431 |
Explicit Codes approaching Generalized Singleton Bound using Expanders
Fernando Granha Jeronimo, Tushant Mittal, ... (+2 more)
|
👻
Ghosted
|
cs.IT
|
8 |
1 year ago |
| 432 |
A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection
Kyle Fox, Philip N. Klein, Shay Mozes
|
👻
Ghosted
|
cs.DS
|
7 |
11 years ago |
| 433 |
Approximate Modularity Revisited
Uriel Feige, Michal Feldman, Inbal Talgam-Cohen
|
👻
Ghosted
|
cs.DS
|
7 |
9 years ago |
| 434 |
Testing Unateness Nearly Optimally
Xi Chen, Erik Waingarten
|
👻
Ghosted
|
cs.DS
|
7 |
7 years ago |
| 435 |
Approximation Algorithms for Distributionally Robust Stochastic Optimization with Black-Box Distributions
Andre Linhares, Chaitanya Swamy
|
👻
Ghosted
|
cs.DS
|
7 |
7 years ago |
| 436 |
A $(2+\varepsilon)$-approximation algorithm for preemptive weighted flow time on a single machine
Lars Rohwedder, Andreas Wiese
|
👻
Ghosted
|
cs.DS
|
7 |
5 years ago |
| 437 |
Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth
Tobias Friedrich, Davis Issac, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
7 |
3 years ago |
| 438 |
Online Unrelated-Machine Load Balancing and Generalized Flow with Recourse
Ravishankar Krishnaswamy, Shi Li, Varun Suriyanarayana
|
👻
Ghosted
|
cs.DS
|
7 |
3 years ago |
| 439 |
Locally consistent decomposition of strings with applications to edit distance sketching
Sudatta Bhattacharya, Michal Koucký
|
👻
Ghosted
|
cs.DS
|
7 |
3 years ago |
| 440 |
Static Pricing Guarantees for Queueing Systems
Jacob Bergquist, Adam N. Elmachtoub
|
👻
Ghosted
|
cs.DS
|
7 |
3 years ago |
| 441 |
Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs
Sayan Bhattacharya, Peter Kiss, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
7 |
3 years ago |
| 442 |
Connectivity Labeling and Routing with Multiple Vertex Failures
Merav Parter, Asaf Petruschka, Seth Pettie
|
👻
Ghosted
|
cs.DS
|
7 |
3 years ago |
| 443 |
The Power of Adaptivity in Quantum Query Algorithms
Uma Girish, Makrand Sinha, ... (+2 more)
|
👻
Ghosted
|
quant-ph
|
7 |
2 years ago |
| 444 |
Nearly Optimal Fault Tolerant Distance Oracle
Dipan Dey, Manoj Gupta
|
👻
Ghosted
|
cs.DS
|
7 |
2 years ago |
| 445 |
A Fine-grained Classification of Subquadratic Patterns for Subgraph Listing and Friends
Karl Bringmann, Egor Gorbachev
|
👻
Ghosted
|
cs.DS
|
7 |
2 years ago |
| 446 |
Efficient Algorithms and New Characterizations for CSP Sparsification
Sanjeev Khanna, Aaron L. Putterman, Madhu Sudan
|
👻
Ghosted
|
cs.DS
|
7 |
2 years ago |
| 447 |
Bounded Edit Distance: Optimal Static and Dynamic Algorithms for Small Integer Weights
Egor Gorbachev, Tomasz Kociumaka
|
👻
Ghosted
|
cs.DS
|
7 |
2 years ago |
| 448 |
Approximating Maximum Matching Requires Almost Quadratic Time
Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein
|
👻
Ghosted
|
cs.DS
|
7 |
2 years ago |
| 449 |
Weak recovery, hypothesis testing, and mutual information in stochastic block models and planted factor graphs
Elchanan Mossel, Allan Sly, Youngtak Sohn
|
👻
Ghosted
|
math.PR
|
7 |
2 years ago |
| 450 |
Locality vs Quantum Codes
Samuel Dai, Ray Li
|
👻
Ghosted
|
quant-ph
|
7 |
1 year ago |