On the computational complexity of portal and push-pull block puzzles by Lynch, Jayson (Jayson R.)

Get full text

A framework for proving the computational intractability of motion planning problems by Lynch, Jayson(Jayson R.)

Get full text

The computational complexity of portal and other 3D video games by Demaine, Erik, Lynch, Jayson, Lockhart, Joshua

Get full text

Toward an Energy Efficient Language and Compiler for (Partially) Reversible Algorithms by Tyagi, Nirvan, Lynch, Jayson R., Demaine, Erik D

Get full text
Get full text
Get full text

Push-Pull Block Puzzles are Hard by Demaine, Erik D, Grosof, Isaac B., Lynch, Jayson R.

Get full text

Toward a general complexity theory of motion planning: Characterizing which gadgets make games hard by Demaine, Erik D, Hendrickson, Dylan H., Lynch, Jayson R.

Get full text

Energy-Efficient Algorithms by Demaine, Erik D, Lynch, Jayson R., Mirano, Geronimo J., Tyagi, Nirvan

Get full text
Get full text
Get full text

Traversability, Reconfiguration, and Reachability in the Gadget Framework by Ani, Joshua, Demaine, Erik D., Diomidov, Yevhenii, Hendrickson, Dylan, Lynch, Jayson

Get full text

Fine-grained I/O complexity via reductions: new lower bounds, faster algorithms, and a time hierarchy by Williams, Virginia Vassilevska, Demaine, Erik, Lincoln, Andrea, Liu, Quanquan C., Lynch, Jayson

Get full text

Cookie Clicker by Demaine, Erik D, Ito, Hiro, Langerman, Stefan, Lynch, Jayson, Rudoy, Mikhail, Xiao, Kai

Get full text

Mario Kart Is Hard by Waingarten, Erik, Bosboom, Jeffrey William, Demaine, Erik D, Hesterberg, Adam Classen, Lynch, Jayson R.

Get full text
Get full text
Get full text
Get full text

Walking through doors is hard, even without staircases: Proving PSPACE-hardness via planar assemblies of door gadgets by Ani, Joshua, Bosboom, Jeffrey William, Demaine, Erik D, Diomidov, Y, Hendrickson, Dylan H., Lynch, Jayson

Get full text

Tetris is NP-hard even with O (1) Rows or Columns by Asif, Sualeh, Coulombe, Michael, Demaine, Erik D, Demaine, Martin L, Hesterberg, Adam, Lynch, Jayson, Singhal, Mihir

Get full text

Tatamibari is NP-complete by Adler, Aviv, Bosboom, Jeffrey William, Demaine, Erik D, Demaine, Martin L, Liu, Quanquan C., Lynch, Jayson R.

Get full text

PSPACE-completeness of Pulling Blocks to Reach a Goal by Ani, Joshua, Asif, Sualeh, Demaine, Erik D, Diomidov, Yevhenii, Hendrickson, Dylan, Lynch, Jayson, Scheffler, Sarah, Suhl, Adam

Get full text

Continuous Flattening of All Polyhedral Manifolds using Countably Infinite Creases by Abel, Zachary, Demaine, Erik D, Demaine, Martin L, Ku, Jason S, Lynch, Jayson, Itoh, Jin-ichi, Nara, Chie

Get full text

Who Needs Crossings? Hardness of Plane Graph Rigidity by Abel, Zachary R, Demaine, Erik D, Demaine, Martin L, Eisenstat, Sarah Charmian, Lynch, Jayson R., Schardl, Tao Benjamin

Get full text
Get full text
Get full text
Get full text
Get full text

Dissection with the Fewest Pieces is Hard, Even to Approximate by Manurangsi, Pasin, Bosboom, Jeffrey William, Demaine, Erik D, Demaine, Martin L, Lynch, Jayson R., Rudoy, Mikhail, Yodpinyanee, Anak

Get full text
Get full text
Get full text
Get full text

Total Tetris: Tetris with Monominoes, Dominoes, Trominoes, Pentominoes,... by Demaine, Erik D, Demaine, Martin L, Eisenstat, Sarah Charmian, Hesterberg, Adam Classen, Lincoln, Andrea I, Lynch, Jayson R.

Get full text

Closing the Gap Between Cache-oblivious and Cache-adaptive Analysis by Bender, Michael, Chowdhury, Rezaul, Das, Rathish, Johnson, Rob, Kuszmaul, William, Lincoln, Andrea, Liu, Quanquan, Lynch, Jayson, Xu, Helen

Get full text