| Rapid Mixing for Colorings via Spectral Independence
|
2021 |
Chen, Zongchen |
| New Planar P-time Computable Six-Vertex Models and a Complete Complexity Classification
|
2021 |
Cai, Jin-Yi |
| Rapid Mixing from Spectral Independence beyond the Boolean Domain
|
2021 |
Feng, Weiming |
| Query Strategies for Priced Information, Revisited
|
2021 |
Blanc, Guy |
| Fine-grained Hardness of CVP(P) — Everything that We can Prove (and Nothing Else)
|
2021 |
Aggarwal, Divesh |
| Space Lower Bounds for Approximating Maximum Matching in the Edge Arrival Model
|
2021 |
Kapralov, Michael |
| Streaming Submodular Matching Meets the Primal-Dual Method
|
2021 |
Levin, Roie |
| Asymptotic Dimension of Minor-Closed Families and Beyond
|
2021 |
Liu, Chun-Hung |
| Robust Algorithms for Online Convex Problems via Primal-Dual
|
2021 |
Molinaro, Marco |
| Being Fast Means Being Chatty: The Local Information Cost of Graph Spanners
|
2021 |
Robinson, Peter |
| Distributed Metropolis Sampler with Optimal Parallelism
|
2021 |
Feng, Weiming |
| Shorter Labels for Routing in Tree
|
2021 |
Gawrychowski, Pawel |
| Spectral Clustering Oracles in Sublinear Time
|
2021 |
Gluch, Grzegorz |
| Approximate Evaluation of First-Order Counting Queries
|
2021 |
Dreier, Jan |
| Fast Low-Space Algorithms for Subset Sum
|
2021 |
Jin, Ce |
| New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners
|
2021 |
Bergamaschi, Thiago |
| Tight Distributed Sketching Lower Bound for Connectivity
|
2021 |
Yu, Huacheng |
| Induced Subgraphs of Bounded Treewidth and the Container Method
|
2021 |
Abrishami, Tara |
| The Secretary Problem with Independent Sampling
|
2021 |
Correa, José |
| Online Multiserver Convex Chasing and Optimization
|
2021 |
Bubeck, Sébastien |
Tag hinzufügen