@InProceedings{kesh:LIPIcs.FSTTCS.2018.12, author = {Kesh, Deepanjan}, title = {{Space Complexity of Two Adaptive Bitprobe Schemes Storing Three Elements}}, booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)}, pages = {12:1--12:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-093-4}, ISSN = {1868-8969}, year = {2018}, volume = {122}, editor = {Ganguly, Sumit and Pandya, Paritosh}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.12}, URN = {urn:nbn:de:0030-drops-99110}, doi = {10.4230/LIPIcs.FSTTCS.2018.12}, annote = {Keywords: Data structures, set membership problem, bitprobe model, lower bound} }