Erik Demaine
Erik Demaine
Professor of Electrical Engineering and Computer Science, Massachusetts Institute of Technology
Dirección de correo verificada de mit.edu - Página principal
Título
Citado por
Citado por
Año
Handbook of discrete and computational geometry
CD Toth, J O'Rourke, JE Goodman
CRC press, 2017
16132017
Geometric folding algorithms: linkages, origami, polyhedra
ED Demaine, J O'Rourke
Cambridge university press, 2007
7202007
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
6652003
A method for building self-folding machines
S Felton, M Tolley, E Demaine, D Rus, R Wood
Science 345 (6197), 644-646, 2014
6072014
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
5382010
Frequency estimation of internet packet streams with limited space
ED Demaine, A López-Ortiz, JI Munro
European Symposium on Algorithms, 348-360, 2002
5362002
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
3612005
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
3062005
Representing trees of higher degree
D Benoit, ED Demaine, JI Munro, R Raman, V Raman, SS Rao
Algorithmica 43 (4), 275-292, 2005
2632005
Correlation clustering in general weighted graphs
ED Demaine, D Emanuel, A Fiat, N Immorlica
Theoretical Computer Science 361 (2-3), 172-187, 2006
2572006
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
2562005
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
2412005
Cache-oblivious B-trees
MA Bender, ED Demaine, M Farach-Colton
Proceedings 41st Annual Symposium on Foundations of Computer Science, 399-409, 2000
2232000
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
2232000
Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
ED Demaine, ML Demaine
Graphs and Combinatorics 23 (1), 195-208, 2007
2192007
Playing games with algorithms: Algorithmic combinatorial game theory
ED Demaine
International Symposium on Mathematical Foundations of Computer Science, 18-33, 2001
2192001
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 (4), 593-604, 2005
2172005
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
2152013
Straightening polygonal arcs and convexifying polygonal cycles
R Connelly, ED Demaine, G Rote
Proceedings 41st Annual Symposium on Foundations of Computer Science, 432-442, 2000
2062000
Games, puzzles, and computation
RA Hearn, ED Demaine
CRC Press, 2009
1982009
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20