Demaine - PDFSEARCH.IO - Document Search Engine

Demaine
Results: 226

#	Item
131	6.897: Advanced Data Structures Spring 2003 Lecture 1 — February 9, 2003 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2003-04-14 13:44:19 Logarithms Theoretical computer science Priority queue FO Binary search tree B-tree Binary search algorithm Rope Model theory Mathematics Binary trees Graph theory
132	Playing Dominoes is Hard, Except by Yourself Erik D. Demaine, Fermi Ma, and Erik Waingarten MIT Computer Science and Artificial Intelligence Laboratory, 32 Vassar St., Cambridge, MA 02139, USA, {edemaine,fermima,eaw}@mit Add to Reading List Source URL: erikdemaine.org Language: English - Date: 2014-03-31 23:27:42 42 Domino Generalized geography Puzzle video games Logic puzzles Pushover Matador Games Domino games Dominoes
133	Fun with Fonts: Algorithmic Typography Erik D. Demaine and Martin L. Demaine MIT CSAIL, 32 Vassar St., Cambridge, MA 02139 {edemaine,mdemaine}@mit.edu Abstract. Over the past decade, we have designed five typefaces base Add to Reading List Source URL: erikdemaine.org Language: English - Date: 2014-04-06 23:42:36 Graphic design Typeface Univers Origami Font Fixed Type design Visual arts Typography Typesetting
134	CCCG 2011, Toronto ON, August 10–12, 2011 Common Developments of Several Diﬀerent Orthogonal Boxes Zachary Abel∗ Erik Demaine† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:14 Symmetry Quadrilaterals Rectangle Polygon Tessellation Area Rectilinear polygon Origami Box Geometry Euclidean geometry Paper folding
135	CCCG 2010, Winnipeg MB, August 9–11, 2010 Zipper Unfoldings of Polyhedral Complexes Erik D. Demaine∗ Martin L. Demaine† Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-09-15 10:13:21 Platonic solids Polytopes Deltahedra Polyhedra Polygons Polyhedron Toroidal polyhedron Net Dual polyhedron Geometry Convex geometry Euclidean geometry
136	Making Polygons by Simple Folds and One Straight Cut Erik D. Demaine∗ Martin L. Demaine∗ ∗ Po-Ru Loh Shelly Manber∗ Add to Reading List Source URL: erikdemaine.org Language: English - Date: 2010-11-09 22:19:16 Polyhedron Convex and concave polygons Vertex Fold Straight skeleton Pseudotriangle Geometry Polygons Simple polygon
137	Optimal Adaptive Algorithms for Finding the Nearest and Farthest Point on a Parametric Black-Box Curve Ilya Baran [removed] Erik D. Demaine Add to Reading List Source URL: www.mit.edu Language: English - Date: 2004-06-07 21:08:09 Curves Computational complexity theory Analysis of algorithms Time complexity Ellipse Ε-net Theoretical computer science Applied mathematics Conic sections
138	Retroactive Data Structures (extended abstract) Erik D. Demaine John Iacono Add to Reading List Source URL: www.aladdin.cs.cmu.edu Language: English - Date: 2005-07-03 22:51:50 Software engineering Abstract data types Data types Persistent data structure Dynamization Priority queue Binary search tree Bin Linked list Computing Data management Data structures
139	Optimally Adaptive Integration of Univariate Lipschitz Functions Ilya Baran∗ Erik D. Demaine∗ Dmitriy A. Katz† Add to Reading List Source URL: www.mit.edu Language: English - Date: 2004-07-05 16:32:58 Lipschitz continuity Integral Continuous function Mathematical analysis Mathematics Functions and mappings
140	Optimal Adaptive Algorithms for Finding the Nearest and Farthest Point on a Parametric Black-Box Curve Ilya Baran∗ Erik D. Demaine∗ May 30, 2004 Add to Reading List Source URL: www.mit.edu Language: English - Date: 2004-05-30 17:03:16 Mathematics Calculus Continuous function Ellipse Dimension Mathematical analysis Conic sections Curves

UPDATE