ConceptSystems & CS
Data structure
A way by which you can structure your data using a computer's memory in interesting and clever ways to solve problems more effectively.
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.
David J. Malan
Victor Costan
A collection of algorithms that help you store and then retrieve information.
Lectures that assume it
77The first 12 are shown.
- Binary Search Trees & Runway Reservation Scheduling
- Loops
- Streams, Part 1
- Compound Data Structures in Programming
- Higher-Order Procedures and Functional Abstraction
- Decision-Tree Ω(n log n) Lower Bound, Counting Sort & Radix Sort
- Hashing with Chaining, Simple Uniform Hashing & Universal Families
- Doing with Images Makes Symbols (Part 1)
- Harvard CS50’s Artificial Intelligence with Python – Full University Course
- Geometric Structures I
- A Practical Guide to Data-Oriented Design
- Computational Objects
Connections
88The lectures that define it or assume it, and the concepts next to it.
Concepts8
Show 2 moreShow fewer
Lectures80
- Algorithms
- Data Structures
- Recursion Trees and Binary Search Trees (MIT 6.006 Recitation 5)
- Binary Search Trees & Runway Reservation Scheduling
- Loops
- Streams, Part 1
Show 74 moreShow fewer
- Compound Data Structures in Programming
- Higher-Order Procedures and Functional Abstraction
- Decision-Tree Ω(n log n) Lower Bound, Counting Sort & Radix Sort
- Hashing with Chaining, Simple Uniform Hashing & Universal Families
- Doing with Images Makes Symbols (Part 1)
- Harvard CS50’s Artificial Intelligence with Python – Full University Course
- Geometric Structures I
- A Practical Guide to Data-Oriented Design
- Computational Objects
- Dijkstra's Shortest Path Algorithm: Graph Theory and Optimization
- Doing with Images Makes Symbols (Part 2)
- Amortization: Amortized Analysis
- The Learning Problem
- Bentley Rules for Optimizing Work
- Tuning a TSP Algorithm
- Integer Models
- Blockstack
- Table Doubling, Karp-Rabin
- Object-Oriented Programming
- Computational Objects
- The Future of Programming
- AVL Trees, Tree Rotations & Guaranteed O(log n) Height
- Dijkstra's Algorithm: Greedy Single-Source Shortest Paths
- Integer Lower Bounds
- Dynamic Connectivity Lower Bound
- Arch4Health: 4th Workshop on Architecture for Health
- Conflict Resolution for Eventual Consistency
- CRDTs and the Quest for Distributed Consistency
- Interface and Implementation Inheritance
- Storage Allocation and Garbage Collection
- Persistent Data Structures
- Retroactive Data Structures
- Geometric Structures II
- Mechanical Sympathy: Designing Software for Modern CPU Caches
- Cryptocurrency: An Overview and Critique
- Augmentation: Range Trees
- Dynamic Graphs II
- Extremal Combinatorics Meets Algorithms and Data Structures
- A Multiset Approach to Arithmetic (Mathematics Foundations 227)
- OpenVDB: History, Motivation, and Diverse Adoption
- VulHunt: A Framework for Hunting Vulnerabilities in Binaries
- Effective Programs: Situated Information Systems vs. In-Memory Object Graphs
- Data Formats & Encoding Part 1
- Deep Learning Software
- Succinct Structures I
- Multiprocessors and Locks
- Automerge: A Foundation for Local-First Collaboration Software
- The Past, Present, and Future of Local-First Software
- Understanding AI: Semantic Grounding in Large Language Models
- Modern SQL — Window Functions, CTEs & Bag Semantics
- Distributed Version Control and the Design of Git
- On Notation: Principles and Impact in Computing
- Problems in P
- Dynabook: The Complete Story
- Data Formats & Encoding Part 2
- Python
- The Computer Revolution Hasn't Happened Yet (OOPSLA Keynote)
- Data Parallel Haskell
- Join Algorithms
- Databricks Photon / Spark SQL
- FloeScan and Other Interesting Design Magic
- Optimizing Clojure: Leveraging Modern JVM for Performance
- Functional Mechanical Sympathy
- SingleStore Database Overview
- Leiserchess Codewalk
- Code Matters: Reflections on Rust in the LLM Age
- Property Based Testing: The Past, The Present, and The Future
- Join Ordering: Top-Down / Transformational
- We Were So Lucky
- Quasilinear Cook–Levin Theorem
- Teaching Functional Programming with Clojure in Academia: Insights and Challenges
- Unlocking Creativity & the Future of Computing
- Rust, In Sickness & In Health (RustConf 2026 Keynote)
- To NoSQL or Not to NoSQL: That Is the Question