User contributions
From 6.006 Introduction to Algorithms
- 22:30, 9 May 2008 (diff | hist) Lectures and Recitations (→Recitation 18, More Dynamic Programming: Beating Super Mario Bros, Getting Points Back on Tests (LCS))
- 22:28, 9 May 2008 (diff | hist) Lectures and Recitations (→Recitation 19, Even More Dynamic Programming: Maxiumum-sum Sub-array, Pwning at Tetris)
- 22:28, 9 May 2008 (diff | hist) Lectures and Recitations (→Recitation 20, Knapsack and Its Variants, Structural Dynamic Programming: Covering a Tree with Templates, Dominating Set)
- 22:25, 9 May 2008 (diff | hist) Lectures and Recitations
- 22:24, 9 May 2008 (diff | hist) Lectures and Recitations (→Recitation 20, Knapsack and Its Variants, Structural Dynamic Programming: Covering a Tree with Templates, Dominating Set)
- 22:22, 9 May 2008 (diff | hist) Lectures and Recitations (→Recitation 22, Divide and Conquer vs Dynamic Programming on Problems: Matrix Multiplication, Tower, Max-sum Subarray, Closet Pair)
- 22:21, 9 May 2008 (diff | hist) Lectures and Recitations (→Recitation 22, Divide and Conquer vs Dynamic Programming on Problems: Matrix Multiplication, Tower, Max-sum Subarray, Closet Pair)
- 22:20, 9 May 2008 (diff | hist) Lectures and Recitations (→Recitation 22, Divide and Conquer vs Dynamic Programming on Problems: Matrix Multiplication, Tower, Max-sum Subarray, Closet Pair)
- 22:20, 9 May 2008 (diff | hist) Lectures and Recitations
- 16:54, 9 May 2008 (diff | hist) Lectures and Recitations
- 16:52, 9 May 2008 (diff | hist) Lectures and Recitations (→Recitation 20, Structural Dynamic Programming: Covering a Tree with Templates, Dominating Set)
- 16:50, 9 May 2008 (diff | hist) Lectures and Recitations (→Recitation 17, Hands-on Dynamic Programming: Big Ideas, Memoization in Fibonacci, Crazy Cards)
- 16:26, 9 May 2008 (diff | hist) Lectures and Recitations (→Recitation 21, Dynamic Programming Practice: Live Python Coding, Dominating Sets)
- 16:25, 9 May 2008 (diff | hist) Lectures and Recitations (→Recitation 22, Divide and Conquer vs Dynamic Programming on Problems: Matrix multiplication, Tower, Max-sum Subarray, Closet Pair)
- 16:25, 9 May 2008 (diff | hist) Lectures and Recitations (→Recitation 22, Divide and Conquer vs Dynamic Programming on problems: Matrix multiplication, Tower, Max-sum Subarray, Closet Pair)
- 16:25, 9 May 2008 (diff | hist) Lectures and Recitations (→Recitation 22, Divide and Conquer vs Dynamic Programming on Strassen's algorithm, Tower, Max-sum Subarray, Closet Pair)
- 16:24, 9 May 2008 (diff | hist) Lectures and Recitations
- 19:10, 25 April 2008 (diff | hist) Lectures and Recitations (→[http://courses.csail.mit.edu/6.006/spring08/notes/lecture20.pdf Lecture 20], Dynamic Programming II: Longest Common Subsequence, Parent Pointers)
- 19:09, 25 April 2008 (diff | hist) Lectures and Recitations (→[http://courses.csail.mit.edu/6.006/spring08/notes/lecture20.pdf Lecture 20], Dynamic Programming II: Longest Common Subsequence, Parent Pointers)
- 18:59, 25 April 2008 (diff | hist) Lectures and Recitations (→[http://courses.csail.mit.edu/6.006/spring08/notes/lecture20.pdf Lecture 20], Dynamic Programming II: Longest Common Subsequence, Parent Pointers)
- 17:33, 21 April 2008 (diff | hist) Lectures and Recitations (→Recitation 16, Array implementation of Dijkstra)
- 17:32, 21 April 2008 (diff | hist) Lectures and Recitations
- 17:09, 21 April 2008 (diff | hist) Lectures and Recitations
- 22:06, 3 April 2008 (diff | hist) Lectures and Recitations
- 21:32, 14 March 2008 (diff | hist) Lectures and Recitations
- 21:31, 14 March 2008 (diff | hist) Lectures and Recitations
- 17:30, 7 March 2008 (diff | hist) Lectures and Recitations
- 17:29, 7 March 2008 (diff | hist) Lectures and Recitations
- 16:48, 22 February 2008 (diff | hist) Lectures and Recitations
- 20:53, 15 February 2008 (diff | hist) Lectures and Recitations