Document Search Results

Aggarwal, Sreshth; Kesh, Deepanjan; Singal, Divyam

Lower bounds for restricted schemes in the two-adaptive bitprobe model. (English) Zbl 1499.68072

Bazgan, Cristina (ed.) et al., Combinatorial algorithms. 33rd international workshop, IWOCA 2022, Trier, Germany, June 7–9, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13270, 31-45 (2022).

MSC: 68P05 68Q17

Cite Review PDF

Full Text: DOI arXiv

Kesh, Deepanjan; Sharma, Vidya Sagar

On the bitprobe complexity of two probe adaptive schemes. (English) Zbl 1522.68173

Discrete Appl. Math. 319, 132-140 (2022).

MSC: 68P05 68Q17

Cite Review PDF

Full Text: DOI

Baig, Mirza Galib Anwarul Husain; Kesh, Deepanjan; Sodani, Chirag

Storing four elements in the two query bitprobe model. (English) Zbl 1498.68086

Discrete Appl. Math. 319, 121-131 (2022).

MSC: 68P05

Cite Review PDF

Full Text: DOI

Dey, Palash; Radhakrishnan, Jaikumar; Velusamy, Santhoshini

Improved explicit data structures in the bit-probe model using error-correcting codes. (English) Zbl 07559399

Esparza, Javier (ed.) et al., 45th international symposium on mathematical foundations of computer science, MFCS 2020, August 25–26, 2020, Prague, Czech Republic. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 170, Article 28, 12 p. (2020).

MSC: 68Qxx

Cite Review PDF

Full Text: DOI

Baig, Mirza Galib Anwarul Husain; Kesh, Deepanjan

Improved bounds for two query adaptive bitprobe schemes storing five elements. (English) Zbl 1453.68061

Theor. Comput. Sci. 838, 208-230 (2020).

MSC: 68P05

Cite Review PDF

Full Text: DOI arXiv

Baig, Mirza Galib Anwarul Husain; Kesh, Deepanjan

Two improved schemes in the bitprobe model. (English) Zbl 1436.68080

Theor. Comput. Sci. 806, 543-552 (2020).

MSC: 68P05

Cite Review PDF

Full Text: DOI

Baig, Mirza Galib Anwarul Husain; Kesh, Deepanjan; Sodani, Chirag

An improved scheme in the two query adaptive bitprobe model. (English) Zbl 1436.68081

Colbourn, Charles J. (ed.) et al., Combinatorial algorithms. 30th international workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11638, 22-34 (2019).

MSC: 68P05

Cite Review PDF

Full Text: DOI arXiv

Baig, Mirza Galib Anwarul Husain; Kesh, Deepanjan; Sodani, Chirag

A two query adaptive bitprobe scheme storing five elements. (English) Zbl 1434.68119

Das, Gautam K. (ed.) et al., WALCOM: algorithms and computation. 13th international conference, WALCOM 2019, Guwahati, India, February 27 – March 2, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11355, 317-328 (2019).

MSC: 68P05

Cite Review PDF

Full Text: DOI arXiv

Kesh, Deepanjan; Sharma, Vidya Sagar

On the bitprobe complexity of two probe adaptive schemes storing two elements. (English) Zbl 1502.68099

Pal, Sudebkumar Prasant (ed.) et al., Algorithms and discrete applied mathematics. 5th international conference, CALDAM 2019, Kharagpur, India, February 14–16, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11394, 53-64 (2019).

MSC: 68P05 68Q17

Cite Review PDF

Full Text: DOI

Nicholson, Patrick K.

Revisiting explicit adaptive two-probe schemes. (English) Zbl 1437.68045

Inf. Process. Lett. 143, 1-3 (2019).

MSC: 68P05

Cite Review PDF

Full Text: DOI

Kesh, Deepanjan

Space complexity of two adaptive bitprobe schemes storing three elements. (English) Zbl 1528.68093

Ganguly, Sumit (ed.) et al., 38th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2018, Ahmedabad, India, December 11–13, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 122, Article 12, 12 p. (2018).

MSC: 68P05

Cite Review PDF

Full Text: DOI

Baig, Mirza Galib Anwarul Husain; Kesh, Deepanjan

Two new schemes in the bitprobe model. (English) Zbl 1498.68085

