Abstract
In the bitprobe model the primary concern is the number of bits that must be probed in a data structure in order to answer queries, and how constraining the number probes affects the storage requirements. In this note we revisit an explicit membership scheme of Radhakrishnan, Raman, and Rao [ESA 2001], which stores an n=2 element subset of a universe [1,m], occupies O(m2/3) bits, and supports membership queries in t=2 bit probes. We show that, with a small modification to their storage scheme, their query scheme also works for n=3 elements.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
