No. Title Author Year
1 Massively Parallel Algorithms for Small Subgraph Counting Biswas, Amartya Shankha et al. 2022
2 Near-Optimal Distributed Implementations of Dynamic Algorithms for Symmetry Breaking Problems Antaki, Shiri et al. 2022
3 Scheduling with Communication Delay in Near-Linear Time Liu, Quanquan C. et al. 2022
4 The Power of Random Symmetry-Breaking in Nakamoto Consensus Su, Lili et al. 2021
5 Tatamibari Is NP-Complete Adler, Aviv et al. 2020
6 Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class Demaine, Erik D. et al. 2019
7 Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy Demaine, Erik D. et al. 2018
Current Page :
Number of result pages: 1
Number of documents: 7

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI