Huang, Dawei, Pettie, Seth, Zhang, Yixiang, and Zhang, Zhijun. The Communication Complexity of Set Intersection and Multiple Equality Testing. Retrieved from https://par.nsf.gov/biblio/10158626. Proceedings of the Annual ACMSIAM Symposium on Discrete Algorithms . Web. doi:10.1137/1.9781611975994.105.
Huang, Dawei, Pettie, Seth, Zhang, Yixiang, & Zhang, Zhijun. The Communication Complexity of Set Intersection and Multiple Equality Testing. Proceedings of the Annual ACMSIAM Symposium on Discrete Algorithms, (). Retrieved from https://par.nsf.gov/biblio/10158626. https://doi.org/10.1137/1.9781611975994.105
Huang, Dawei, Pettie, Seth, Zhang, Yixiang, and Zhang, Zhijun.
"The Communication Complexity of Set Intersection and Multiple Equality Testing". Proceedings of the Annual ACMSIAM Symposium on Discrete Algorithms (). Country unknown/Code not available. https://doi.org/10.1137/1.9781611975994.105.https://par.nsf.gov/biblio/10158626.
@article{osti_10158626,
place = {Country unknown/Code not available},
title = {The Communication Complexity of Set Intersection and Multiple Equality Testing},
url = {https://par.nsf.gov/biblio/10158626},
DOI = {10.1137/1.9781611975994.105},
abstractNote = {},
journal = {Proceedings of the Annual ACMSIAM Symposium on Discrete Algorithms},
author = {Huang, Dawei and Pettie, Seth and Zhang, Yixiang and Zhang, Zhijun},
}
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.