Rahman, M. Sohel (ed.) et al., WALCOM: algorithms and computation. 12th international conference, WALCOM 2018, Dhaka, Bangladesh, March 3–5, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10755, 68-79 (2018).

MSC: 68P05

Cite Review PDF

Full Text: DOI

Kesh, Deepanjan

On adaptive bitprobe schemes for storing two elements. (English) Zbl 1470.68039

Gao, Xiaofeng (ed.) et al., Combinatorial optimization and applications. 11th international conference, COCOA 2017, Shanghai, China, December 16–18, 2017. Proceedings. Part I. Cham: Springer. Lect. Notes Comput. Sci. 10627, 471-479 (2017).

MSC: 68P05

Cite Review PDF

Full Text: DOI

Howard, David

Determining membership with 2 simultaneous queries. (English) Zbl 1360.68392

Theor. Comput. Sci. 543, 112-119 (2014).

MSC: 68P10 68P20 91A12

Cite Review PDF

Full Text: DOI

Nicholson, Patrick K.; Raman, Venkatesh; Rao, S. Srinivasa

A survey of data structures in the bitprobe model. (English) Zbl 1395.68103

Brodnik, Andrej (ed.) et al., Space-efficient data structures, streams, and algorithms. Papers in honor of J. Ian Munro on the occasion of his 66th birthday. Berlin: Springer (ISBN 978-3-642-40272-2/pbk). Lecture Notes in Computer Science 8066, 303-318 (2013).

MSC: 68P05

Cite Review PDF

Full Text: DOI

Rahman, M. Ziaur; Munro, J. Ian

Integer representation and counting in the bit probe model. (English) Zbl 1187.68015

Algorithmica 56, No. 1, 105-127 (2010).

MSC: 68M07 68P05

Cite Review PDF

Full Text: DOI

Rahman, M. Ziaur; Munro, J. Ian

Integer representation and counting in the bit probe model. (English) Zbl 1193.68091

Tokuyama, Takeshi (ed.), Algorithms and computation. 18th international symposium, ISAAC 2007, Sendai, Japan, December 17–19, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-77118-0/pbk). Lecture Notes in Computer Science 4835, 5-16 (2007).

MSC: 68P05 68Q05 68Q17

Cite Review PDF

Full Text: DOI

Gál, Anna; Miltersen, Peter Bro

The cell probe complexity of succinct data structures. (English) Zbl 1152.68428

Theor. Comput. Sci. 379, No. 3, 405-417 (2007).

MSC: 68P05

Cite Review PDF

Full Text: DOI Link

Found 18 Documents (Results 1–18)

Lower bounds for restricted schemes in the two-adaptive bitprobe model. (English) Zbl 1499.68072

On the bitprobe complexity of two probe adaptive schemes. (English) Zbl 1522.68173

Storing four elements in the two query bitprobe model. (English) Zbl 1498.68086

Improved explicit data structures in the bit-probe model using error-correcting codes. (English) Zbl 07559399

Improved bounds for two query adaptive bitprobe schemes storing five elements. (English) Zbl 1453.68061

Two improved schemes in the bitprobe model. (English) Zbl 1436.68080

An improved scheme in the two query adaptive bitprobe model. (English) Zbl 1436.68081

A two query adaptive bitprobe scheme storing five elements. (English) Zbl 1434.68119

On the bitprobe complexity of two probe adaptive schemes storing two elements. (English) Zbl 1502.68099

Revisiting explicit adaptive two-probe schemes. (English) Zbl 1437.68045

Space complexity of two adaptive bitprobe schemes storing three elements. (English) Zbl 1528.68093

Two new schemes in the bitprobe model. (English) Zbl 1498.68085

On adaptive bitprobe schemes for storing two elements. (English) Zbl 1470.68039

Determining membership with 2 simultaneous queries. (English) Zbl 1360.68392

A survey of data structures in the bitprobe model. (English) Zbl 1395.68103

Integer representation and counting in the bit probe model. (English) Zbl 1187.68015

Integer representation and counting in the bit probe model. (English) Zbl 1193.68091

The cell probe complexity of succinct data structures. (English) Zbl 1152.68428

Filter Results by …

Document Type

Author

Serial

Year of Publication

Main Field