| Near-Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time
|
2022 |
Chepurko, Nadiia |
| Constructing Many Faces in Arrangements of Lines and Segments
|
2022 |
Wang, Haitao |
| Local Search for Weighted Tree Augmentation and Steiner Tree
|
2022 |
Traub, Vera |
| Better Lower Bounds for Shortcut Sets and Additive Spanners via an Improved Alternation Product
|
2022 |
Lu, Kevin |
| Co-evolution of Opinion and Social Tie Dynamics Towards Structural Balance
|
2022 |
Wang, Haotian |
| Dynamic Geometric Set Cover, Revisited
|
2022 |
Chan, Timothy M. |
| On the Fine-Grained Complexity of the Unbounded SubsetSum and the Frobenius Problem
|
2022 |
Klein, Kim-Manuel |
| Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution
|
2022 |
Bringmann, Karl |
| Simulating Random Walks in Random Streams
|
2022 |
Kallaugher, John |
| An Improved Analysis of Greedy for Online Steiner Forest
|
2022 |
Bamas, Etienne |
| Polynomial Integrality Gap of Flow LP for Directed Steiner Tree
|
2022 |
Li, Shi |
| Augmenting Edge Connectivity via Isolating Cuts
|
2022 |
Cen, Ruoxu |
| Optimal Sorting Circuits for Short Keys
|
2022 |
Lin, Wei-Kai |
| An Improved Algorithm for The k-Dyck Edit Distance Problem
|
2022 |
Fried, Dvir |
| Polygon Placement Revisited: (Degree of Freedom + 1)-SUM Hardness and an Improvement via Offline Dynamic Rectangle Union
|
2022 |
Künnemann, Marvin |
| Partially Optimal Edge Fault-Tolerant Spanners
|
2022 |
Bodwin, Greg |
| Algorithms Using Local Graph Features to Predict Epidemics
|
2022 |
Alimohammadi, Yeganeh |
| Incremental SSSP for Sparse Digraphs Beyond the Hopset Barrier
|
2022 |
Kyng, Rasmus |
| A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs
|
2022 |
Das, Debarati |
| New Trade-Offs for Fully Dynamic Matching via Hierarchical EDCS
|
2022 |
Behnezhad, Soheil |
Tag hinzufügen