Breaking the linear-memory barrier in MPC: Fast MIS on trees with strongly sublinear memory

Sebastian Brandt 0002, Manuela Fischer, Jara Uitto. Breaking the linear-memory barrier in MPC: Fast MIS on trees with strongly sublinear memory. Theoretical Computer Science, 849:22-34, 2021. [doi]

@article{0002FU21,
  title = {Breaking the linear-memory barrier in MPC: Fast MIS on trees with strongly sublinear memory},
  author = {Sebastian Brandt 0002 and Manuela Fischer and Jara Uitto},
  year = {2021},
  doi = {10.1016/j.tcs.2020.10.007},
  url = {https://doi.org/10.1016/j.tcs.2020.10.007},
  researchr = {https://researchr.org/publication/0002FU21},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {849},
  pages = {22-34},
}