Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Sodani, Chirag"'
In this paper, we look into the adaptive bitprobe model that stores subsets of size at most four from a universe of size m, and answers membership queries using two bitprobes. We propose a scheme that stores arbitrary subsets of size four using O(m^{
Externí odkaz:
http://arxiv.org/abs/1812.04802
We are studying the adaptive bitprobe model to store an arbitrary subset S of size at most five from a universe U of size m and answer the membership queries of the form "Is x in S?" in two bitprobes. In this paper, we present a data structure for th
Externí odkaz:
http://arxiv.org/abs/1810.13331
Publikováno v:
In Discrete Applied Mathematics 15 October 2022 319:121-131
