Total Functions: How and Why

Related lectures (30)

Page 2 of 3

Covers the implementation of sets using a naive approach and discusses the inefficiencies of the S list 7 class.

Explores pairwise independence in hashing to avoid collisions and achieve load balancing.

Covers cryptographic hash functions, message authentication codes, and block chains, including bitcoins, proof-of-work, and MAC variants.

Explores chaos in quantum field theories, focusing on conformal symmetry, OPE coefficients, and random matrix universality.

Explores hashing techniques like static, extendible, and linear hashing, along with sorting methods such as external merge sort and B+ trees.

Covers operations and methods related to dictionaries in Python, including creating, updating, and handling key errors.

Explains two-phase construction for arrays, hash tables, and search trees in parallel.

Explores hash collisions, attacks on hash functions, and strategies for exploiting them in file formats like JPEG and PDF.

Covers counting distinct elements using hash functions and the median trick.

Explores file organization, indexing techniques, and metadata in databases, emphasizing the importance of choosing the right search key.