| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Matching on the Line Admits No o(√log n)-Competitive Algorithm | Peserico, Enoch et al. | 2021 |
| 2 | Equivalence Classes and Conditional Hardness in Massively Parallel Computations | Nanongkai, Danupon et al. | 2020 |
| 3 | Communication Lower Bounds for Distributed-Memory Computations | Scquizzato, Michele et al. | 2014 |
| 4 | Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules | Antoniadis, Antonios et al. | 2014 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 4 |