He, Xiaoyu, and Li, Ray. Approximating Binary Longest Common Subsequence in Almost-Linear Time. Retrieved from https://par.nsf.gov/biblio/10444898. Approximating Binary Longest Common Subsequence in Almost-Linear Time . Web. doi:10.1145/3564246.3585104.
He, Xiaoyu, & Li, Ray. Approximating Binary Longest Common Subsequence in Almost-Linear Time. Approximating Binary Longest Common Subsequence in Almost-Linear Time, (). Retrieved from https://par.nsf.gov/biblio/10444898. https://doi.org/10.1145/3564246.3585104
@article{osti_10444898,
place = {Country unknown/Code not available},
title = {Approximating Binary Longest Common Subsequence in Almost-Linear Time},
url = {https://par.nsf.gov/biblio/10444898},
DOI = {10.1145/3564246.3585104},
abstractNote = {},
journal = {Approximating Binary Longest Common Subsequence in Almost-Linear Time},
author = {He, Xiaoyu and Li, Ray},
}
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.