| Who needs crossings? Hardness of plane graph rigidity Z Abel, ED Demaine, ML Demaine, S Eisenstat, J Lynch, TB Schardl 32nd International Symposium on Computational Geometry (SoCG 2016), 2016 | 30 | 2016 |
| Computational complexity of motion planning of a robot through simple gadgets ED Demaine, I Grosof, J Lynch, M Rudoy arXiv preprint arXiv:1806.03539, 2018 | 29 | 2018 |
| Energy-efficient algorithms ED Demaine, J Lynch, GJ Mirano, N Tyagi Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016 | 28 | 2016 |
| A neural network solves, explains, and generates university math problems by program synthesis and few-shot learning at human level I Drori, S Zhang, R Shuttleworth, L Tang, A Lu, E Ke, K Liu, L Chen, S Tran, ... Proceedings of the National Academy of Sciences 119 (32), e2123433119, 2022 | 23 | 2022 |
| Toward a General Complexity Theory of Motion Planning: Characterizing Which Gadgets Make Games Hard ED Demaine, DH Hendrickson, J Lynch 11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 2020 | 21* | 2020 |
| Cache-adaptive analysis MA Bender, ED Demaine, R Ebrahimi, JT Fineman, R Johnson, A Lincoln, ... Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and …, 2016 | 17 | 2016 |
| Cooperating in video games? impossible! undecidability of team multiplayer games MJ Coulombe, J Lynch Theoretical Computer Science 839, 30-40, 2020 | 12 | 2020 |
| Tatamibari is NP-complete A Adler, J Bosboom, ED Demaine, ML Demaine, QC Liu, J Lynch arXiv preprint arXiv:2003.08331, 2020 | 12 | 2020 |
| Fine-grained I/O complexity via reductions: New lower bounds, faster algorithms, and a time hierarchy ED Demaine, A Lincoln, QC Liu, J Lynch, VV Williams arXiv preprint arXiv:1711.07960, 2017 | 12 | 2017 |
| Walking through doors is hard, even without staircases: Proving PSPACE-hardness via planar assemblies of door gadgets J Ani, J Bosboom, ED Demaine, Y Diomidov, D Hendrickson, J Lynch arXiv preprint arXiv:2006.01256, 2020 | 11 | 2020 |
| The computational complexity of Portal and other 3D video games ED Demaine, J Lockhart, J Lynch arXiv preprint arXiv:1611.10319, 2016 | 11 | 2016 |
| Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets J Ani, ED Demaine, D Hendrickson, J Lynch WALCOM: Algorithms and Computation: 16th International Conference and …, 2022 | 10 | 2022 |
| PSPACE-completeness of pulling blocks to reach a goal J Ani, S Asif, ED Demaine, Y Diomidov, D Hendrickson, J Lynch, ... Journal of Information Processing 28, 929-941, 2020 | 10 | 2020 |
| Mario kart is hard J Bosboom, ED Demaine, A Hesterberg, J Lynch, E Waingarten Discrete and Computational Geometry and Graphs: 18th Japan Conference …, 2016 | 10 | 2016 |
| Closing the gap between cache-oblivious and cache-adaptive analysis MA Bender, RA Chowdhury, R Das, R Johnson, W Kuszmaul, A Lincoln, ... Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and …, 2020 | 9 | 2020 |
| Toward an energy efficient language and compiler for (partially) reversible algorithms N Tyagi, J Lynch, ED Demaine Reversible Computation: 8th International Conference, RC 2016, Bologna …, 2016 | 9 | 2016 |
| Solving machine learning problems S Tran, P Krishna, I Pakuwal, P Kafle, N Singh, J Lynch, I Drori Asian Conference on Machine Learning, 470-485, 2021 | 8 | 2021 |
| Push-pull block puzzles are hard ED Demaine, I Grosof, J Lynch Algorithms and Complexity: 10th International Conference, CIAC 2017, Athens …, 2017 | 8 | 2017 |
| Finding a hamiltonian path in a cube with specified turns is hard Z Abel, ED Demaine, ML Demaine, S Eisenstat, J Lynch, TB Schardl Information and Media Technologies 8 (3), 685-694, 2013 | 8 | 2013 |
| Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible Z Abel, J Bosboom, M Coulombe, ED Demaine, L Hamilton, A Hesterberg, ... Theoretical Computer Science 839, 41-102, 2020 | 7 | 2020 |
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyVerified email at mit.edu
