Demaine - PDFSEARCH.IO - Document Search Engine

Demaine
Results: 226

#	Item
181	Spring[removed]: Advanced Data Structures Lecture 5 — March 1, 2012 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2014-02-25 15:05:08 Splay tree Treap Binary search tree Self-balancing binary search tree Heap Red–black tree B-tree AVL tree Tree traversal Binary trees Graph theory Computing
182	Ununfoldable Polyhedra with Convex Faces Marshall Bern∗ Eric Kuo§ Erik D. Demaine† Andrea Mantler¶ Add to Reading List Source URL: erikdemaine.org Language: English - Date: 2001-08-27 16:10:29 Polyhedra Deltahedra Platonic solids Polytopes Nonconvex polyhedra Polyhedron Octahedron Icosahedron Vertex Geometry Convex geometry Euclidean geometry
183	Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Erik Demaine and Srini Devadas September 15, 2011 Problem Set 2 Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-09-25 21:36:41 Computer science Programming idioms Computational complexity theory Asymptotic analysis Recursion Theory of computation Rendering Big O notation Time complexity Theoretical computer science Analysis of algorithms Mathematics
184	6.851: Advanced Data Structures Spring 2012 Lecture 8 — 13 March, 2012 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2012-05-13 20:05:06 Abstract data types Data management B-tree Arrays Circular buffer Computer memory Linked list Priority queue Stack Computing Graph theory Binary trees
185	6.849: Geometric Folding Algorithms Fall 2010 — Prof. Erik Demaine Problem Set 2 Due: Wednesday, October 20, 2010 Problem 1. Who designed the following origami models? (Review the slides from Lectures 4 Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2010-10-05 14:19:21 Mathematics Origami Straight skeleton Crease Structural rigidity Paper folding Visual arts Arts
186	6.851: Advanced Data Structures Spring 2012 Lecture 2 — 02/09, 2012 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2012-05-29 13:10:42 Abstract data types Computer programming Priority queue Data structures Bin Persistent data structure Rope Fractional cascading Segment tree Graph theory Binary trees Computing
187	Microsoft Word - poster.doc Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2007-01-16 22:14:02 Knots Numerals Quipu Linguistics Notation Gary Urton Inca Empire Erik Demaine Andean civilizations MacArthur Fellows Inca Americas
188	Retroactive Data Structures ERIK D. DEMAINE Massachusetts Institute of Technology and JOHN IACONO Polytechnic University Add to Reading List Source URL: erikdemaine.org Language: English - Date: 2007-05-21 16:15:43 Database management systems Abstract data types Software engineering Dynamization Disjoint-set data structure Persistent data structure Database Priority queue SQL Data structures Computing Data management
189	6.851: Advanced Data Structures Spring 2012 Lecture 11 — March 22, 2012 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2012-05-17 11:31:50 Graph theory Computing Search algorithms Van Emde Boas tree Binary search tree Binary search algorithm Time complexity Pointer machine Search tree Theoretical computer science Binary trees Data structures
190	6.851: Advanced Data Structures Spring 2012 Lecture 13 — April 5, 2012 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2012-05-29 13:10:42 Communication Computational complexity theory Analysis of algorithms Asymptotic analysis Big O notation Mathematical notation Information theory Communication complexity Combinatory logic Theoretical computer science Applied mathematics Mathematics

UPDATE