Skip to main navigation
Skip to search
Skip to main content
University of Copenhagen Research Portal Home
Help & FAQ
Dansk
English
Home
Profiles
Research output
Research units
Press/Media
Activities
Prizes
???studenttheses???
Datasets
Search by expertise, name or affiliation
Non-empty Bins with Simple Tabulation Hashing
Anders Aamand
,
Mikkel Thorup
Department of Computer Science
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Non-empty Bins with Simple Tabulation Hashing'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Hashing
100%
Tabulation Hashing
100%
False Positive Rate
66%
Random Hashing
66%
Hash Function
33%
Concentration Bounds
33%
Lower Order Terms
33%
Computer Science
Hashing
100%
False Positive
33%
Bloom Filter
33%
Hash Function
16%
Mathematics
Positive Probability
100%