On the bitprobe complexity of two probe adaptive schemes storing two elements

DOI10.1007/978-3-030-11509-8_5zbMath1502.68099OpenAlexW2910252852MaRDI QIDQ2326565

Deepanjan Kesh, Vidya Sagar Sharma

Publication date: 10 October 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-11509-8_5

zbMATH Keywords

data structureslower boundadaptive schemebitprobe model

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)

Related Items (2)

On the bitprobe complexity of two probe adaptive schemes ⋮ Lower bounds for restricted schemes in the two-adaptive bitprobe model

This page was built for publication: On the bitprobe complexity of two probe adaptive schemes storing two elements