Victor Costan
Instructor · MIT
Victor Costan is a Professor at MIT who works on security and verification in computing, cryptography and distributed systems.
- lectures
- 7
- series
- 1
- hours
- 6
Start here
- Asymptotic Complexity and Peak Finding (MIT 6.006, Recitation 1)from Cormen et al., Introduction to Algorithms (CLRS)

- AVL Trees (MIT 6.006 Introduction to Algorithms, Recitation 6)from Cormen et al., Introduction to Algorithms (CLRS)

- Recursion Trees and Binary Search Trees (MIT 6.006 Recitation 5)from Cormen et al., Introduction to Algorithms (CLRS)

Series and courses
MIT 6.006: Introduction to Algorithms
In these lectures
- Asymptotic complexity keeps only the dominant term and drops constant factors to describe growth rates.Asymptotic Complexity and Peak Finding (MIT 6.006, Recitation 1)
- An AVL tree is a binary search tree where the left and right subtree heights differ by at most one at every node.AVL Trees (MIT 6.006 Introduction to Algorithms, Recitation 6)
- Recursion trees visualize and solve recurrence relations by summing the costs across all levels.Recursion Trees and Binary Search Trees (MIT 6.006 Recitation 5)
Playlists
1About
Victor Costan is a Professor at MIT who works on security and verification in computing, cryptography and distributed systems. Costan's undergraduate MIT 6.006 recitations prove AVL tree height bounds, build depth-first search and apply dynamic programming to Crazy Eights and Dance Dance Revolution.
Taught with
Same subject, Algorithms & Theoretical CS
Connections
11Their places, courses, books and lectures.
Institution1
Concept1
Lectures7
- Asymptotic Complexity and Peak Finding (MIT 6.006, Recitation 1)
- AVL Trees (MIT 6.006 Introduction to Algorithms, Recitation 6)
- Recursion Trees and Binary Search Trees (MIT 6.006 Recitation 5)
- Shortest Paths
- Dynamic Programming: Crazy Eights and Shortest Path (MIT 6.006, Recitation 19)
- Depth-First Search (DFS) (MIT 6.006, Recitation 14)



