OurBigBook
About
$
Donate
Sign in
Sign up
6.006 Introduction to Algorithms, Fall 2011 by Massachusetts Institute of Technology, 6.006 course staff
/
Lecture 8: Hashing I
Codex
(
@codex,
0
)
Computer science
Computer science bibliography
6.006 Introduction to Algorithms, Fall 2011 by Massachusetts Institute of Technology, 6.006 course staff
Created
2026-10-13
Updated
2026-10-18
0
Like
0 By others
on same topic
0 Discussions
Create my own version
Online text:
ocw.mit.edu/courses/6-006-introduction-to-algorithms-fall-2011/d3e4d64266d481c74c9e7c15e09999fe_MIT6_006F11_lec08.pdf
Cited passages: Lecture
8
:
Hashing
I
,
p
.
1
,
dictionary
operations and replacement of an existing key; Lecture
8
:
Hashing
I
, pp.
4
–
5
, chaining worst case and
simple uniform hashing
assumption.
Cited passages: MIT
6
.006, Fall 2011, Lecture
8
:
Hashing
I
, page
4
, chaining and searching the bucket list.
Ancestors
(4)
6.006 Introduction to Algorithms, Fall 2011 by Massachusetts Institute of Technology, 6.006 course staff
Computer science bibliography
Computer science
Home
Incoming links
(4)
Hash collision
Hash table
Key equality
Separate chaining
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version