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/10297724. SIAM Journal on Computing 50.2 Web. doi:10.1137/20M1326040.
Huang, Dawei, Pettie, Seth, Zhang, Yixiang, & Zhang, Zhijun. The Communication Complexity of Set Intersection and Multiple Equality Testing. SIAM Journal on Computing, 50 (2). Retrieved from https://par.nsf.gov/biblio/10297724. https://doi.org/10.1137/20M1326040
Huang, Dawei, Pettie, Seth, Zhang, Yixiang, and Zhang, Zhijun.
"The Communication Complexity of Set Intersection and Multiple Equality Testing". SIAM Journal on Computing 50 (2). Country unknown/Code not available. https://doi.org/10.1137/20M1326040.https://par.nsf.gov/biblio/10297724.
@article{osti_10297724,
place = {Country unknown/Code not available},
title = {The Communication Complexity of Set Intersection and Multiple Equality Testing},
url = {https://par.nsf.gov/biblio/10297724},
DOI = {10.1137/20M1326040},
abstractNote = {},
journal = {SIAM Journal on Computing},
volume = {50},
number = {2},
author = {Huang, Dawei and Pettie, Seth and Zhang, Yixiang and Zhang, Zhijun},
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.