Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Kesh, Deepanjan"'
In the adaptive bitprobe model answering membership queries in two bitprobes, we consider the class of restricted schemes as introduced by Kesh and Sharma (Discrete Applied Mathematics 2021). In that paper, the authors showed that such restricted sch
Externí odkaz:
http://arxiv.org/abs/2204.03266
In this paper, we study two-bitprobe adaptive schemes storing five elements. For these class of schemes, the best known lower bound is m^{1/2} due to Alon and Feige [SODA 2009]. Recently, it was proved by Kesh [FSTTCS 2018] that two-bitprobe adaptive
Externí odkaz:
http://arxiv.org/abs/1910.03651
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
Autor:
Kesh, Deepanjan, Sharma, Vidya Sagar
Publikováno v:
In Discrete Applied Mathematics 15 October 2022 319:132-140
Publikováno v:
In Discrete Applied Mathematics 15 October 2022 319:121-131
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Kesh, Deepanjan
We consider the following set membership problem in the bitprobe model - that of storing subsets of size at most three from a universe of size m, and answering membership queries using two adaptive bitprobes. Baig and Kesh [Mirza Galib Anwarul Husain
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::489995c7bcac7b5fb7eae3b01bd8bad4
Autor:
Kesh, Deepanjan, Mehta, Shashank K.
Publikováno v:
LATIN 2014: Theoretical Informatics; 2014, p648-659, 12p