Data structures play a central role in modern computer science. You interact with data structures even more often than with algorithms (think Google, your mail server, and even your network routers). In addition, data structures are essential building blocks in obtaining efficient algorithms. This course covers major results and current directions of research in data structure.
30 hours of lectures
Assignments with solutions
Erik D. Demaine is a professor of Computer Science at the Massachusetts Institute of Technology and a former child prodigy. He joined the MIT faculty in 2001 at age 20, reportedly the youngest professor in the history of the Massachusetts Institute of Technology. Demaine is a member of the Theory of Computation group at MIT Computer Science and Artificial Intelligence Laboratory. In 2003 he was awarded a MacArthur Fellowship, the so-called "genius award". Mathematical origami artwork by Erik and Martin Demaine was part of the Design and the Elastic Mind exhibit at the Museum of Modern Art in 2008, and has been included in the MoMA permanent collection.In 2013, Demaine received the EATCS Presburger Award for young scientists. That same year, he was awarded a fellowship by the John Simon Guggenheim Memorial Foundation.
MIT 6.851 Advance data Structures by Professor Erik Demaine is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License. Based on a work at MIT OpenCourseWare.