Erik D. Demaine

Computer Networks and Communications · 2000–2014

A researcher in the Science corpus: 13 papers; trusts 18 researchers and is trusted by 25 researchers here, as inferred from the citation graph.

Subfields

• Computer Networks and Communications — 27 citations into it; #2,084 of 9,886 by trust here, #4,277 by citations
• Electrical and Electronic Engineering — 25 citations into it; #13,661 of 16,539 by trust here, #13,963 by citations
• Artificial Intelligence — 11 citations into it; #16,338 of 35,345 by trust here, #31,361 by citations
• Ocean Engineering — 9 citations into it; #2,744 of 3,193 by trust here, #2,290 by citations
• Algorithms & Complexity — 6 citations into it

Whom Erik D. Demaine trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Rajeev Motwani
2. Moses Charikar
3. Ratul Mahajan
4. Omer Reingold
5. Nikhil Bansal
6. Chris Savarese
7. Kiri L. Wagstaff
8. Sally Floyd
9. Kevin C. Chen
10. Dragos Stefan Niculescu

Who trusts Erik D. Demaine overall

1. Graham Cormode
2. Arvind Arasu
3. Bodhi Priyantha
4. Sudipto Guha
5. James S. Cybulski
6. T-H. Hubert Chan
7. Luis Cereceda
8. Siyu Tang
9. Ahmed Metwally
10. Alec Woo

Papers from Erik D. Demaine's perspective

Ordered by how strongly the researchers Erik D. Demaine trusts endorse each paper. Same corpus, a different order for every researcher.

1. Convex position estimation in wireless sensor networks (Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213))
2. A scalable location service for geographic ad hoc routing (ACM/IEEE International Conference on Mobile Computing and Networking)
3. GPS-less low-cost outdoor localization for very small devices (IEEE wireless communications)
4. Directed diffusion: a scalable and robust communication paradigm for sensor networks (ACM/IEEE International Conference on Mobile Computing and Networking)
5. Dynamic fine-grained localization in Ad-Hoc networks of sensors (ACM/IEEE International Conference on Mobile Computing and Networking)
6. Primal-dual approximation algorithms for metric facility location and k-median problems
7. AND T
8. GPS-free Positioning in Mobile Ad Hoc Networks (Proceedings of the Annual Hawaii International Conference on System Sciences)
9. Finding frequent items in data streams
10. Location in distributed ad-hoc wireless sensor networks (2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221))

Their papers

• Programmable matter by folding (2010) — 631 citations
• A method for building self-folding machines (2014) — 944 citations
• Self-folding with shape memory composites† (2013) — 275 citations
• Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs (2005) — 337 citations
• Mobile-assisted localization in wireless sensor networks (2005) — 317 citations
• Correlation clustering in general weighted graphs (2006) — 359 citations
• PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation (2002) — 330 citations
• Geometric Folding Algorithms: The Tree Method (2007) — 588 citations
• Tight bounds for the partial-sums problem (2004) — 61 citations
• Anchor-Free Distributed Localization in Sensor Networks (2003) — 550 citations
• Blowing Up Polygonal Linkages (2003) — 53 citations
• Frequency Estimation of Internet Packet Streams with Limited Space (2002) — 525 citations
• Cache-oblivious B-trees (2000) — 345 citations