Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Pairwise Independence: Hashing and Load Balancing
Description
This lecture covers the concept of pairwise independence in hashing, focusing on the goal of achieving no collisions in a hash family. The instructor explains the importance of using random linear functions to achieve this goal and discusses the process of load balancing when hashing elements uniformly into slots.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.