Deng, Chengyuan, Gao, Jie, Upadhyay, Jalaj, and Wang, Chen. Differentially Private Range Query on Shortest Paths. Retrieved from https://par.nsf.gov/biblio/10477647. Proceedings of Workshop on Algorithms and Data Structures .
Deng, Chengyuan, Gao, Jie, Upadhyay, Jalaj, & Wang, Chen. Differentially Private Range Query on Shortest Paths. Proceedings of Workshop on Algorithms and Data Structures, (). Retrieved from https://par.nsf.gov/biblio/10477647.
Deng, Chengyuan, Gao, Jie, Upadhyay, Jalaj, and Wang, Chen.
"Differentially Private Range Query on Shortest Paths". Proceedings of Workshop on Algorithms and Data Structures (). Country unknown/Code not available: Springer, Cham. https://par.nsf.gov/biblio/10477647.
@article{osti_10477647,
place = {Country unknown/Code not available},
title = {Differentially Private Range Query on Shortest Paths},
url = {https://par.nsf.gov/biblio/10477647},
abstractNote = {},
journal = {Proceedings of Workshop on Algorithms and Data Structures},
publisher = {Springer, Cham},
author = {Deng, Chengyuan and Gao, Jie and Upadhyay, Jalaj and Wang, Chen},
}
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.