Erik Demaine

Erik D. Demaine (born February 28, 1981) is a Canadian-American professor of computer science at the Massachusetts Institute of Technology and a former child prodigy. Provided by Wikipedia
Showing 1 - 20 results of 234 for search 'Demaine, Erik', query time: 0.05s Refine Results
  1. 1
    Coordinated motion planning: Reconfiguring a swarm of labeled robots with bounded stretch

    Coordinated motion planning: Reconfiguring a swarm of labeled robots with bounded stretch by Demaine, Erik

    Published 2021
    Get full text
    Article
  2. 2
    Computational complexity of motion planning of a robot through simple gadgets

    Computational complexity of motion planning of a robot through simple gadgets by Demaine, Erik

    Published 2021
    Get full text
    Article
  3. 3
    Computational complexity of generalized push fight

    Computational complexity of generalized push fight by Demaine, Erik

    Published 2021
    Get full text
    Article
  4. 4
    Reconfiguration of satisfying assignments and subset sums: Easy to find, hard to connect

    Reconfiguration of satisfying assignments and subset sums: Easy to find, hard to connect by Demaine, Erik D

    Published 2020
    Get full text
    Article
  5. 5
    Universal reconfiguration of facet-connected modular robots by pivots: The O(1) musketeers

    Universal reconfiguration of facet-connected modular robots by pivots: The O(1) musketeers by Demaine, Erik D

    Published 2020
    Get full text
    Article
  6. 6
    Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs

    Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs by Demaine, Erik D

    Published 2021
    Get full text
    Article
  7. 7
    Simulation of Programmable Matter Systems Using Active Tile-Based Self-Assembly

    Simulation of Programmable Matter Systems Using Active Tile-Based Self-Assembly by Demaine, Erik D

    Published 2021
    Get full text
    Article
  8. 8
    Origamizer: A practical algorithm for folding any polyhedron

    Origamizer: A practical algorithm for folding any polyhedron by Demaine, Erik, Tachi, Tomohiro

    Published 2021
    Get full text
    Article
  9. 9
    Origamizer: A practical algorithm for folding any polyhedron

    Origamizer: A practical algorithm for folding any polyhedron by Demaine, Erik, Tachi, Tomohiro

    Published 2021
    Get full text
    Article
  10. 10
    Tree-residue vertex-breaking: A new tool for proving hardness

    Tree-residue vertex-breaking: A new tool for proving hardness by Demaine, Erik, Rudoy, Mikhail

    Published 2021
    Get full text
    Article
  11. 11
    6.851 Advanced Data Structures, Spring 2010

    6.851 Advanced Data Structures, Spring 2010 by Demaine, Erik, Schulz, André

    Published 2010
    Get full text
  12. 12
    Embedding Stacked Polytopes on a Polynomial-Size Grid

    Embedding Stacked Polytopes on a Polynomial-Size Grid by Schulz, André, Demaine, Erik D

    Published 2017
    Get full text
    Get full text
    Article
  13. 13
    Folding Flat Crease Patterns With Thick Materials

    Folding Flat Crease Patterns With Thick Materials by Ku, Jason S, Demaine, Erik D

    Published 2017
    Get full text
    Get full text
    Get full text
    Article
  14. 14
    Bust-a-Move/Puzzle Bobble Is NP-complete

    Bust-a-Move/Puzzle Bobble Is NP-complete by Langerman, Stefan, Demaine, Erik D

    Published 2017
    Get full text
    Get full text
    Article
  15. 15
    Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs

    Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs by Demaine, Erik D, Liu, Quanquan

    Published 2019
    Get full text
    Article
  16. 16
    Rigid foldability is NP-hard

    Rigid foldability is NP-hard by Demaine, Erik D, Ku, Jason S

    Published 2020
    Get full text
    Article
  17. 17
    Symmetric assembly puzzles are hard, beyond a few pieces

    Symmetric assembly puzzles are hard, beyond a few pieces by Demaine, Erik D, Ku, Jason S

    Published 2020
    Get full text
    Article
  18. 18
    Folded Structures Satisfying Multiple Conditions

    Folded Structures Satisfying Multiple Conditions by Demaine, Erik D, Ku, Jason S

    Published 2021
    Get full text
    Article
  19. 19
    A simple proof that the (n2 − 1)-puzzle is hard

    A simple proof that the (n2 − 1)-puzzle is hard by Demaine, Erik D, Rudoy, Mikhail

    Published 2021
    Get full text
    Article
  20. 20
    A simple proof that the (n2 − 1)-puzzle is hard

    A simple proof that the (n2 − 1)-puzzle is hard by Demaine, Erik D, Rudoy, Mikhail

    Published 2022
    Get full text
    Article

Search Tools: