Microsoft PowerPoint - L02 - Peak Finding.pptx - Theoretical computer science - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2011-02-03 14:56:40 Theoretical computer science Erik Demaine Algorithm Demaine		Microsoft PowerPoint - L02 - Peak Finding.pptx Add to Reading List Source URL: courses.csail.mit.edu Download Document from Source Website File Size: 1,93 MB Share Document on Facebook

	Structural sparsity in the real world Erik Demaine∗ , Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Blair D. Sullivan† and Somnath Sikdar Theoretical Computer Science ∗ MIT † NCSU DocID: 1v4mK - View Document
	Algorithms for Designing Pop-Up Cards Zachary Abel∗1 , Erik D. Demaine†‡2 , Martin L. Demaine2 , Sarah Eisenstat‡2 , Anna Lubiw§3 , André Schulz¶4 , Diane L. Souvainek5 , Giovanni Viglietta6 , and Andrew Winsl DocID: 1uAZH - View Document
	Staged Self-Assembly: Nanomanufacture of Arbitrary Shapes with O(1) Glues Erik D. Demaine∗ Martin L. Demaine∗ DocID: 1uo3Z - View Document
	UPWARD PARTITIONED BOOK EMBEDDING Hugo A. Akitaya, Erik D. Demaine, Adam Hesterberg, and Quanquan C. Liu Book Embedding DocID: 1uiE5 - View Document
	CCCG 2011, Toronto ON, August 10–12, 2011 Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete Zachary Abel∗ Erik D. Demaine† DocID: 1uhJD - View Document