Cohen, Gil, Haeupler, Bernhard, and Schulman, Leonard J. Explicit binary tree codes with polylogarithmic size alphabet. Retrieved from https://par.nsf.gov/biblio/10088820. ACM Symposium on Theory of Computing . Web. doi:10.1145/3188745.3188928.
Cohen, Gil, Haeupler, Bernhard, & Schulman, Leonard J. Explicit binary tree codes with polylogarithmic size alphabet. ACM Symposium on Theory of Computing, (). Retrieved from https://par.nsf.gov/biblio/10088820. https://doi.org/10.1145/3188745.3188928
@article{osti_10088820,
place = {Country unknown/Code not available},
title = {Explicit binary tree codes with polylogarithmic size alphabet},
url = {https://par.nsf.gov/biblio/10088820},
DOI = {10.1145/3188745.3188928},
abstractNote = {},
journal = {ACM Symposium on Theory of Computing},
author = {Cohen, Gil and Haeupler, Bernhard and Schulman, Leonard J.},
}
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.