Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Two new schemes in the bitprobe model

From MaRDI portal
Publication:1641098
Jump to:navigation, search

DOI10.1007/978-3-319-75172-6_7zbMath1498.68085OpenAlexW2791631138MaRDI QIDQ1641098

Deepanjan Kesh, Mirza Galib Anwarul Husain Baig

Publication date: 15 June 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-75172-6_7



Mathematics Subject Classification ID

Data structures (68P05)


Related Items (7)

Storing four elements in the two query bitprobe model ⋮ Lower bounds for restricted schemes in the two-adaptive bitprobe model ⋮ Revisiting explicit adaptive two-probe schemes ⋮ Two improved schemes in the bitprobe model ⋮ Improved bounds for two query adaptive bitprobe schemes storing five elements ⋮ Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes ⋮ Space Complexity of Two Adaptive Bitprobe Schemes Storing Three Elements




This page was built for publication: Two new schemes in the bitprobe model

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1641098&oldid=13955466"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 04:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki