Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Universal_hashing> ?p ?o. }
Showing items 1 to 35 of
35
with 100 items per page.
- Universal_hashing abstract "Using universal hashing (in a randomized algorithm or data structure) refers to selecting a hash function at random from a family of hash functions with a certain mathematical property (see definition below). This guarantees a low number of collisions in expectation, even if the data is chosen by an adversary. Many universal families are known (for hashing integers, vectors, strings), and their evaluation is often very efficient. Universal hashing has numerous uses in computer science, for example in implementations of hash tables, randomized algorithms, and cryptography.".
- Universal_hashing wikiPageExternalLink SECTION00811000000000000000.
- Universal_hashing wikiPageID "4024666".
- Universal_hashing wikiPageRevisionID "594988068".
- Universal_hashing hasPhotoCollection Universal_hashing.
- Universal_hashing subject Category:Computational_complexity_theory.
- Universal_hashing subject Category:Cryptographic_hash_functions.
- Universal_hashing subject Category:Hashing.
- Universal_hashing subject Category:Search_algorithms.
- Universal_hashing type Abstraction100002137.
- Universal_hashing type Act100030358.
- Universal_hashing type Activity100407535.
- Universal_hashing type Algorithm105847438.
- Universal_hashing type CryptographicHashFunctions.
- Universal_hashing type Event100029378.
- Universal_hashing type Function113783816.
- Universal_hashing type MathematicalRelation113783581.
- Universal_hashing type Procedure101023820.
- Universal_hashing type PsychologicalFeature100023100.
- Universal_hashing type Relation100031921.
- Universal_hashing type Rule105846932.
- Universal_hashing type SearchAlgorithms.
- Universal_hashing type YagoPermanentlyLocatedEntity.
- Universal_hashing comment "Using universal hashing (in a randomized algorithm or data structure) refers to selecting a hash function at random from a family of hash functions with a certain mathematical property (see definition below). This guarantees a low number of collisions in expectation, even if the data is chosen by an adversary. Many universal families are known (for hashing integers, vectors, strings), and their evaluation is often very efficient.".
- Universal_hashing label "Universal hashing".
- Universal_hashing label "Universelle Hash-Funktion".
- Universal_hashing label "完美散列".
- Universal_hashing sameAs Universelle_Hash-Funktion.
- Universal_hashing sameAs 유니버설_해싱.
- Universal_hashing sameAs m.0bd2ds.
- Universal_hashing sameAs Q846912.
- Universal_hashing sameAs Q846912.
- Universal_hashing sameAs Universal_hashing.
- Universal_hashing wasDerivedFrom Universal_hashing?oldid=594988068.
- Universal_hashing isPrimaryTopicOf Universal_hashing.