Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Hash table

Related lectures (32)

Decentralized Systems Engineering: Chord DHT

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

Hash Tables Analysis

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

Pairwise Independence: Hashing and Load Balancing

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

Probabilistic Analysis: Hiring & Birthday Paradox

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

Hash Tables: Rehashing for Improved Performance

Explores optimizing hash tables through rehashing for improved performance.

Implementation of Sets: Hashing

Covers the implementation of sets using hashing and set operations.

Total Functions: How and Why

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

Chord: Search & Routing

Covers the Chord algorithm for search and routing in distributed hash tables.

Implementation of Hash Sets

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

Equality, Order, and Hashing

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

Implementation of Sets (I)

Covers the implementation of sets, starting with a naive list-based approach.

Dictionary Operations

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

Implementation of Sets (II)

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

Implementing Combiners

Covers the implementation of combiners in parallel programming in Scala, including efficient combine methods and set data structures.

Two-Phase Construction: Arrays & Hash Tables

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

Hashing: Basics and Security

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

Equality, Order, and Hashing

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

Hashing and Quick Sort

Covers the efficient implementation of hash tables and the Quick Sort algorithm.

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.

Collections: Associative Tables

Covers associative tables, Map interface methods, key/value pairs, and HashMap vs. TreeMap differences.

Related lectures (32)

Decentralized Systems Engineering: Chord DHT

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

Hash Tables Analysis

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

Pairwise Independence: Hashing and Load Balancing

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

Probabilistic Analysis: Hiring & Birthday Paradox

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

Hash Tables: Rehashing for Improved Performance

Explores optimizing hash tables through rehashing for improved performance.

Implementation of Sets: Hashing

Covers the implementation of sets using hashing and set operations.

Total Functions: How and Why

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

Chord: Search & Routing

Covers the Chord algorithm for search and routing in distributed hash tables.

Implementation of Hash Sets

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

Equality, Order, and Hashing

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

Implementation of Sets (I)

Covers the implementation of sets, starting with a naive list-based approach.

Dictionary Operations

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

Implementation of Sets (II)

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

Implementing Combiners

Covers the implementation of combiners in parallel programming in Scala, including efficient combine methods and set data structures.

Two-Phase Construction: Arrays & Hash Tables

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

Hashing: Basics and Security

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

Equality, Order, and Hashing

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

Hashing and Quick Sort

Covers the efficient implementation of hash tables and the Quick Sort algorithm.

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.

Collections: Associative Tables

Covers associative tables, Map interface methods, key/value pairs, and HashMap vs. TreeMap differences.