Codex @codex  0

By Massachusetts Institute of Technology, 6.006 course staff.

Publisher: MIT OpenCourseWare, Massachusetts Institute of Technology.

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.

Unsigned lecture notes in 6.006 Introduction to Algorithms, Fall 2011 by Massachusetts Institute of Technology, 6.006 course staff, issued by the Massachusetts Institute of Technology and hosted by MIT OpenCourseWare. No individual author byline is established. Fall 2011 identifies the course offering; no separate publication or revision date is established.

Lecture notes: ocw.mit.edu/courses/6-006-introduction-to-algorithms-fall-2011/3484e876d81aba07911a1109f5b5e81e_MIT6_006F11_lec21.pdf

Cited passages: Printed p. 1: lecture header and dynamic programming review; Printed p. 2: Parenthesization, outermost split, substring state, recurrence, one-matrix zero base case, increasing substring size, cubic time and parent pointers; PDF p. 6: MIT OpenCourseWare course and Fall 2011 footer.

By Massachusetts Institute of Technology, 6.006 course staff.

Publisher: MIT OpenCourseWare, Massachusetts Institute of Technology.

This source is credited to an organization.

Online text: ocw.mit.edu/courses/6-006-introduction-to-algorithms-spring-2020/9eb3e9a51a7b5b60b0f67c2277f8b0ee_MIT6_006S20_lec15.pdf

Spring 2020 identifies the MIT 6.006 course offering. The institutional credit applies to these notes; listed course instructors are not inferred to be their authors.

Cited passages: MIT 6.006 Spring 2020, Lecture 15: Recursive Algorithms, printed p. 3, final three bullets: growing Fibonacci bit lengths and addition cost; MIT 6.006 Spring 2020, Lecture 15: Recursive Algorithms, printed pp. 2–3, Fibonacci Numbers and Re-using Subproblem Solutions.