Lectures related to Locality Sensitive Hashing

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.

Hashing and Sorting Techniques in Database Systems

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

Pairwise Independence: Hashing and Load Balancing

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

Hash Tables: Running Time Analysis

Explores the analysis of running time in hash tables, covering successful searches, key distribution, and table size impact.

Hash Tables: Birthday Paradox

Explores hash tables through the Birthday Paradox, collisions, and implementation methods.

Probabilistic Analysis: Hiring & Birthday Paradox

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

Decentralized Systems Engineering: Chord DHT

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

Hash Functions and Tables

Introduces hashing tables, including the Birthday Lemma, Direct-Address Tables, collisions, and Chained-Hash-Search.

Near Neighbors Retrieval: Efficient Techniques

Covers techniques for efficiently retrieving similar items using similarity search queries.

Hash Tables Analysis

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

Hash Collisions: Exploitation Techniques and Strategies

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

Cryptographic Hash Functions and Block Chains

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

Distinct Elements: Count and Hash Functions

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

Hashing: Basics and Applications

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

Hashing and Sorting

Covers hashing, sorting, extendible hashing, linear hashing, and external sorting.

Dictionary Operations

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

Implementation of Hash Sets

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

Implementation of Sets (II)

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

Implementation of Sets: Hashing

Covers the implementation of sets using hashing and set operations.

Data Compression: Privacy-Preserving Techniques

Explores privacy-preserving data management and data summarization techniques for finding similar items.