| The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability
|
2021 |
Bläsius, Thomas |
| Beating the Probabilistic Lower Bound on Perfect Hashing
|
2021 |
Xing, Chaoping |
| The Connectivity Threshold for Dense Graphs
|
2021 |
Gupta, Anupam |
| A Deterministic Parallel APSP Algorithm and its Applications
|
2021 |
Karczmarz, Adam |
| Optimal Girth Approximation for Dense Directed Graphs
|
2021 |
Chechik, Shiri |
| The Min-Cost Matching with Concave Delays Problem
|
2021 |
Azar, Yossi |
| Optimal Distribution-Free Sample-Based Testing of Subsequence-Freeness
|
2021 |
Ron, Dana |
| Optimal Inapproximability with Universal Factor Graphs
|
2021 |
Austrin, Per |
| Strongly Refuting all Semi-Random Boolean CSPs
|
2021 |
Abascal, Jackson |
| On the Mysteries of MAX NAE-SAT
|
2021 |
Brakensiek, Joshua |
| Solving Sparse Linear Systems Faster than Matrix Multiplication
|
2021 |
Peng, Richard |
| Polyhedral Value Iteration for Discounted Games and Energy Games
|
2021 |
Kozachinskiy, Alexander |
| Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier
|
2021 |
Assadi, Sepehr |
| Improving the Dilation of a Metric Graph by Adding Edges
|
2021 |
Gudmundsson, Joachim |
| Algorithms for Weighted Independent Transversals and Strong Colouring
|
2021 |
Graf, Alessandra |
| On Locating Paths in Compressed Tries
|
2021 |
Prezza, Nicola |
| Deterministic Replacement Path Covering
|
2021 |
Karthik, C. S. |
| An Improved Procedure for Colouring Graphs of Bounded Local Density
|
2021 |
Hurley, Eoin |
| Rolling Backwards can Move you Forward: On Embedding Problems in Sparse Expanders
|
2021 |
Draganié, Nemanja |
| Strong Connectivity Augmentation is FPT
|
2021 |
Klinkby, Kristine Vitting |
Tag hinzufügen