Lectures related to Total Functions: How and Why

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 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.

Induction and Recursion: Summary

Covers mathematical induction, recursively defined functions, and iterative algorithms for problem-solving.

Implementation of Sets: Hashing

Covers the implementation of sets using hashing and set operations.

Implementation of Sets (II)

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

Cryptographic Hash Functions and Block Chains

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

Dictionary Operations

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

Two-Phase Construction: Arrays & Hash Tables

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

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 Quick Sort

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

Cryptographic Security Fundamentals

Covers cryptographic security fundamentals, including collision search algorithms, public-key cryptography, and risks of underestimating collision attacks.

Implementing Combiners

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

Hash Tables: Rehashing for Improved Performance

Explores optimizing hash tables through rehashing for improved performance.

Implementation of Sets (I)

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

Recursive Functions: Substitution Interpreter

Covers the implementation of recursive functions using substitutions and environments, showcasing the ability to execute computable functions.

Nonlinear Equations: Fixed Point Method Convergence

Covers the convergence of fixed point methods for nonlinear equations, including global and local convergence theorems and the order of convergence.

Recursively Defined Functions

Introduces recursively defined functions, showcasing examples like the Fibonacci numbers.

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.