| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs | Eden, Talya et al. | 2022 |
| 2 | Packet Forwarding with a Locally Bursty Adversary | Rosenbaum, Will | 2022 |
| 3 | The Arboricity Captures the Complexity of Sampling Edges | Eden, Talya et al. | 2019 |
| 4 | Lower Bounds for Approximating Graph Parameters via Communication Complexity | Eden, Talya et al. | 2018 |
| 5 | On Sampling Edges Almost Uniformly | Eden, Talya et al. | 2018 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 5 |