License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2018.12
URN: urn:nbn:de:0030-drops-99110
URL: http://drops.dagstuhl.de/opus/volltexte/2018/9911/
Go to the corresponding LIPIcs Volume Portal


Kesh, Deepanjan

Space Complexity of Two Adaptive Bitprobe Schemes Storing Three Elements

pdf-format:
LIPIcs-FSTTCS-2018-12.pdf (0.4 MB)


Abstract

We consider the following set membership problem in the bitprobe model - that of storing subsets of size at most three from a universe of size m, and answering membership queries using two adaptive bitprobes. Baig and Kesh [Mirza Galib Anwarul Husain Baig and Deepanjan Kesh, 2018] proposed a scheme for the problem which takes O(m^{2/3}) space. In this paper, we present a proof which shows that any scheme for the problem requires Omega(m^{2/3}) amount of space. These two results together settle the space complexity issue for this particular problem.

BibTeX - Entry

@InProceedings{kesh:LIPIcs:2018:9911,
  author =	{Deepanjan Kesh},
  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 =	{Sumit Ganguly and Paritosh Pandya},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9911},
  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}
}

Keywords: Data structures, set membership problem, bitprobe model, lower bound
Seminar: 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)
Issue Date: 2018
Date of publication: 23.11.2018


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI