Jayson Lynch
Jayson Lynch
Verified email at mit.edu
Cited by
Cited by
Energy-efficient algorithms
ED Demaine, J Lynch, GJ Mirano, N Tyagi
Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016
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
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
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
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
The computational complexity of Portal and other 3D video games
ED Demaine, J Lockhart, J Lynch
arXiv preprint arXiv:1611.10319, 2016
Push-pull block puzzles are hard
ED Demaine, I Grosof, J Lynch
International Conference on Algorithms and Complexity, 177-195, 2017
Cooperating in video games? impossible! undecidability of team multiplayer games
MJ Coulombe, J Lynch
Theoretical Computer Science, 2020
Toward an energy efficient language and compiler for (partially) reversible algorithms
N Tyagi, J Lynch, ED Demaine
International Conference on Reversible Computation, 121-136, 2016
Mario kart is hard
J Bosboom, ED Demaine, A Hesterberg, J Lynch, E Waingarten
Japanese Conference on Discrete and Computational Geometry and Graphs, 49-59, 2015
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
Unfolding and dissection of multiple cubes, tetrahedra, and doubly covered squares
Z Abel, B Ballinger, ED Demaine, ML Demaine, J Erickson, A Hesterberg, ...
Journal of Information Processing 25, 610-615, 2017
Folding equilateral plane graphs
Z Abel, ED Demaine, ML Demaine, S Eisenstat, J Lynch, TB Schardl, ...
International Journal of Computational Geometry & Applications 23 (02), 75-92, 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, 2020
PSPACE-completeness of Pulling Blocks to Reach a Goal
J Ani, S Asif, ED Demaine, Y Diomidov, D Hendrickson, J Lynch, ...
arXiv preprint arXiv:2006.04337, 2020
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
Data races and the discrete resource-time tradeoff problem with resource reuse over paths
R Das, SY Tsai, S Duppala, J Lynch, EM Arkin, R Chowdhury, ...
The 31st ACM Symposium on Parallelism in Algorithms and Architectures, 359-368, 2019
Toward a general theory of motion planning complexity: Characterizing which gadgets make games hard
ED Demaine, DH Hendrickson, J Lynch
arXiv, arXiv: 1812.03592, 2018
Cache-Adaptive Exploration: Experimental Results and Scan-Hiding for Adaptivity
A Lincoln, QC Liu, J Lynch, H Xu
Proceedings of the 30th on Symposium on Parallelism in Algorithms and …, 2018
The computational complexity of finding hamiltonian cycles in grid graphs of semiregular tessellations
K Hou, J Lynch
arXiv preprint arXiv:1805.03192, 2018
The system can't perform the operation now. Try again later.
Articles 1–20