Jayson Lynch

ORCID

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 104

Top Venues

Publications

MIT CompGeom Group, Hugo A. Akitaya, Erik D. Demaine, Adam Hesterberg, Anna Lubiw, Jayson Lynch, Joseph O'Rourke, Frederick Stock
Super Guarding and Dark Rays in Art Galleries. CoRR (2024)
Hayashi Ani, Josh Brunner, Erik D. Demaine, Jenny Diomidova, Timothy Gomez, Della H. Hendrickson, Yael Kirkpatrick, Jeffery Li, Jayson Lynch, Ritam Nag, Frederick Stock
Agent Motion Planning as Block Asynchronous Cellular Automata: Pushing, Pulling, Suplexing, and More. UCNC (2024)
Joseph O'Rourke, Hugo A. Akitaya, Erik D. Demaine, Adam Hesterberg, Anna Lubiw, Jayson Lynch, Frederick Stock
Super Guarding and Dark Rays in Art Galleries. CCCG (2023)
Joshua Ani, Michael J. Coulombe, Erik D. Demaine, Yevhenii Diomidov, Timothy Gomez, Dylan H. Hendrickson, Jayson Lynch
Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter Machines. SAND (2023)
Joshua Ani, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets. Theor. Comput. Sci. 969 (2023)
Robert M. Alaniz, Josh Brunner, Michael J. Coulombe, Erik D. Demaine, Yevhenii Diomidov, Ryan Knobel, Timothy Gomez, Elise Grizzell, Jayson Lynch, Andrew Rodriguez, Robert T. Schweller, Tim Wylie
Complexity of Reconfiguration in Surface Chemical Reaction Networks. CoRR (2023)
Joshua Ani, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch
Traversability, Reconfiguration, and Reachability in the Gadget Framework. Algorithmica 85 (11) (2023)
Josh Brunner, Lily Chung, Michael J. Coulombe, Erik D. Demaine, Timothy Gomez, Jayson Lynch
Complexity of Solo Chess with Unlimited Moves. CoRR (2023)
Aviv Adler, Joshua Ani, Lily Chung, Michael J. Coulombe, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch
This Game Is Not Going To Analyze Itself. CoRR (2023)
MIT CompGeom Group, Zachary Abel, Hugo A. Akitaya, Erik D. Demaine, Adam C. Hesterberg, Jayson Lynch
When Can You Tile an Integer Rectangle with Integer Squares? CoRR (2023)
Robert M. Alaniz, Josh Brunner, Michael J. Coulombe, Erik D. Demaine, Jenny Diomidova, Timothy Gomez, Elise Grizzell, Ryan Knobel, Jayson Lynch, Andrew Rodriguez, Robert T. Schweller, Tim Wylie
Complexity of Reconfiguration in Surface Chemical Reaction Networks. DNA (2023)
Iddo Drori, Sarah J. Zhang, Zad Chin, Reece Shuttleworth, Albert Lu, Linda Chen, Bereket Birbo, Michele He, Pedro Lantigua, Sunny Tran, Gregory Hunter, Bo Feng, Newman Cheng, Roman Wang, Yann Hicke, Saisamrit Surbehera, Arvind Raghavan, Alexander E. Siemenn, Nikhil Singh, Jayson Lynch, Avi Shporer, Nakul Verma, Tonio Buonassisi, Armando Solar-Lezama
A Dataset for Learning University STEM Courses at Scale and Generating Questions at a Human Level. AAAI (2023)
Joshua Ani, Michael J. Coulombe, Erik D. Demaine, Yevhenii Diomidov, Timothy Gomez, Dylan H. Hendrickson, Jayson Lynch
Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter Machines. CoRR (2023)
Joshua Ani, Lily Chung, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch
Pushing Blocks via Checkable Gadgets: PSPACE-Completeness of Push-1F and Block/Box Dude. FUN (2022)
Joshua Ani, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
Trains, Games, and Complexity: 0/1/2-Player Motion Planning Through Input/Output Gadgets. WALCOM (2022)
Joshua Ani, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch
Traversability, Reconfiguration, and Reachability in the Gadget Framework. CoRR (2022)
Erik D. Demaine, Hiro Ito, Jayson Lynch, Ryuhei Uehara
Computational Complexity of Flattening Fixed-Angle Orthogonal Chains. CCCG (2022)
Erik D. Demaine, Robert A. Hearn, Dylan H. Hendrickson, Jayson Lynch
PSPACE-Completeness of Reversible Deterministic Systems. CoRR (2022)
Erik D. Demaine, Hiro Ito, Jayson Lynch, Ryuhei Uehara
Computational Complexity of Flattening Fixed-Angle Orthogonal Chains. CoRR (2022)
Michael J. Coulombe, Jayson Lynch
Characterizing the Decidability of Finite State Automata Team Games with Communication. GandALF (2022)
Erik D. Demaine, Robert A. Hearn, Dylan H. Hendrickson, Jayson Lynch
PSPACE-Completeness of Reversible Deterministic Systems. MCU (2022)
Joshua Ani, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch
Traversability, Reconfiguration, and Reachability in the Gadget Framework. WALCOM (2022)
Oswin Aichholzer, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Zuzana Masárová, Mikhail Rudoy, Virginia Vassilevska Williams, Nicole Wein
Hardness of Token Swapping on Trees. ESA (2022)
Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
Lower Bounds on Retroactive Data Structures. ISAAC (2022)
Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
Lower Bounds on Retroactive Data Structures. CoRR (2022)
Jeffrey Bosboom, Josh Brunner, Michael J. Coulombe, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch, Elle Najt
The Legend of Zelda: The Complexity of Mechanics. CoRR (2022)
Oswin Aichholzer, Brad Ballinger, Therese Biedl, Mirela Damian, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Josef Tkadlec, Yushi Uno
Reconfiguration of Non-crossing Spanning Trees. CoRR (2022)
Zachary Abel, Erik D. Demaine, Martin L. Demaine, Jason S. Ku, Jayson Lynch, Jin-ichi Itoh, Chie Nara
Continuous Flattening of All Polyhedral Manifolds using Countably Infinite Creases. CoRR (2021)
Erik D. Demaine, Jayson Lynch, Mikhail Rudoy, Yushi Uno
Yin-Yang Puzzles are NP-complete. CoRR (2021)
Erik D. Demaine, Jayson Lynch, Jiaying Sun
An Efficient Reversible Algorithm for Linear Regression. ICRC (2021)
Therese C. Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani
Optimal-area visibility representations of outer-1-plane graphs. CoRR (2021)
Therese C. Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani
Generalized LR-drawings of trees. CoRR (2021)
Rathish Das, Andrea Lincoln, Jayson Lynch, J. Ian Munro
Dynamic Boolean Formula Evaluation. ISAAC (2021)
Hugo A. Akitaya, Erik D. Demaine, Andrei Gonczi, Dylan H. Hendrickson, Adam Hesterberg, Matias Korman, Oliver Korten, Jayson Lynch, Irene Parada, Vera Sacristán
Characterizing Universal Reconfigurability of Modular Pivoting Robots. SoCG (2021)
Jayson Lynch, Yan Weng
The Computational Complexity of Finding Arithmetic Expressions With and Without Parentheses. CoRR (2021)
Oswin Aichholzer, Erik D. Demaine, Matias Korman, Jayson Lynch, Anna Lubiw, Zuzana Masárová, Mikhail Rudoy, Virginia Vassilevska Williams, Nicole Wein
Hardness of Token Swapping on Trees. CoRR (2021)
Erik D. Demaine, Jayson Lynch, Mikhail Rudoy, Yushi Uno
Yin-Yang Puzzles are NP-complete. CCCG (2021)
Jayson Lynch, Jiaying Sun
An Efficient Reversible Algorithm for Linear Regression. CoRR (2021)
Therese C. Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani
Generalized LR-Drawings of Trees. CCCG (2021)
Erik D. Demaine, Adam Hesterberg, Frederic Koehler, Jayson Lynch, John C. Urschel
Multidimensional Scaling: Approximation and Complexity. CoRR (2021)
Erik D. Demaine, Adam Hesterberg, Frederic Koehler, Jayson Lynch, John C. Urschel
Multidimensional Scaling: Approximation and Complexity. ICML (2021)
Zachary Abel, Hugo A. Akitaya, Man-Kwun Chiu, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Matias Korman, Jayson Lynch, André van Renssen, Marcel Roeloffzen
Snipperclips: Cutting tools into desired polygons using themselves. Comput. Geom. 98 (2021)
Joshua Ani, Jeffrey Bosboom, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch
Walking Through Doors Is Hard, Even Without Staircases: Proving PSPACE-Hardness via Planar Assemblies of Door Gadgets. FUN (2021)
Sunny Tran, Pranav Krishna, Ishan Pakuwal, Prabhakar Kafle, Nikhil Singh, Jayson Lynch, Iddo Drori
Solving Machine Learning Problems. ACML (2021)
Therese C. Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani
Optimal-Area Visibility Representations of Outer-1-Plane Graphs. Graph Drawing (2021)
Zachary Abel, Erik D. Demaine, Martin L. Demaine, Jason S. Ku, Jayson Lynch, Jin-ichi Itoh, Chie Nara
Continuous flattening of all polyhedral manifolds using countably infinite creases. Comput. Geom. 98 (2021)
Aviv Adler, Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Quanquan C. Liu, Jayson Lynch
Tatamibari Is NP-Complete. FUN (2021)
Zachary Abel, Hugo A. Akitaya, Man-Kwun Chiu, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Matias Korman, Jayson Lynch, André van Renssen, Marcel Roeloffzen
Snipperclips: Cutting Tools into Desired Polygons using Themselves. CoRR (2021)
Iddo Drori, Sunny Tran, Roman Wang, Newman Cheng, Kevin Liu, Leonard Tang, Elizabeth Ke, Nikhil Singh, Taylor L. Patti, Jayson Lynch, Avi Shporer, Nakul Verma, Eugene Wu, Gilbert Strang
A Neural Network Solves and Generates Mathematics Problems by Program Synthesis: Calculus, Differential Equations, Linear Algebra, and More. CoRR (2021)
Sunny Tran, Pranav Krishna, Ishan Pakuwal, Prabhakar Kafle, Nikhil Singh, Jayson Lynch, Iddo Drori
Solving Machine Learning Problems. CoRR (2021)
Sualeh Asif, Michael J. Coulombe, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Jayson Lynch, Mihir Singhal
(1) Rows or Columns. J. Inf. Process. 28 (2020)
Michael Hoffmann, Jayson Lynch, Andrew Winslow
Mad Science is Provably Hard: Puzzles in Hearthstone's Boomsday Lab are NP-hard. CoRR (2020)
Michael A. Bender, Rezaul Alam Chowdhury, Rathish Das, Rob Johnson, William Kuszmaul, Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Helen Xu
Closing the Gap Between Cache-oblivious and Cache-adaptive Analysis. SPAA (2020)
Sualeh Asif, Michael J. Coulombe, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Jayson Lynch, Mihir Singhal
Tetris is NP-hard even with $O(1)$ rows or columns. CoRR (2020)
Leo Alcock, Sualeh Asif, Jeffrey Bosboom, Josh Brunner, Charlotte Chen, Erik D. Demaine, Rogers Epstein, Adam Hesterberg, Lior Hirschfeld, William Hu, Jayson Lynch, Sarah Scheffler, Lillian Zhang
Arithmetic Expression Construction. CoRR (2020)
Joshua Ani, Jeffrey Bosboom, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch
Walking through Doors is Hard, even without Staircases: Proving PSPACE-hardness via Planar Assemblies of Door Gadgets. CoRR (2020)
Hugo A. Akitaya, Erik D. Demaine, Andrei Gonczi, Dylan H. Hendrickson, Adam Hesterberg, Matias Korman, Oliver Korten, Jayson Lynch, Irene Parada, Vera Sacristán
Characterizing Universal Reconfigurability of Modular Pivoting Robots. CoRR (2020)
Erik D. Demaine, Hiro Ito, Stefan Langerman, Jayson Lynch, Mikhail Rudoy, Kai Xiao
Cookie Clicker. Graphs Comb. 36 (2) (2020)
Michael Hoffmann, Jayson Lynch, Andrew Winslow
Mad Science is Provably Hard: Puzzles in Hearthstone's Boomsday Lab are NP-hard. J. Inf. Process. 28 (2020)
Erik D. Demaine, Justin Kopinsky, Jayson Lynch
Recursed is not Recursive: A Jarring Result. CoRR (2020)
Joshua Ani, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
Trains, Games, and Complexity: 0/1/2-Player Motion Planning through Input/Output Gadgets. CoRR (2020)
Hugo A. Akitaya, Erik D. Demaine, Jason S. Ku, Jayson Lynch, Csaba D. Tóth
2048 Without Merging. CCCG (2020)
Zachary Abel, Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Matias Korman, Jason S. Ku, Jayson Lynch
Negative Instance for the Edge Patrolling Beacon Problem. CoRR (2020)
Joshua Ani, Sualeh Asif, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch, Sarah Scheffler, Adam Suhl
PSPACE-completeness of Pulling Blocks to Reach a Goal. J. Inf. Process. 28 (2020)
Erik D. Demaine, Justin Kopinsky, Jayson Lynch
Recursed Is Not Recursive: A Jarring Result. ISAAC (2020)
Zachary Abel, Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Jason S. Ku, Jayson Lynch
Escaping a Polygon. CoRR (2020)
Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
Toward a General Complexity Theory of Motion Planning: Characterizing Which Gadgets Make Games Hard. ITCS (2020)
Aviv Adler, Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Quanquan C. Liu, Jayson Lynch
Tatamibari is NP-complete. CoRR (2020)
Zachary Abel, Jeffrey Bosboom, Michael J. Coulombe, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch, Mikhail Rudoy, Clemens Thielen
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible. Theor. Comput. Sci. 839 (2020)
Leo Alcock, Sualeh Asif, Jeffrey Bosboom, Josh Brunner, Charlotte Chen, Erik D. Demaine, Rogers Epstein, Adam Hesterberg, Lior Hirschfeld, William Hu, Jayson Lynch, Sarah Scheffler, Lillian Zhang
Arithmetic Expression Construction. ISAAC (2020)
Michael J. Coulombe, Jayson Lynch
Cooperating in video games? Impossible! Undecidability of Team Multiplayer Games. Theor. Comput. Sci. 839 (2020)
Joshua Ani, Sualeh Asif, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch, Sarah Scheffler, Adam Suhl
PSPACE-completeness of Pulling Blocks to Reach a Goal. CoRR (2020)
Rathish Das, Shih-Yu Tsai, Sharmila Duppala, Jayson Lynch, Esther M. Arkin, Rezaul Chowdhury, Joseph S. B. Mitchell, Steven Skiena
Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths. CoRR (2019)
Rathish Das, Shih-Yu Tsai, Sharmila Duppala, Jayson Lynch, Esther M. Arkin, Rezaul Chowdhury, Joseph S. B. Mitchell, Steven Skiena
Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths. SPAA (2019)
Divya Gopinath, Rohan Kodialam, Kevin Lu, Jayson Lynch, Santiago Ospina
Hamiltonicity in Semi-Regular Tessellation Dual Graphs. CoRR (2019)
Kaiying Hou, Jayson Lynch
The Computational Complexity of Finding Hamiltonian Cycles in Grid Graphs of Semiregular Tessellations. CCCG (2018)
Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Ferran Hurtado, Jason S. Ku, Jayson Lynch
Pachinko. Comput. Geom. 68 (2018)
Erik D. Demaine, Isaac Grosof, Jayson Lynch, Mikhail Rudoy
Computational Complexity of Motion Planning of a Robot through Simple Gadgets. FUN (2018)
Zachary Abel, Jeffrey Bosboom, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch, Mikhail Rudoy
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible. CoRR (2018)
Zachary Abel, Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Matias Korman, Jason S. Ku, Jayson Lynch
Negative Instance for the Edge Patrolling Beacon Problem. JCDCGGG (2018)
Erik D. Demaine, Isaac Grosof, Jayson Lynch, Mikhail Rudoy
Computational Complexity of Motion Planning of a Robot through Simple Gadgets. CoRR (2018)
Erik D. Demaine, Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Virginia Vassilevska Williams
Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy. ITCS (2018)
Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
A General Theory of Motion Planning Complexity: Characterizing Which Gadgets Make Games Hard. CoRR (2018)
Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Helen Xu
Cache-Adaptive Exploration: Experimental Results and Scan-Hiding for Adaptivity. SPAA (2018)
Erik D. Demaine, Joshua Lockhart, Jayson Lynch
The Computational Complexity of Portal and Other 3D Video Games. FUN (2018)
Jeffrey Bosboom, Spencer Congero, Erik D. Demaine, Martin L. Demaine, Jayson Lynch
Losing at Checkers is Hard. CoRR (2018)
Zachary Abel, Jeffrey Bosboom, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch, Mikhail Rudoy
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible. FUN (2018)
Kaiying Hou, Jayson Lynch
The Computational Complexity of Finding Hamiltonian Cycles in Grid Graphs of Semiregular Tessellations. CoRR (2018)
Erik D. Demaine, Hiro Ito, Stefan Langerman, Jayson Lynch, Mikhail Rudoy, Kai Xiao
Cookie Clicker. CoRR (2018)
Michael J. Coulombe, Jayson Lynch
Cooperating in Video Games? Impossible! Undecidability of Team Multiplayer Games. FUN (2018)
Erik D. Demaine, Isaac Grosof, Jayson Lynch
Push-Pull Block Puzzles are Hard. CIAC (2017)
Erik D. Demaine, Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Virginia Vassilevska Williams
Fine-Grained I/O Complexity via Reductions: New lower bounds, faster algorithms, and a time hierarchy. CoRR (2017)
Erik D. Demaine, Isaac Grosof, Jayson Lynch
Push-Pull Block Puzzles are Hard. CoRR (2017)
Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Adam Hesterberg, Andrea Lincoln, Jayson Lynch, Yun William Yu
Total Tetris: Tetris with Monominoes, Dominoes, Trominoes, Pentominoes, ... J. Inf. Process. 25 (2017)
Zachary Abel, Brad Ballinger, Erik D. Demaine, Martin L. Demaine, Jeff Erickson, Adam Hesterberg, Hiro Ito, Irina Kostitsyna, Jayson Lynch, Ryuhei Uehara
Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares. J. Inf. Process. 25 (2017)
Mirela Damian, Erik D. Demaine, Muriel Dulieu, Robin Y. Flatland, Hella Hoffman, Thomas C. Hull, Jayson Lynch, Suneeta Ramaswami
Minimal forcing sets for 1D origami. CoRR (2017)
Nirvan Tyagi, Jayson Lynch, Erik D. Demaine
Toward an Energy Efficient Language and Compiler for (Partially) Reversible Algorithms. RC (2016)
Michael A. Bender, Erik D. Demaine, Roozbeh Ebrahimi, Jeremy T. Fineman, Rob Johnson, Andrea Lincoln, Jayson Lynch, Samuel McCauley
Cache-Adaptive Analysis. SPAA (2016)
Erik D. Demaine, Jayson Lynch, Geronimo J. Mirano, Nirvan Tyagi
Energy-Efficient Algorithms. ITCS (2016)
Erik D. Demaine, Jayson Lynch, Geronimo J. Mirano, Nirvan Tyagi
Energy-Efficient Algorithms. CoRR (2016)

Jayson Lynch.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jayson Lynch