| No. |
Title |
Author |
Year |
| 1 |
An Algorithmic Approach to Address Course Enrollment Challenges |
Biswas, Arpita et al. |
2023 |
| 2 |
Scalable Auction Algorithms for Bipartite Maximum Matching Problems |
Liu, Quanquan C. et al. |
2023 |
| 3 |
Triangle Counting with Local Edge Differential Privacy |
Eden, Talya et al. |
2023 |
| 4 |
Massively Parallel Algorithms for Small Subgraph Counting |
Biswas, Amartya Shankha et al. |
2022 |
| 5 |
Near-Optimal Distributed Implementations of Dynamic Algorithms for Symmetry Breaking Problems |
Antaki, Shiri et al. |
2022 |
| 6 |
Scheduling with Communication Delay in Near-Linear Time |
Liu, Quanquan C. et al. |
2022 |
| 7 |
The Power of Random Symmetry-Breaking in Nakamoto Consensus |
Su, Lili et al. |
2021 |
| 8 |
Tatamibari Is NP-Complete |
Adler, Aviv et al. |
2020 |
| 9 |
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class |
Demaine, Erik D. et al. |
2019 |
| 10 |
Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy |
Demaine, Erik D. et al. |
2018 |
