Erik Demaine
homepage:http://erikdemaine.org/
search externally:   Google Scholar,   Springer,   CiteSeer,   Microsoft Academic Search,   Scirus ,   DBlife

Description

Erik Demaine is an Esther and Harold E. Edgerton Professor and Associate Professor in the department of electrical engineering and computer science, and a member of the Theory of Computation group in the Computer Science and Artificial Intelligence Laboratory, at the Massachusetts Institute of Technology. He joined the faculty in 2001, and became an Associate Professor in 2005. He received his PhD in 2001 and Math in 1996 at University of Waterloo, and his BSc in 1995 at Dalhousie University.

Demaine's research interests span much of theoretical computer science and mathematics, in particular with connections to algorithms. Major research foci include discrete and computational geometry (particularly folding and unfolding of linkages, paper, polyhedra, and proteins), advanced data structures, graph algorithms, and recreational algorithms (such as the complexity of combinatorial games).


Lectures:

lecture
flag Lecture 25: Advanced Topics (cont.), Discussion of Follow-on Classes
as author at  MIT 6.046J / 18.410J Introduction to Algorithms - Fall 2005,
1040 views
  lecture
flag Lecture 24: Advanced Topics (cont.)
as author at  MIT 6.046J / 18.410J Introduction to Algorithms - Fall 2005,
1225 views
lecture
flag Lecture 19: Shortest Paths III: All-pairs Shortest Paths, Matrix Multiplication, Floyd-Warshall, Johnson
as author at  MIT 6.046J / 18.410J Introduction to Algorithms - Fall 2005,
7541 views
  lecture
flag Lecture 18: Shortest Paths II: Bellman-Ford, Linear Programming, Difference Constraints
as author at  MIT 6.046J / 18.410J Introduction to Algorithms - Fall 2005,
23076 views
lecture
flag Lecture 17: Shortest Paths I: Properties, Dijkstra's Algorithm, Breadth-first Search
as author at  MIT 6.046J / 18.410J Introduction to Algorithms - Fall 2005,
19461 views
  lecture
flag Lecture 12: Skip Lists
as author at  MIT 6.046J / 18.410J Introduction to Algorithms - Fall 2005,
8046 views
lecture
flag Lecture 10: Red-black Trees, Rotations, Insertions, Deletions
as author at  MIT 6.046J / 18.410J Introduction to Algorithms - Fall 2005,
42989 views
  lecture
flag Lecture 9: Relation of BSTs to Quicksort, Analysis of Random BST
as author at  MIT 6.046J / 18.410J Introduction to Algorithms - Fall 2005,
4174 views
lecture
flag Lecture 5: Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort
as author at  MIT 6.046J / 18.410J Introduction to Algorithms - Fall 2005,
8369 views
  lecture
flag Lecture 3: Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication
as author at  MIT 6.046J / 18.410J Introduction to Algorithms - Fall 2005,
12429 views
lecture
flag Lecture 2: Asymptotic Notation, Recurrences, Substitution, Master Method
as author at  MIT 6.046J / 18.410J Introduction to Algorithms - Fall 2005,
34126 views