Are bitvectors optimal?
Cached
Download Links
- [www.cs.uvic.ca]
- [www.brics.dk]
- [www.brics.aau.dk]
- DBLP
Other Repositories/Bibliography
by
H. Buhrman
,
P. B. Miltersen
,
J. Radhakrishnan
,
S. Venkatesh
| Citations: | 49 - 7 self |
BibTeX
@MISC{Buhrman_arebitvectors,
author = {H. Buhrman and P. B. Miltersen and J. Radhakrishnan and S. Venkatesh},
title = {Are bitvectors optimal?},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
... We show lower bounds that come close to our upper bounds (for a large range of n and ffl): Schemes that answer queries with just one bitprobe and error probability ffl must use \Omega ( nffl log(1=ffl) log m) bits of storage; if the error is restricted to queries not in S, then the scheme must use \Omega ( n2ffl2 log(n=ffl) log m) bits of storage. We also
