| 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 |
| A Lower Bound for Dynamic Fractional Cascading
|
2021 |
Afshani, Peyman |
| Sorting Short Keys in Circuits of Size o(n log n)
|
2021 |
Asharov, Gilad |
| 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