Lectures related to Universal hashing

Pairwise Independence: Hashing and Load Balancing

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

Cryptographic Hash Functions and Block Chains

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

Hash Tables Analysis

Covers the analysis of hash tables, including search operations and expected collisions.

Decentralized Systems Engineering: Chord DHT

Covers the Chord DHT in decentralized systems engineering, focusing on reliability, redundancy, and structure maintenance.

Implementation of Hash Sets

Covers the implementation details of hash sets and related methods using IntelliJ IDEA.

Equality, Order, and Hashing

Discusses the importance of defining equality in collections and how order and hashing optimize operations.

Hashing: Basics and Applications

Explores hashing fundamentals, applications in security, and common attacks on hash functions.

Probabilistic Analysis: Hiring & Birthday Paradox

Explores probabilistic analysis in algorithms, covering the hiring problem and the birthday paradox, along with hash tables and functions.

Dictionary Operations

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

Equality, Order, and Hashing

Explains hashing, equality, and order in Java, emphasizing method compatibility for correct collection behavior.

Distinct Elements: Count and Hash Functions

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

Hashing: Basics and Security

Explores the basics and security aspects of hashing in data representation and verification.

Implementation of Sets: Hashing

Covers the implementation of sets using hashing and set operations.

Nearest Neighbor Search: Johnson-Lindenstrauss Lemma

Covers the Nearest Neighbor search algorithm and the Johnson-Lindenstrauss lemma for dimensionality reduction, exploring preprocessing techniques and locality-sensitive hashing.

Hash Functions: SandboxFlippedClass

Explores hash functions, coding, and sharing code with practical exercises and discussions.

Two-Phase Construction: Arrays & Hash Tables

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

Implementation of Sets (II)

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

Abusive Data Collection: Risks and Protections

Explores risks of abusive data collection, protections like Differential Privacy, Hashing, and Encryption, and techniques for data protection.

Total Functions: How and Why

Explores hash table efficiency, total functions in code modeling, and well-founded relations for recursive function termination.

Hashing and Sorting Techniques in Database Systems Log in to Mediaspace to watch this video

Provides an overview of hashing and sorting techniques in database management systems, focusing on their implementation and performance optimization.