ConceptSystems & CS
DAG
A directed acyclic graph represents the dependencies of expressions in the pipeline to enable parallelization.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
2Each in their own terms, from the easiest level.
Erik Demaine
A directed acyclic graph used to represent the dependencies between subproblems in dynamic programming.
Lectures that assume it
6Connections
15The lectures that define it or assume it, and the concepts next to it.
Concepts7
- Computed columns
- Orchestration
- Dynamic programming
- Edit distance
- Sources and sinks in a DAG
- Sparse triangular solve
Show 1 moreShow fewer
Lectures8
- Dynamic Programming IV: Guitar Fingering, Tetris, Super Mario Bros.
- Pixeltable: A DBMS for Multimodal AI Applications
- Dynamic Programming III: Parenthesization, Edit Distance, Knapsack
- Dynamic Programming I: Fibonacci, Shortest Paths
- Arch4Health: 4th Workshop on Architecture for Health
- Hopcroft–Paul–Valiant Theorem