Double hashing
flowchart AA["Associated Authors (0)"] C[Double hashing] BC["Broader Concepts (2)"] NC["Narrower Concepts (13)"] C== skos:broader ==>BC NC== skos:broader ==>C AA== dcterms:relation ==>C click BC "#broader-concepts" click NC "#narrower-concepts" click AA "#associated-authors" NI["add incoming edge"] NO["add outgoing edge"] NI-- ? -->C C-- ? -->NO click NI "#add-incoming-edge" click NO "#add-outgoing-edge" style NI stroke-width:2px,stroke-dasharray: 5 5 style NO stroke-width:2px,stroke-dasharray: 5 5
- Wikidata
- https://www.wikidata.org/wiki/Q478351
- OpenAlex ID
- https://openalex.org/C138111711 (API record)
- OpenAlex Description
- collision resolution scheme
- OpenAlex Level [?]
- 4
Broader Concepts
Narrower Concepts
- Collision attack
- Collision resistance
- Consistent hashing
- Dynamic perfect hashing
- Feature hashing
- K-independent hashing
- Linear hashing
- MDC-2
- Rolling hash
- SWIFFT
- Secure Hash Algorithm
- Security of cryptographic hash functions
- Universal hashing
Associated Authors
Add Incoming Edge
Login via ORCiD to contribute.
Add Outgoing Edge
Login via ORCiD to contribute.