Shachar Lovett, Ely Porat. A Lower Bound for Dynamic Approximate Membership Data Structures. In 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA. pages 797-804, IEEE Computer Society, 2010. [doi]
@inproceedings{LovettP10,
title = {A Lower Bound for Dynamic Approximate Membership Data Structures},
author = {Shachar Lovett and Ely Porat},
year = {2010},
doi = {10.1109/FOCS.2010.81},
url = {http://dx.doi.org/10.1109/FOCS.2010.81},
tags = {data-flow},
researchr = {https://researchr.org/publication/LovettP10},
cites = {0},
citedby = {0},
pages = {797-804},
booktitle = {51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA},
publisher = {IEEE Computer Society},
isbn = {978-0-7695-4244-7},
}