Breaking the linear-memory barrier in MPC: fast MIS on trees with strongly sublinear memory
From MaRDI portal
Publication:2303285
DOI10.1007/978-3-030-24922-9_9OpenAlexW2961443933MaRDI QIDQ2303285
Manuela Fischer, Jara Uitto, Sebastian F. Brandt
Publication date: 3 March 2020
Full work available at URL: https://arxiv.org/abs/1802.06748
Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx)
Related Items (4)
Time-optimal construction of overlay networks ⋮ Breaking the linear-memory barrier in \(\mathsf{MPC}\): fast \(\mathsf{MIS}\) on trees with strongly sublinear memory ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication: Breaking the linear-memory barrier in MPC: fast MIS on trees with strongly sublinear memory
