| 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 |
| An FPTAS for the Square Lattice Six-Vertex and Eight-Vertex Models at Low Temperatures
|
2021 |
Cai, Jin-Yi |
| A Faster Exponential Time Algorithm for Bin Packing with a Constant Number of Bins via Additive Combinatories
|
2021 |
Nederlof, Jesper |
| Optimal Discretization is Fixed-parameter Tractable
|
2021 |
Kratsch, Stefan |
| On Two-Handed Planar Assembly Partitioning with Connectivity Constraints
|
2021 |
Agarwal, Pankaj K. |
| Improved Sublinear Time Algorithm for Longest Increasing Subsequence
|
2021 |
Mitzenmacher, Michael |
| Approximating Pathwidth for Graphs of Small a Treewidth
|
2021 |
Groenland, Carla |
| Twin-Width IT: Small Classes
|
2021 |
Bonnet, Edouard |
| Constrained-Order Prophet Inequalities
|
2021 |
Arsenis, Makis |
Tag hinzufügen