はてなブックマーク

6.851: Advanced Data Structures (Fall'17) Prof. Erik Demaine TAs: Adam Hesterberg, Jayson Lynch LAs: Andrew He, Stef Ren [Home] [Lectures] [Problem Sets] [Project] [Coauthor] [Accessibility] 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 additi

6.851: Advanced Data Structures (Spring'14) Prof. Erik Demaine TAs: Timothy Kaler, Aaron Sidford [Home] [Lectures] [Assignments] [Project] [Open Problems] [Piazza] [Accessibility] sample frame from lecture videos (L02) 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

Prof. Erik Demaine Welcome to Advanced Data Structures, a graduate class at MIT. Please choose your semester: 2021 Spring 2017 Fall 2014 Spring 2012 Spring 2010 Spring 2007 Spring 2005 Spring (when the class was 6.897) 2003 Spring (when the class was 6.897) Accessibility

Retroactive data structures Today's lecture is our second and final lecture on time travel, or more precisely, temporal data structures. Here we will study retroactive data structures, which mimic the "plastic timeline" model of time travel. For example, in Back to the Future, Marty goes back in time, makes changes, and returns to the present that resulted from those changes and all the intervenin

6.851: Advanced Data Structures (Spring'12) Prof. Erik Demaine TAs: Tom Morgan, Justin Zhang [Home] [Lectures] [Assignments] [Project] [Problem Session] [Accessibility] 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 ar

Lecture 1 – Introduction & Document Distance (1 Feb 2011) notes | code | data | recitation notes | readings: 1, 3, D.1 Lecture 2 – Peak Finding (3 Feb 2011) notes | recitation notes | readings: 4.1, 4.3, D.1 Lecture 3 – Binary Search Trees (8 Feb 2011) notes | recitation notes | readings: 10.4, 12.1, 12.2, 12.3 Lecture 4 – AVL Trees (10 Feb 2011) notes | code | recitation notes | readings: 13.2, 1

6.851: Advanced Data Structures (Spring'07) Prof. Erik Demaine TA: Oren Weimann [Home] [Lectures] [Assignments] [Project] [Accessibility] Lectures are MW 1–2:30 in 56-114. Scribing Use this template when scribing. Submissions must be via email to oweimann#at#mit.edu and include a compiled PDF attachment, the LaTeX source, and whatever figures you use. Please give real bibliographical citations for

Monday January 11 - Friday January 15, 2009 2:00 - 4:00 PM IAP 2010 Course Description Interested in iPhone application development? Want to become a mobile entrepreneur? Learn to write iPhone Applications using Objective-C and the Cocoa Touch framework! The goal of this class is to get you through the learning curve of iPhone development: to give you the confidence and knowledge you need to branc