Seuraa
Erik Demaine
Erik Demaine
Professor of Electrical Engineering and Computer Science, Massachusetts Institute of Technology
Vahvistettu sähköpostiosoite verkkotunnuksessa mit.edu - Kotisivu
Nimike
Viittaukset
Viittaukset
Vuosi
Geometric folding algorithms: linkages, origami, polyhedra
ED Demaine, J O'Rourke
Cambridge university press, 2007
9972007
A method for building self-folding machines
S Felton, M Tolley, E Demaine, D Rus, R Wood
Science 345 (6197), 644-646, 2014
9962014
Anchor-free distributed localization in sensor networks
NB Priyantha, H Balakrishnan, E Demaine, S Teller
Proceedings of the 1st international conference on Embedded networked sensor …, 2003
7612003
Programmable matter by folding
E Hawkes, B An, NM Benbernou, H Tanaka, S Kim, ED Demaine, D Rus, ...
Proceedings of the National Academy of Sciences 107 (28), 12441-12445, 2010
7602010
Frequency estimation of internet packet streams with limited space
ED Demaine, A López-Ortiz, JI Munro
European Symposium on Algorithms, 348-360, 2002
6162002
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
ED Demaine, FV Fomin, M Hajiaghayi, DM Thilikos
Journal of the ACM (JACM) 52 (6), 866-893, 2005
4002005
Mobile-assisted localization in wireless sensor networks
NB Priyantha, H Balakrishnan, ED Demaine, S Teller
Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and …, 2005
3942005
Deploying sensor networks with guaranteed capacity and fault tolerance
JL Bredin, ED Demaine, MT Hajiaghayi, D Rus
Proceedings of the 6th ACM international symposium on Mobile ad hoc …, 2005
3882005
Correlation clustering in general weighted graphs
ED Demaine, D Emanuel, A Fiat, N Immorlica
Theoretical Computer Science 361 (2-3), 172-187, 2006
3842006
PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
RA Hearn, ED Demaine
Theoretical Computer Science 343 (1-2), 72-96, 2005
3422005
Games, puzzles, and computation
RA Hearn, ED Demaine
CRC Press, 2009
3312009
Self-folding with shape memory composites
SM Felton, MT Tolley, BH Shin, CD Onal, ED Demaine, D Rus, RJ Wood
Soft Matter 9 (32), 7688-7694, 2013
3082013
Representing trees of higher degree
D Benoit, ED Demaine, JI Munro, R Raman, V Raman, SS Rao
Algorithmica 43, 275-292, 2005
2952005
Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
ED Demaine, ML Demaine
Graphs and Combinatorics 23 (Suppl 1), 195-208, 2007
2812007
Cache-oblivious B-trees
MA Bender, ED Demaine, M Farach-Colton
Proceedings 41st Annual Symposium on Foundations of Computer Science, 399-409, 2000
2732000
Playing games with algorithms: Algorithmic combinatorial game theory
ED Demaine
International Symposium on Mathematical Foundations of Computer Science, 18-33, 2001
2702001
On the complexity of reconfiguration problems
T Ito, ED Demaine, NJA Harvey, CH Papadimitriou, M Sideri, R Uehara, ...
Theoretical Computer Science 412 (12-14), 1054-1065, 2011
2692011
Output-sensitive algorithms for computing nearest-neighbour decision boundaries
D Bremner, E Demaine, J Erickson, J Iacono, S Langerman, P Morin, ...
Discrete & Computational Geometry 33, 593-604, 2005
2692005
Adaptive set intersections, unions, and differences
ED Demaine, A López-Ortiz, JI Munro
Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms …, 2000
2522000
Algorithmic graph minor theory: Decomposition, approximation, and coloring
ED Demaine, MT Hajiaghayi, K Kawarabayashi
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 637-646, 2005
2282005
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–20