6.006 Introduction to Algorithms, Fall 2011 by Massachusetts Institute of Technology, 6.006 course staff (2011)

By Massachusetts Institute of Technology, 6.006 course staff.

Publisher: MIT OpenCourseWare, Massachusetts Institute of Technology.

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.

Online text: ocw.mit.edu/courses/6-006-introduction-to-algorithms-fall-2011/160b3b5f9da2e03815ca1e6ee0dba62a_MIT6_006F11_lec09.pdf

Cited passages: Lecture 9: Hashing II, p. 2, rebuilding cost and geometric table doubling; Lecture 9: Hashing II, p. 3, expected bounds and shrinking at one-quarter occupancy.

By Massachusetts Institute of Technology, 6.006 course staff.

Online text: ocw.mit.edu/courses/6-006-introduction-to-algorithms-fall-2011/e59f8a55929028498953691891229a17_MIT6_006F11_lec14.pdf

Cited passages: Lecture 14: Graphs II: Depth-First Search, printed pp. 3–4: stack-duration marks and cycle detection; MIT 6.006, lecture 14: depth-first search, pp. 2–3.