| 701 |
Representative set statements for delta-matroids and the Mader delta-matroid
Magnus Wahlström
|
👻
Ghosted
|
cs.DS
|
4 |
3 years ago |
| 702 |
Fully Dynamic Shortest Path Reporting Against an Adaptive Adversary
Anastasiia Alokhina, Jan van den Brand
|
👻
Ghosted
|
cs.DS
|
4 |
3 years ago |
| 703 |
Maximal $k$-Edge-Connected Subgraphs in Weighted Graphs via Local Random Contraction
Chaitanya Nalam, Thatchaphol Saranurak
|
👻
Ghosted
|
cs.DS
|
4 |
3 years ago |
| 704 |
Competitive Data-Structure Dynamization
Claire Mathieu, Rajmohan Rajaraman, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
4 |
5 years ago |
| 705 |
Robust Algorithms for Online Convex Problems via Primal-Dual
Marco Molinaro
|
👻
Ghosted
|
cs.DS
|
4 |
5 years ago |
| 706 |
Query strategies for priced information, revisited
Guy Blanc, Jane Lange, Li-Yang Tan
|
👻
Ghosted
|
cs.DS
|
4 |
5 years ago |
| 707 |
A Parameterized Family of Meta-Submodular Functions
Mehrdad Ghadiri, Richard Santiago, Bruce Shepherd
|
👻
Ghosted
|
cs.DS
|
4 |
6 years ago |
| 708 |
Optimal Discretization is Fixed-parameter Tractable
Stefan Kratsch, Tomáš Masařík, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
4 |
6 years ago |
| 709 |
Better Sample -- Random Subset Sum in $2^{0.255n}$ and its Impact on Decoding Random Linear Codes
Andre Esser, Alexander May
|
👻
Ghosted
|
cs.DS
|
4 |
7 years ago |
| 710 |
Approximating Permanent of Random Matrices with Vanishing Mean: Made Better and Simpler
Zhengfeng Ji, Zhihan Jin, Pinyan Lu
|
👻
Ghosted
|
cs.DS
|
4 |
6 years ago |
| 711 |
Computing Circle Packing Representations of Planar Graphs
Sally Dong, Yin Tat Lee, Kent Quanrud
|
👻
Ghosted
|
cs.CG
|
4 |
6 years ago |
| 712 |
Finding irrelevant vertices in linear time on bounded-genus graphs
Petr A. Golovach, Stavros G. Kolliopoulos, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
4 |
7 years ago |
| 713 |
Algorithms for #BIS-hard problems on expander graphs
Matthew Jenssen, Peter Keevash, Will Perkins
|
👻
Ghosted
|
cs.DS
|
4 |
8 years ago |
| 714 |
Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fields
Swastik Kopparty, Aditya Potukuchi
|
👻
Ghosted
|
cs.IT
|
4 |
8 years ago |
| 715 |
A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs with a Fixed Number of Terminals
Vincent Cohen-Addad, Éric Colin de Verdière, Arnaud de Mesmay
|
👻
Ghosted
|
cs.DS
|
4 |
9 years ago |
| 716 |
Random Walks and Evolving Sets: Faster Convergences and Limitations
Siu On Chan, Tsz Chiu Kwok, Lap Chi Lau
|
👻
Ghosted
|
cs.DS
|
4 |
11 years ago |
| 717 |
Excluding Single-Crossing Matching Minors in Bipartite Graphs
Archontia C. Giannopoulou, Dimitrios M. Thilikos, Sebastian Wiederrecht
|
🔮
The Ethereal
|
math.CO
|
4 |
3 years ago |
| 718 |
Smaller Low-Depth Circuits for Kronecker Powers
Josh Alman, Yunfeng Guan, Ashwin Padaki
|
👻
Ghosted
|
cs.DS
|
4 |
3 years ago |
| 719 |
Simplex Range Searching Revisited: How to Shave Logs in Multi-Level Data Structures
Timothy M. Chan, Da Wei Zheng
|
👻
Ghosted
|
cs.CG
|
4 |
3 years ago |
| 720 |
Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours
François Dross, Krzysztof Fleszar, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
4 |
3 years ago |
| 721 |
Minimizing Completion Times for Stochastic Jobs via Batched Free Times
Anupam Gupta, Benjamin Moseley, Rudy Zhou
|
👻
Ghosted
|
cs.DS
|
4 |
3 years ago |
| 722 |
Approximate Distance Oracles for Planar Graphs with Subpolynomial Error Dependency
Hung Le
|
👻
Ghosted
|
cs.DS
|
4 |
4 years ago |
| 723 |
Highway Dimension: a Metric View
Andreas Emil Feldmann, Arnold Filtser
|
👻
Ghosted
|
cs.DS
|
3 |
1 year ago |
| 724 |
Sumsets, 3SUM, Subset Sum: Now for Real!
Nick Fischer
|
👻
Ghosted
|
cs.DS
|
3 |
1 year ago |
| 725 |
Beating Bellman's Algorithm for Subset Sum
Karl Bringmann, Nick Fischer, Vasileios Nakos
|
👻
Ghosted
|
cs.DS
|
3 |
1 year ago |
| 726 |
Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree
Charlie Carlson, Xiaoyu Chen, ... (+2 more)
|
🔮
The Ethereal
|
cs.DM
|
3 |
2 years ago |
| 727 |
Understanding Memory-Regret Trade-Off for Streaming Stochastic Multi-Armed Bandits
Yuchen He, Zichun Ye, Chihao Zhang
|
👻
Ghosted
|
cs.LG
|
3 |
2 years ago |
| 728 |
The Cost of Parallelizing Boosting
Xin Lyu, Hongxun Wu, Junzhao Yang
|
👻
Ghosted
|
cs.LG
|
3 |
2 years ago |
| 729 |
Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable
Sayan Bandyapadhyay, William Lochet, ... (+3 more)
|
👻
Ghosted
|
cs.CG
|
3 |
2 years ago |
| 730 |
Local Lipschitz Filters for Bounded-Range Functions with Applications to Arbitrary Real-Valued Functions
Jane Lange, Ephraim Linder, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
3 |
2 years ago |
| 731 |
Tight Lower Bound on Equivalence Testing in Conditional Sampling Model
Diptarka Chakraborty, Sourav Chakraborty, Gunjan Kumar
|
👻
Ghosted
|
cs.DS
|
3 |
2 years ago |
| 732 |
Grammar Boosting: A New Technique for Proving Lower Bounds for Computation over Compressed Data
Rajat De, Dominik Kempa
|
👻
Ghosted
|
cs.DS
|
3 |
3 years ago |
| 733 |
(Almost) Ruling Out SETH Lower Bounds for All-Pairs Max-Flow
Ohad Trabelsi
|
👻
Ghosted
|
cs.DS
|
3 |
3 years ago |
| 734 |
Non-Stochastic CDF Estimation Using Threshold Queries
Princewill Okoroafor, Vaishnavi Gupta, ... (+2 more)
|
👻
Ghosted
|
cs.LG
|
3 |
3 years ago |
| 735 |
Selectable Heaps and Optimal Lazy Search Trees
Bryce Sandlund, Lingyi Zhang
|
👻
Ghosted
|
cs.DS
|
3 |
5 years ago |
| 736 |
Polyhedral value iteration for discounted games and energy games
Alexander Kozachinskiy
|
👻
Ghosted
|
cs.DS
|
3 |
6 years ago |
| 737 |
Online Generalized Network Design Under (Dis)Economies of Scale
Viswanath Nagarajan, Lily Wang
|
👻
Ghosted
|
cs.DS
|
3 |
6 years ago |
| 738 |
Reconstruction under outliers for Fourier-sparse functions
Xue Chen, Anindya De
|
👻
Ghosted
|
cs.DS
|
3 |
7 years ago |
| 739 |
Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels
T-H. Hubert Chan, Zhibin Liang, ... (+2 more)
|
👻
Ghosted
|
cs.IT
|
3 |
6 years ago |
| 740 |
Maximum Integer Flows in Directed Planar Graphs with Multiple Sources and Sinks and Vertex Capacities
Yipu Wang
|
👻
Ghosted
|
cs.DS
|
3 |
8 years ago |
| 741 |
A new algorithm for fast generalized DFTs
Chloe Ching-Yun Hsu, Chris Umans
|
👻
Ghosted
|
cs.DS
|
3 |
9 years ago |
| 742 |
Nearly Tight Bounds for Sandpile Transience on the Grid
David Durfee, Matthew Fahrbach, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
3 |
9 years ago |
| 743 |
Approximation Algorithms for Finding Maximum Induced Expanders
Shayan Oveis Gharan, Alireza Rezaei
|
👻
Ghosted
|
cs.DS
|
3 |
10 years ago |
| 744 |
Online Min-Max Paging
Ashish Chiplunkar, Monika Henzinger, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
3 |
3 years ago |
| 745 |
Shortest Cycles With Monotone Submodular Costs
Fedor V. Fomin, Petr A. Golovach, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
3 |
3 years ago |
| 746 |
Query Complexity of the Metric Steiner Tree Problem
Yu Chen, Sanjeev Khanna, Zihan Tan
|
👻
Ghosted
|
cs.DS
|
3 |
3 years ago |
| 747 |
Approximate Trace Reconstruction from a Single Trace
Xi Chen, Anindya De, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
3 |
3 years ago |
| 748 |
Fast Discrepancy Minimization with Hereditary Guarantees
Kasper Green Larsen
|
👻
Ghosted
|
cs.DS
|
3 |
4 years ago |
| 749 |
Stronger 3SUM-Indexing Lower Bounds
Eldon Chung, Kasper Green Larsen
|
👻
Ghosted
|
cs.DS
|
3 |
4 years ago |
| 750 |
Beyond 2-approximation for k-Center in Graphs
Ce Jin, Yael Kirkpatrick, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
2 |
1 year ago |