Less hashing, same performance: Building a better Bloom filter (Q3522836): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W4243961364 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4836494 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Network Applications of Bloom Filters: A Survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5576559 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Model Checking Software / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Formal Methods in Computer-Aided Design / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Balls and bins: A study in negative dependence / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2744679 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3999066 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Less Hashing, Same Performance: Building a Better Bloom Filter / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: More analysis of double hashing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Compressed bloom filters / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Probability and Computing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2921747 / rank | |||
Normal rank |
Latest revision as of 15:05, 28 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Less hashing, same performance: Building a better Bloom filter |
scientific article |
Statements
Less hashing, same performance: Building a better Bloom filter (English)
0 references
4 September 2008
0 references
bloom filters
0 references
double hashing
0 references
Poisson convergence
0 references