English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

In this paper, we study two-bitprobe adaptive schemes storing five elements. For these class of schemes, the best known lower bound is \(\varOmega (m^{1/2})\) due to Alon and Feige [1]. Recently, it was proved by Kesh [9] that two-bitprobe adaptive schemes storing three elements will take at least \(\varOmega (m^{2/3})\) space, which also puts a lower bound on schemes storing five elements. In this work, we have improved the lower bound to \(\varOmega (m^{3/4})\). We also present a scheme for the same that takes \(\mathcal {O}(m^{5/6})\) space. This improves upon the \(\mathcal {O}(m^{18/19})\)-scheme due to Garg [7] and the \(\mathcal {O}(m^{10/11})\)-scheme due to Baig et al. [5].

Improved Bounds for Two Query Adaptive Bitprobe Schemes Storing Five Elements