| 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 |
| 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 |
| 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 |
| Optimal Oblivious Parallel RAM
|
2022 |
Asharov, Gilad |
| How Many Clusters? - An Algorithmic Answer
|
2022 |
Bhattacharyya, Chiranjib |
| Approximating Fair Clustering with Cascaded Norm Objectives
|
2022 |
Chlamtáè, Eden |
| Computing Lewis Weights to High Precision
|
2022 |
Fazel, Maryam |
Tag hinzufügen