The NSF Public Access Repository (NSF-PAR) system and access will be unavailable from 11:00 PM ET on Friday, September 13 until 2:00 AM ET on Saturday, September 14 due to maintenance. We apologize for the inconvenience.
Ghaffari, Mohsen, and Haeupler, Bernhard. A Time-Optimal Randomized Parallel Algorithm for MIS. Retrieved from https://par.nsf.gov/biblio/10214011. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) .
Ghaffari, Mohsen, & Haeupler, Bernhard. A Time-Optimal Randomized Parallel Algorithm for MIS. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), (). Retrieved from https://par.nsf.gov/biblio/10214011.
Ghaffari, Mohsen, and Haeupler, Bernhard.
"A Time-Optimal Randomized Parallel Algorithm for MIS". Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) (). Country unknown/Code not available. https://par.nsf.gov/biblio/10214011.
Warning: Leaving National Science Foundation Website
You are now leaving the National Science Foundation website to go to a non-government website.
Website:
NSF takes no responsibility for and exercises no control over the views expressed or the accuracy of
the information contained on this site. Also be aware that NSF's privacy policy does not apply to this site.