Sign inSign in

Erik Demaine

Professor of Electrical Engineering and Computer Science · MIT · MacArthur Fellow · author of Geometric Folding Algorithms

MIT Professor of Computer Science and MacArthur Fellow renowned for algorithmic data structures, computational origami, and hardness proofs.

More

MIT Professor of Computer Science and MacArthur Fellow renowned for algorithmic data structures, computational origami, and hardness proofs.

lectures
51
series
3
hours
61

Start here

Series and courses

MIT 6.046J: Design and Analysis of Algorithmsfrom Cormen et al., Introduction to Algorithms (CLRS)15 lectures · 19 h
MIT 6.851: Advanced Data Structuresfrom Cormen et al., Introduction to Algorithms (CLRS)22 lectures · 30 h
MIT 6.006: Introduction to Algorithmsfrom Cormen et al., Introduction to Algorithms (CLRS)14 lectures · 12 h

In these lectures

Draws on

People cited in the lectures, at the moment of the citation.

  • Peter van Emde BoasCo-author of the van Emde Boas data structure.14:41
  • Richard BellmanInventor of dynamic programming and the Bellman-Ford algorithm, cited for the origin of the term.4:03
  • Martin Farach-ColtonCo-author on cache-oblivious B-trees and simplifications of old data structures around 2001.49:44
  • van Emde BoasInvented van Emde Boas trees, referenced for drawing similar tree pictures.24:52
  • Harold ProkopM.Eng. thesis on cache-oblivious static search trees37:16
  • Eric PriceCo-author of a paper originating from a class open problem session four years prior1:22:46

Playlists

2

Connections

62

Their places, courses, books and lectures.

Scholars2

Institutions2

Lectures51

Show 45 more