| On the Complexity of Binary Polynomial Optimization Over Acyclic Hypergraphs
|
2022 |
Pia, Alberto Del |
| Congruency-Constrained TU Problems Beyond the Bimodular Case
|
2022 |
Nägele, Martin |
| Approximating the Arboricity in Sublinear Time
|
2022 |
Eden, Talya |
| Distributed Zero-Knowledge Proofs Over Networks
|
2022 |
Bick, Aviv |
| Improved Algorithms for Low Rank Approximation from Sparsity
|
2022 |
Woodruff, David P. |
| Near-Optimal Explainable k-Means for All Dimensions
|
2022 |
Charikar, Moses |
| Almost Tight Approximation Algorithms for Explainable Clustering
|
2022 |
Esfandiari, Hossein |
| On Finding Exact Solutions of Linear Programs in the Oracle Model
|
2022 |
Dadush, Daniel |
| Pattern Matching on Grammar-Compressed Strings in Linear Time
|
2022 |
Ganardi, Moses |
| How Compression and Approximation Affect Efficiency in String Distance Measures
|
2022 |
Ganesh, Arun |
| An Upper Bound and Linear-Space Queries on the LZ-End Parsing
|
2022 |
Kempa, Dominik |
| Metric Distortion Bounds for Randomized Social Choice
|
2022 |
Charikar, Moses |
| Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based ℓ1-Oblivious Routing
|
2022 |
Zuzic, Goran |
| Near-Optimal Quantum Algorithms for String Problems
|
2022 |
Akmal, Shyan |
| Private Interdependent Valuations
|
2022 |
Eden, Alon |
| Improved Sliding Window Algorithms for Clustering and Coverage via Bucketing-Based Sketches
|
2022 |
Epasto, Alessandro |
| Polynomial Time Algorithms to Find an Approximate Competitive Equilibrium for Chores
|
2022 |
Boodaghians, Shant |
| Better Sum Estimation via Weighted Sampling
|
2022 |
Beretta, Lorenzo |
| Approximating Sumset Size
|
2022 |
De, Anindya |
| Limits of Preprocessing for Single-Server PIR
|
2022 |
Persiano, Giuseppe |
Tag hinzufügen