| 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 |
| Atomic Power in Forks: A Super-Logarithmic Lower Bound for Implementing Butterfly Networks in the Nonatomic Binary Fork-Join Model
|
2021 |
Goodrich, Michael T. |
| Self-Stabilizing Clock Synchronization with 1-bit Messages
|
2021 |
Bastide, Paul |
| 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 |
| Rankwidth meets Stability
|
2021 |
Nesetril, Jaroslav |
| Peeling close to the orientability threshold - spatial coupling in hashing-based data structures
|
2021 |
Walzer, Stefan |
Tag hinzufügen