Preparing for Disaster-Reference-Cited by-同舟云学术

Preparing for Disaster

Published:2022-07-11 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Newport Calvin¹,Vaidya Nitin¹,Weaver Alex¹

Affiliation:

1. Georgetown University, Washington, D.C., DC, USA

Funder

NSF (National Science Foundation)

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3490148.3538564

Reference20 articles.

1. Alkida Balliu , Sebastian Brandt , Juho Hirvonen , Dennis Olivetti , Mikaël Rabie , and Jukka Suomela . 2019 . Lower Bounds for Maximal Matchings and Maximal Independent Sets. In 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019 , Baltimore, Maryland, USA, November 9--12 , 2019, David Zuckerman (Ed.). IEEE Computer Society, USA, 481--497. Alkida Balliu, Sebastian Brandt, Juho Hirvonen, Dennis Olivetti, Mikaël Rabie, and Jukka Suomela. 2019. Lower Bounds for Maximal Matchings and Maximal Independent Sets. In 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9--12, 2019, David Zuckerman (Ed.). IEEE Computer Society, USA, 481--497.

2. Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition

3. Distributed $(\Delta+1)$-Coloring in Linear (in $\Delta$) Time

4. The Locality of Distributed Symmetry Breaking

5. Guy Blelloch Jeremy Fineman and Julian Shun. 2012. Greedy Sequential Maximal Independent Set and Matching are Parallel on Average. arXiv:1202.3205 [cs.DS] Guy Blelloch Jeremy Fineman and Julian Shun. 2012. Greedy Sequential Maximal Independent Set and Matching are Parallel on Average. arXiv:1202.3205 [cs.DS]