Hashing

Ctrie

A concurrent hash-trie or Ctrie is a concurrent thread-safe lock-free implementation of a hash array mapped trie. It is used to implement the concurrent map abstraction. It has particularly scalable concurrent insert and remove operations and is memory-efficient. It is the first known concurrent data-structure that supports O(1), atomic, lock-free snapshots. (Wikipedia).

Ctrie
Video thumbnail

My #MegaFavNumber - The Bremner-Macleod Numbers

Much better video here: https://youtu.be/Ct3lCfgJV_A

From playlist MegaFavNumbers

Video thumbnail

7 - MegaFavNumbers

#MegaFavNumbers

From playlist MegaFavNumbers

Video thumbnail

「かぐや」HDTVによるオリエンタレ・ベイスン

月周回衛星「かぐや」のHDTVが観測したオリエンタレ・ベイスン (C)JAXA/NHK

From playlist Earth's place in Solar System - Jaxa

Video thumbnail

My MegaFavNumber

#MegaFavNumbers

From playlist MegaFavNumbers

Video thumbnail

The BuShou of HanZi :田

A brief description of the BuShou of 田.

From playlist The BuShou of HanZi

Video thumbnail

Eteinne Farcot - The Multiradial Represenation of IUT

http://www.nottingham.ac.uk/cmmb/people/etienne.farcot

From playlist Mathematical Shenanigans

Video thumbnail

Underactive thyroid.mov

An general explanation of the underactive thyroid.

From playlist For Patients

Video thumbnail

「かぐや」HDTVによるアルキメデス

月周回衛星「かぐや」のHDTVが観測したアルキメデス (C)JAXA/NHK

From playlist Earth's place in Solar System - Jaxa

Related pages

Hamming weight | Scala (programming language) | Software transactional memory | Pseudocode | Hash array mapped trie