| 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. |
| The Expander Hierarchy and its Applications to Dynamic Graph Algorithms
|
2021 |
Goranci, Gramoz |
| 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 |
| Rapid Mixing for Colorings via Spectral Independence
|
2021 |
Chen, Zongchen |
Tag hinzufügen