Concept
Birthday problem
Related lectures (11)
Hash Tables: Birthday Paradox
Explores hash tables through the Birthday Paradox, collisions, and implementation methods.
Bayes' Theorem: Defective Parts Detection
Explores Bayes' Theorem for defective parts detection, discrete random variables, and distribution functions, with practical examples and exercises.
Cryptographic Security Fundamentals
Covers cryptographic security fundamentals, including collision search algorithms, public-key cryptography, and risks of underestimating collision attacks.
Probabilistic Analysis: Hiring & Birthday Paradox
Explores probabilistic analysis in algorithms, covering the hiring problem and the birthday paradox, along with hash tables and functions.
Mobile Telephony Security
Explores the security challenges and improvements in mobile telephony, covering encryption algorithms, protocols, and integrity/authentication issues.
Runge-Kutta Methods: Approximating Differential Equations
Covers the stages of the explicit Runge-Kutta method for approximating y(t) with detailed explanations.
Control Theory Fundamentals
Covers the basic concepts of control theory and the selection of optimal controls.
Hashing and Sorting
Covers hashing, sorting, extendible hashing, linear hashing, and external sorting.
Linear Systems Control: Fundamentals and Applications
Explores linear systems control fundamentals, controllability, and optimal control choices.
Approximation in Sobolev Spaces
Covers the approximation of functions in Sobolev spaces using smooth functions.