| 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 |
| On Testability of First-Order Properties in Bounded-Degree Graphs
|
2021 |
Adler, Isolde |
| On Efficient Distance Approximation for Graph Properties
|
2021 |
Fiat, Nimrod |
| A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Privacy
|
2021 |
Dall'Agnol, Marcel |
| Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time
|
2021 |
Cslovjecsek, Jana |
| On Near-Linear-Time Algorithms for Dense Subset Sum
|
2021 |
Bringmann, Karl |
| A Fine-Grained Perspective on Approximating Subset Sum and Partition
|
2021 |
Bringmann, Karl |
| Graph Spanners by Sketching in Dynamic Streams and the Simultaneous Communication Model
|
2021 |
Filtser, Arnold |
| Randomized Cup Game Algorithms against Strong Adversaries
|
2021 |
Bender, Michael A. |
Tag hinzufügen