Azarderakhsh, Reza, Biasse, Jean-François, El Khatib, Rami, Langenberg, Brandon, and Pring, Benjamin. Parallelism strategies for the tuneable golden-claw finding problem. Retrieved from https://par.nsf.gov/biblio/10271682. International Journal of Computer Mathematics: Computer Systems Theory . Web. doi:10.1080/23799927.2021.1884605.
Azarderakhsh, Reza, Biasse, Jean-François, El Khatib, Rami, Langenberg, Brandon, & Pring, Benjamin. Parallelism strategies for the tuneable golden-claw finding problem. International Journal of Computer Mathematics: Computer Systems Theory, (). Retrieved from https://par.nsf.gov/biblio/10271682. https://doi.org/10.1080/23799927.2021.1884605
Azarderakhsh, Reza, Biasse, Jean-François, El Khatib, Rami, Langenberg, Brandon, and Pring, Benjamin.
"Parallelism strategies for the tuneable golden-claw finding problem". International Journal of Computer Mathematics: Computer Systems Theory (). Country unknown/Code not available. https://doi.org/10.1080/23799927.2021.1884605.https://par.nsf.gov/biblio/10271682.
@article{osti_10271682,
place = {Country unknown/Code not available},
title = {Parallelism strategies for the tuneable golden-claw finding problem},
url = {https://par.nsf.gov/biblio/10271682},
DOI = {10.1080/23799927.2021.1884605},
abstractNote = {},
journal = {International Journal of Computer Mathematics: Computer Systems Theory},
author = {Azarderakhsh, Reza and Biasse, Jean-François and El Khatib, Rami and Langenberg, Brandon and Pring, Benjamin},
editor = {null}
}
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.