Abo-Khamis, M., Im, S., Moseley, B., Pruhs, K., and Samadian, A. Approximate Aggregate Queries Under Additive Inequalities. Retrieved from https://par.nsf.gov/biblio/10238784. Symposium on Algorithmic Principles of Computer Systems (APOCS) . Web. doi:10.1137/1.9781611976489.7.
Abo-Khamis, M., Im, S., Moseley, B., Pruhs, K., & Samadian, A. Approximate Aggregate Queries Under Additive Inequalities. Symposium on Algorithmic Principles of Computer Systems (APOCS), (). Retrieved from https://par.nsf.gov/biblio/10238784. https://doi.org/10.1137/1.9781611976489.7
Abo-Khamis, M., Im, S., Moseley, B., Pruhs, K., and Samadian, A.
"Approximate Aggregate Queries Under Additive Inequalities". Symposium on Algorithmic Principles of Computer Systems (APOCS) (). Country unknown/Code not available. https://doi.org/10.1137/1.9781611976489.7.https://par.nsf.gov/biblio/10238784.
@article{osti_10238784,
place = {Country unknown/Code not available},
title = {Approximate Aggregate Queries Under Additive Inequalities},
url = {https://par.nsf.gov/biblio/10238784},
DOI = {10.1137/1.9781611976489.7},
abstractNote = {},
journal = {Symposium on Algorithmic Principles of Computer Systems (APOCS)},
author = {Abo-Khamis, M. and Im, S. and Moseley, B. and Pruhs, K. and Samadian, A.},
}
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.