Erik Demaine

Citata da

	Tutte	Dal 2019
Citazioni	26950	9172
Indice H	80	43
i10-index	372	211

1700

850

425

1275

200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024145 178 253 444 620 640 752 883 989 1029 1205 1223 1238 1367 1458 1556 1591 1622 1574 1600 1448 1591 1517 1431

Accesso pubblico

Visualizza tutto

74 articoli

1 articolo

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

Martin DemaineMITEmail verificata su mit.edu
MohammadTaghi HajiaghayiACM Fellow, Jack and Rita Minker Professor of Computer Science, University of Maryland, College ParkEmail verificata su cs.umd.edu
Joseph O'RourkeProfessor of Computer Science, Smith CollegeEmail verificata su smith.edu
Stefan LangermanDépartement d'Informatique, Université Libre de BruxellesEmail verificata su ulb.ac.be
Ryuhei UeharaJapan Advanced Institute of Science and TechnologyEmail verificata su jaist.ac.jp
Jayson LynchMITEmail verificata su mit.edu
John IaconoUniversité Libre de BruxellesEmail verificata su ulb.ac.be
Sándor P. FeketeTechnische Universität Braunschweig, L3S Research CenterEmail verificata su tu-bs.de
Anna LubiwProfessor, David R. Cheriton School of Computer Science, University of WaterlooEmail verificata su uwaterloo.ca
Ian MunroUniversity Professor, University of WaterlooEmail verificata su uwaterloo.ca
Michael A. BenderStony Brook UniversityEmail verificata su cs.stonybrook.edu
Therese BiedlUniversity of WaterlooEmail verificata su cs.uwaterloo.ca
Daniela RusAndrew (1956) and Erna Viterbi Professor of Computer Science, MITEmail verificata su csail.mit.edu
Jason S. KuLecturer, Massachusetts Institute of TechnologyEmail verificata su mit.edu
Alejandro Lopez-OrtizProfessor and Cheriton Chair, University of WaterlooEmail verificata su uwaterloo.ca
Tomohiro TachiProfessor, University of TokyoEmail verificata su idea.c.u-tokyo.ac.jp
Dimitrios M. ThilikosEmail verificata su thilikos.info
Mihai PatrascuAT&T LabsEmail verificata su alum.mit.edu
David EppsteinDistinguished Professor of Computer Science, University of California, IrvineEmail verificata su uci.edu
Joseph S. B. MitchellDistinguished Professor, Applied Mathematics and Computer Science, Stony Brook UniversityEmail verificata su stonybrook.edu

Segui

Erik Demaine

Professor of Electrical Engineering and Computer Science, Massachusetts Institute of Technology

Email verificata su mit.edu - Home page

algorithms computational geometry data structures graph algorithms recreational algorithms


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
A method for building self-folding machines S Felton, M Tolley, E Demaine, D Rus, R Wood Science 345 (6197), 644-646, 2014	1095	2014
Geometric folding algorithms: linkages, origami, polyhedra ED Demaine, J O'Rourke Cambridge university press, 2007	1082	2007
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	806	2010
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	780	2003
Frequency estimation of internet packet streams with limited space ED Demaine, A López-Ortiz, JI Munro European Symposium on Algorithms, 348-360, 2002	638	2002
Correlation clustering in general weighted graphs ED Demaine, D Emanuel, A Fiat, N Immorlica Theoretical Computer Science 361 (2-3), 172-187, 2006	426	2006
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	407	2005
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	396	2005
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	386	2005
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	382	2005
Games, puzzles, and computation RA Hearn, ED Demaine CRC Press, 2009	359	2009
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	329	2013
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	322	2011
Representing trees of higher degree D Benoit, ED Demaine, JI Munro, R Raman, V Raman, SS Rao Algorithmica 43, 275-292, 2005	303	2005
Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity ED Demaine, ML Demaine Graphs and Combinatorics 23 (Suppl 1), 195-208, 2007	294	2007
Playing games with algorithms: Algorithmic combinatorial game theory ED Demaine International Symposium on Mathematical Foundations of Computer Science, 18-33, 2001	287	2001
Cache-oblivious B-trees MA Bender, ED Demaine, M Farach-Colton Proceedings 41st Annual Symposium on Foundations of Computer Science, 399-409, 2000	285	2000
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	281	2005
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	259	2000
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	237	2005

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori