Jayson Lynch - RankMe

142 papers A* 4A 5B 13C 4Misc 7Journal 89Unranked 19

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	All Polyhedral Manifolds are Connected by a 2-Step Refolding. J. Inf. Process. Lily Chung, Erik D. Demaine, Jenny Diomidova, Tonan Kamata, Jayson Lynch, Ryuhei Uehara, Hanyu Alice Zhang
2025	J	`jnl`	EnigmaEval: A Benchmark of Long Multimodal Reasoning Challenges. CoRR Clinton J. Wang, Dean Lee, Cristina Menghini, Johannes Mols, Jack Doughty, Adam Khoja, Jayson Lynch, Sean Hendryx, Summer Yue, Dan Hendrycks
2025	J	`jnl`	EvilGenie: A Reward Hacking Benchmark. CoRR Jonathan Gabor, Jayson Lynch, Jonathan Rosenfeld
2025	J	`jnl`	Folding One Polyhedral Metric Graph into Another. J. Inf. Process. Lily Chung, Erik D. Demaine, Martin L. Demaine, Markus Hecher, Rebecca Lin, Jayson Lynch, Chie Nara
2025	—	`conf`	Hardness of Traversing Gadget Systems with Small Bandwidth. SAND MIT Gadgets Group, Erik D. Demaine, Jenny Diomidova, Timothy Gomez, Markus Hecher, Jayson Lynch
2025	J	`jnl`	How fast are algorithms reducing the demands on memory? A survey of progress in space complexity. CoRR Hayden Rome, Jayson Lynch, Jeffery Li, Chirag Falor, Neil Thompson
2025	J	`jnl`	Meek Models Shall Inherit the Earth. CoRR Hans Gundlach, Jayson Lynch, Neil Thompson
2025	J	`jnl`	On the Origin of Algorithmic Progress in AI. CoRR Hans Gundlach, Alex Fogelson, Jayson Lynch, Ana Trisovic, Jonathan Rosenfeld, Anmol Sandhu, Neil C. Thompson
2025	J	`jnl`	PSPACE-Completeness of Reversible Deterministic Systems. Int. J. Found. Comput. Sci. Erik D. Demaine, Robert A. Hearn, Dylan H. Hendrickson, Jayson Lynch
2025	J	`jnl`	Pushing Blocks without Fixed Blocks via Checkable Gizmos: Push-1 is PSPACE-Complete. CoRR Josh Brunner, Lily Chung, Erik D. Demaine, Jenny Diomidova, Della H. Hendrickson, Jayson Lynch
2025	J	`jnl`	Quantum Deep Learning Still Needs a Quantum Leap. CoRR Hans Gundlach, Hrvoje Kukina, Jayson Lynch, Neil Thompson
2025	—	`conf`	Quasigeodesics on the Cube. CCCG MIT CompGeom Group, Hugo A. Akitaya, Erik D. Demaine, Adam Hesterberg, Thomas C. Hull, Anna Lubiw, Jayson Lynch, Klara Mundilova, Chie Nara, Joseph O'Rourke, Frederick Stock, Josef Tkadlec, Ryuhei Uehara
2025	J	`jnl`	Slant/Gokigen Naname is NP-complete, and Some Variations are in P. CoRR Jayson Lynch, Jack Spalding-Jamieson
2025	J	`jnl`	Subquadratic Approximation Algorithms for Separating Two Points with Objects in the Plane. CoRR Jayson Lynch, Jack Spalding-Jamieson
2025	J	`jnl`	The Price of Progress: Algorithmic Efficiency and the Falling Cost of AI Inference. CoRR Hans Gundlach, Jayson Lynch, Matthias Mertens, Neil Thompson
2025	J	`jnl`	Undecidability of Tiling with a Tromino. CoRR Zachary Abel, Hugo A. Akitaya, Lily Chung, Erik D. Demaine, Jenny Diomidova, Della H. Hendrickson, Stefan Langerman, Jayson Lynch
2025	J	`jnl`	Who Needs Crossings?: Noncrossing Linkages are Universal, and Deciding (Global) Rigidity is Hard. CoRR Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl
2025	J	`jnl`	Who needs crossings?: Noncrossing linkages are universal, and deciding (global) rigidity is hard. J. Comput. Geom. Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl
2024	—	`conf`	Agent Motion Planning as Block Asynchronous Cellular Automata: Pushing, Pulling, Suplexing, and More. UCNC Hayashi Ani, Josh Brunner, Erik D. Demaine, Jenny Diomidova, Timothy Gomez, Della H. Hendrickson, Yael Kirkpatrick, Jeffery Li, Jayson Lynch, Ritam Nag, Frederick Stock
2024	J	`jnl`	All Polyhedral Manifolds are Connected by a 2-Step Refolding. CoRR Lily Chung, Erik D. Demaine, Jenny Diomidova, Tonan Kamata, Jayson Lynch, Ryuhei Uehara, Hanyu Alice Zhang
2024	B	`conf`	Domain-Based Nucleic-Acid Minimum Free Energy: Algorithmic Hardness and Parameterized Bounds. DNA Erik D. Demaine, Timothy Gomez, Elise Grizzell, Markus Hecher, Jayson Lynch, Robert Schweller, Ahmed Shalaby, Damien Woods
2024	—	`conf`	Figuring Figures: An assessment of large language models on different modalities of math word problems. ICMLT Yan Wang, Jayson Lynch, Elizabeth Krueger
2024	J	`jnl`	Folding One Polyhedral Metric Graph into Another. CoRR Lily Chung, Erik D. Demaine, Martin L. Demaine, Markus Hecher, Rebecca Lin, Jayson Lynch, Chie Nara
2024	J	`jnl`	Optimal-area visibility representations of outer-1-plane graphs. J. Comput. Geom. Therese Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani
2024	J	`jnl`	Pushing Blocks via Checkable Gadgets: PSPACE-completeness of Push-1F and Block/Box Dude. CoRR Hayashi Ani, Lily Chung, Erik D. Demaine, Jenny Diomidova, Della H. Hendrickson, Jayson Lynch
2024	J	`jnl`	Reconfiguration of non-crossing spanning trees. J. Comput. Geom. Oswin Aichholzer, Brad Ballinger, Therese Biedl, Mirela Damian, Erik D. Demaine, Adam Hesterberg, Matias Korman, Anna Lubiw, Jayson Lynch, Josef Tkadlec, Yushi Uno
2024	—	`conf`	Slant/Gokigen Naname is NP-complete. CCCG Jayson Lynch, Jack Spalding-Jamieson
2024	J	`jnl`	Super Guarding and Dark Rays in Art Galleries. CoRR MIT CompGeom Group, Hugo A. Akitaya, Erik D. Demaine, Adam Hesterberg, Anna Lubiw, Jayson Lynch, Joseph O'Rourke, Frederick Stock
2023	A*	`conf`	A Dataset for Learning University STEM Courses at Scale and Generating Questions at a Human Level. AAAI 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
2023	—	`conf`	Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter Machines. SAND Joshua Ani, Michael J. Coulombe, Erik D. Demaine, Jenny Diomidova, Timothy Gomez, Dylan H. Hendrickson, Jayson Lynch
2023	J	`jnl`	Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter Machines. CoRR Joshua Ani, Michael J. Coulombe, Erik D. Demaine, Jenny Diomidova, Timothy Gomez, Dylan H. Hendrickson, Jayson Lynch
2023	B	`conf`	Complexity of Reconfiguration in Surface Chemical Reaction Networks. DNA Robert M. Alaniz, Josh Brunner, Michael J. Coulombe, Erik D. Demaine, Jenny Diomidova, Timothy Gomez, Elise Grizzell, Ryan Knobel, Jayson Lynch, Andrew Rodriguez, Robert Schweller, Tim Wylie
2023	J	`jnl`	Complexity of Reconfiguration in Surface Chemical Reaction Networks. CoRR Robert M. Alaniz, Josh Brunner, Michael J. Coulombe, Erik D. Demaine, Jenny Diomidova, Ryan Knobel, Timothy Gomez, Elise Grizzell, Jayson Lynch, Andrew Rodriguez, Robert Schweller, Tim Wylie
2023	J	`jnl`	Complexity of Solo Chess with Unlimited Moves. CoRR Josh Brunner, Lily Chung, Michael J. Coulombe, Erik D. Demaine, Timothy Gomez, Jayson Lynch
2023	—	`conf`	Super Guarding and Dark Rays in Art Galleries. CCCG Joseph O'Rourke, Hugo A. Akitaya, Erik D. Demaine, Adam Hesterberg, Anna Lubiw, Jayson Lynch, Frederick Stock
2023	J	`jnl`	This Game Is Not Going To Analyze Itself. CoRR Aviv Adler, Joshua Ani, Lily Chung, Michael J. Coulombe, Erik D. Demaine, Jenny Diomidova, Dylan H. Hendrickson, Jayson Lynch
2023	J	`jnl`	Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets. Theor. Comput. Sci. Joshua Ani, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
2023	J	`jnl`	Traversability, Reconfiguration, and Reachability in the Gadget Framework. Algorithmica Joshua Ani, Erik D. Demaine, Jenny Diomidova, Dylan H. Hendrickson, Jayson Lynch
2023	J	`jnl`	When Can You Tile an Integer Rectangle with Integer Squares? CoRR MIT CompGeom Group, Zachary Abel, Hugo A. Akitaya, Erik D. Demaine, Adam C. Hesterberg, Jayson Lynch
2022	—	`conf`	Characterizing the Decidability of Finite State Automata Team Games with Communication. GandALF Michael J. Coulombe, Jayson Lynch
2022	—	`conf`	Complexity of Solo Chess with Unlimited Moves. JCDCGGG Josh Brunner, Lily Chung, Michael J. Coulombe, Erik D. Demaine, Timothy Gomez, Jayson Lynch
2022	—	`conf`	Computational Complexity of Flattening Fixed-Angle Orthogonal Chains. CCCG Erik D. Demaine, Hiro Ito, Jayson Lynch, Ryuhei Uehara
2022	J	`jnl`	Computational Complexity of Flattening Fixed-Angle Orthogonal Chains. CoRR Erik D. Demaine, Hiro Ito, Jayson Lynch, Ryuhei Uehara
2022	A	`conf`	Hardness of Token Swapping on Trees. ESA Oswin Aichholzer, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Zuzana Masárová, Mikhail Rudoy, Virginia Vassilevska Williams, Nicole Wein
2022	B	`conf`	Lower Bounds on Retroactive Data Structures. ISAAC Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
2022	J	`jnl`	Lower Bounds on Retroactive Data Structures. CoRR Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
2022	C	`conf`	PSPACE-Completeness of Reversible Deterministic Systems. MCU Erik D. Demaine, Robert A. Hearn, Dylan H. Hendrickson, Jayson Lynch
2022	J	`jnl`	PSPACE-Completeness of Reversible Deterministic Systems. CoRR Erik D. Demaine, Robert A. Hearn, Dylan H. Hendrickson, Jayson Lynch
2022	Misc	`conf`	Pushing Blocks via Checkable Gadgets: PSPACE-Completeness of Push-1F and Block/Box Dude. FUN Joshua Ani, Lily Chung, Erik D. Demaine, Jenny Diomidova, Dylan H. Hendrickson, Jayson Lynch
2022	J	`jnl`	Reconfiguration of Non-crossing Spanning Trees. CoRR Oswin Aichholzer, Brad Ballinger, Therese Biedl, Mirela Damian, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Josef Tkadlec, Yushi Uno
2022	J	`jnl`	The Legend of Zelda: The Complexity of Mechanics. CoRR Jeffrey Bosboom, Josh Brunner, Michael J. Coulombe, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch, Elle Najt
2022	—	`conf`	This Game Is Not Going To Analyze Itself. JCDCGGG Aviv Adler, Hayashi Layers, Lily Chung, Michael J. Coulombe, Erik D. Demaine, Jenny Diomidova, Della H. Hendrickson, Jayson Lynch
2022	B	`conf`	Trains, Games, and Complexity: 0/1/2-Player Motion Planning Through Input/Output Gadgets. WALCOM Joshua Ani, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
2022	B	`conf`	Traversability, Reconfiguration, and Reachability in the Gadget Framework. WALCOM Joshua Ani, Erik D. Demaine, Jenny Diomidova, Dylan H. Hendrickson, Jayson Lynch
2022	J	`jnl`	Traversability, Reconfiguration, and Reachability in the Gadget Framework. CoRR Joshua Ani, Erik D. Demaine, Jenny Diomidova, Dylan H. Hendrickson, Jayson Lynch
2021	J	`jnl`	A Neural Network Solves and Generates Mathematics Problems by Program Synthesis: Calculus, Differential Equations, Linear Algebra, and More. CoRR 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
2021	—	`conf`	An Efficient Reversible Algorithm for Linear Regression. ICRC Erik D. Demaine, Jayson Lynch, Jiaying Sun
2021	J	`jnl`	An Efficient Reversible Algorithm for Linear Regression. CoRR Jayson Lynch, Jiaying Sun
2021	A*	`conf`	Characterizing Universal Reconfigurability of Modular Pivoting Robots. SoCG Hugo A. Akitaya, Erik D. Demaine, Andrei Gonczi, Dylan H. Hendrickson, Adam Hesterberg, Matias Korman, Oliver Korten, Jayson Lynch, Irene Parada, Vera Sacristán
2021	J	`jnl`	Continuous Flattening of All Polyhedral Manifolds using Countably Infinite Creases. CoRR Zachary Abel, Erik D. Demaine, Martin L. Demaine, Jason S. Ku, Jayson Lynch, Jin-ichi Itoh, Chie Nara
2021	J	`jnl`	Continuous flattening of all polyhedral manifolds using countably infinite creases. Comput. Geom. Zachary Abel, Erik D. Demaine, Martin L. Demaine, Jason S. Ku, Jayson Lynch, Jin-ichi Itoh, Chie Nara
2021	B	`conf`	Dynamic Boolean Formula Evaluation. ISAAC Rathish Das, Andrea Lincoln, Jayson Lynch, J. Ian Munro
2021	—	`conf`	Generalized LR-Drawings of Trees. CCCG Therese Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani
2021	J	`jnl`	Generalized LR-drawings of trees. CoRR Therese Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani
2021	J	`jnl`	Hardness of Token Swapping on Trees. CoRR Oswin Aichholzer, Erik D. Demaine, Matias Korman, Jayson Lynch, Anna Lubiw, Zuzana Masárová, Mikhail Rudoy, Virginia Vassilevska Williams, Nicole Wein
2021	A*	`conf`	Multidimensional Scaling: Approximation and Complexity. ICML Erik D. Demaine, Adam Hesterberg, Frederic Koehler, Jayson Lynch, John Urschel
2021	J	`jnl`	Multidimensional Scaling: Approximation and Complexity. CoRR Erik D. Demaine, Adam Hesterberg, Frederic Koehler, Jayson Lynch, John Urschel
2021	A	`conf`	Optimal-Area Visibility Representations of Outer-1-Plane Graphs. GD Therese Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani
2021	J	`jnl`	Optimal-area visibility representations of outer-1-plane graphs. CoRR Therese Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani
2021	J	`jnl`	Snipperclips: Cutting Tools into Desired Polygons using Themselves. CoRR 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
2021	J	`jnl`	Snipperclips: Cutting tools into desired polygons using themselves. Comput. Geom. 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
2021	C	`conf`	Solving Machine Learning Problems. ACML Sunny Tran, Pranav Krishna, Ishan Pakuwal, Prabhakar Kafle, Nikhil Singh, Jayson Lynch, Iddo Drori
2021	J	`jnl`	Solving Machine Learning Problems. CoRR Sunny Tran, Pranav Krishna, Ishan Pakuwal, Prabhakar Kafle, Nikhil Singh, Jayson Lynch, Iddo Drori
2021	Misc	`conf`	Tatamibari Is NP-Complete. FUN Aviv Adler, Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Quanquan C. Liu, Jayson Lynch
2021	J	`jnl`	The Computational Complexity of Finding Arithmetic Expressions With and Without Parentheses. CoRR Jayson Lynch, Yan Weng
2021	Misc	`conf`	Walking Through Doors Is Hard, Even Without Staircases: Proving PSPACE-Hardness via Planar Assemblies of Door Gadgets. FUN Joshua Ani, Jeffrey Bosboom, Erik D. Demaine, Jenny Diomidova, Dylan H. Hendrickson, Jayson Lynch
2021	—	`conf`	Yin-Yang Puzzles are NP-complete. CCCG Erik D. Demaine, Jayson Lynch, Mikhail Rudoy, Yushi Uno
2021	J	`jnl`	Yin-Yang Puzzles are NP-complete. CoRR Erik D. Demaine, Jayson Lynch, Mikhail Rudoy, Yushi Uno
2020	—	`conf`	2048 Without Merging. CCCG Hugo A. Akitaya, Erik D. Demaine, Jason S. Ku, Jayson Lynch, Csaba D. Tóth
2020	—	`—`	A framework for proving the computational intractability of motion planning problems Jayson Lynch
2020	B	`conf`	Arithmetic Expression Construction. ISAAC 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
2020	J	`jnl`	Arithmetic Expression Construction. CoRR 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
2020	J	`jnl`	Characterizing Universal Reconfigurability of Modular Pivoting Robots. CoRR Hugo A. Akitaya, Erik D. Demaine, Andrei Gonczi, Dylan H. Hendrickson, Adam Hesterberg, Matias Korman, Oliver Korten, Jayson Lynch, Irene Parada, Vera Sacristán
2020	B	`conf`	Closing the Gap Between Cache-oblivious and Cache-adaptive Analysis. SPAA Michael A. Bender, Rezaul Alam Chowdhury, Rathish Das, Rob Johnson, William Kuszmaul, Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Helen Xu
2020	J	`jnl`	Cookie Clicker. Graphs Comb. Erik D. Demaine, Hiro Ito, Stefan Langerman, Jayson Lynch, Mikhail Rudoy, Kai Xiao
2020	J	`jnl`	Cooperating in video games? Impossible! Undecidability of Team Multiplayer Games. Theor. Comput. Sci. Michael J. Coulombe, Jayson Lynch
2020	J	`jnl`	Escaping a Polygon. CoRR Zachary Abel, Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Jason S. Ku, Jayson Lynch
2020	J	`jnl`	Mad Science is Provably Hard: Puzzles in Hearthstone's Boomsday Lab are NP-hard. CoRR Michael Hoffmann, Jayson Lynch, Andrew Winslow
2020	J	`jnl`	Mad Science is Provably Hard: Puzzles in Hearthstone's Boomsday Lab are NP-hard. J. Inf. Process. Michael Hoffmann, Jayson Lynch, Andrew Winslow
2020	J	`jnl`	Negative Instance for the Edge Patrolling Beacon Problem. CoRR Zachary Abel, Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Matias Korman, Jason S. Ku, Jayson Lynch
2020	J	`jnl`	PSPACE-completeness of Pulling Blocks to Reach a Goal. CoRR Joshua Ani, Sualeh Asif, Erik D. Demaine, Jenny Diomidova, Dylan H. Hendrickson, Jayson Lynch, Sarah Scheffler, Adam Suhl
2020	J	`jnl`	PSPACE-completeness of Pulling Blocks to Reach a Goal. J. Inf. Process. Joshua Ani, Sualeh Asif, Erik D. Demaine, Jenny Diomidova, Dylan H. Hendrickson, Jayson Lynch, Sarah Scheffler, Adam Suhl
2020	B	`conf`	Recursed Is Not Recursive: A Jarring Result. ISAAC Erik D. Demaine, Justin Kopinsky, Jayson Lynch
2020	J	`jnl`	Recursed is not Recursive: A Jarring Result. CoRR Erik D. Demaine, Justin Kopinsky, Jayson Lynch
2020	J	`jnl`	Tatamibari is NP-complete. CoRR Aviv Adler, Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Quanquan C. Liu, Jayson Lynch
2020	J	`jnl`	Tetris is NP-hard even with J. Inf. Process. Sualeh Asif, Michael J. Coulombe, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Jayson Lynch, Mihir Singhal
2020	J	`jnl`	Tetris is NP-hard even with $O(1)$ rows or columns. CoRR Sualeh Asif, Michael J. Coulombe, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Jayson Lynch, Mihir Singhal
2020	A	`conf`	Toward a General Complexity Theory of Motion Planning: Characterizing Which Gadgets Make Games Hard. ITCS Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
2020	J	`jnl`	Trains, Games, and Complexity: 0/1/2-Player Motion Planning through Input/Output Gadgets. CoRR Joshua Ani, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
2020	J	`jnl`	Walking through Doors is Hard, even without Staircases: Proving PSPACE-hardness via Planar Assemblies of Door Gadgets. CoRR Joshua Ani, Jeffrey Bosboom, Erik D. Demaine, Jenny Diomidova, Dylan H. Hendrickson, Jayson Lynch
2020	J	`jnl`	Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible. Theor. Comput. Sci. Zachary Abel, Jeffrey Bosboom, Michael J. Coulombe, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch, Mikhail Rudoy, Clemens Thielen
2019	B	`conf`	Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths. SPAA Rathish Das, Shih-Yu Tsai, Sharmila Duppala, Jayson Lynch, Esther M. Arkin, Rezaul Chowdhury, Joseph S. B. Mitchell, Steven Skiena
2019	J	`jnl`	Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths. CoRR Rathish Das, Shih-Yu Tsai, Sharmila Duppala, Jayson Lynch, Esther M. Arkin, Rezaul Chowdhury, Joseph S. B. Mitchell, Steven Skiena
2019	J	`jnl`	Hamiltonicity in Semi-Regular Tessellation Dual Graphs. CoRR Divya Gopinath, Rohan Kodialam, Kevin Lu, Jayson Lynch, Santiago Ospina
2018	J	`jnl`	A General Theory of Motion Planning Complexity: Characterizing Which Gadgets Make Games Hard. CoRR Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
2018	B	`conf`	Cache-Adaptive Exploration: Experimental Results and Scan-Hiding for Adaptivity. SPAA Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Helen Xu
2018	Misc	`conf`	Computational Complexity of Motion Planning of a Robot through Simple Gadgets. FUN Erik D. Demaine, Isaac Grosof, Jayson Lynch, Mikhail Rudoy
2018	J	`jnl`	Computational Complexity of Motion Planning of a Robot through Simple Gadgets. CoRR Erik D. Demaine, Isaac Grosof, Jayson Lynch, Mikhail Rudoy
2018	J	`jnl`	Cookie Clicker. CoRR Erik D. Demaine, Hiro Ito, Stefan Langerman, Jayson Lynch, Mikhail Rudoy, Kai Xiao
2018	Misc	`conf`	Cooperating in Video Games? Impossible! Undecidability of Team Multiplayer Games. FUN Michael J. Coulombe, Jayson Lynch
2018	A	`conf`	Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy. ITCS Erik D. Demaine, Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Virginia Vassilevska Williams
2018	J	`jnl`	Losing at Checkers is Hard. CoRR Jeffrey Bosboom, Spencer Congero, Erik D. Demaine, Martin L. Demaine, Jayson Lynch
2018	—	`conf`	Negative Instance for the Edge Patrolling Beacon Problem. JCDCGGG Zachary Abel, Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Matias Korman, Jason S. Ku, Jayson Lynch
2018	J	`jnl`	Pachinko. Comput. Geom. Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Ferran Hurtado, Jason S. Ku, Jayson Lynch
2018	—	`conf`	The Computational Complexity of Finding Hamiltonian Cycles in Grid Graphs of Semiregular Tessellations. CCCG Kaiying Hou, Jayson Lynch
2018	J	`jnl`	The Computational Complexity of Finding Hamiltonian Cycles in Grid Graphs of Semiregular Tessellations. CoRR Kaiying Hou, Jayson Lynch
2018	Misc	`conf`	The Computational Complexity of Portal and Other 3D Video Games. FUN Erik D. Demaine, Joshua Lockhart, Jayson Lynch
2018	Misc	`conf`	Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible. FUN Zachary Abel, Jeffrey Bosboom, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch, Mikhail Rudoy
2018	J	`jnl`	Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible. CoRR Zachary Abel, Jeffrey Bosboom, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch, Mikhail Rudoy
2017	J	`jnl`	Fine-Grained I/O Complexity via Reductions: New lower bounds, faster algorithms, and a time hierarchy. CoRR Erik D. Demaine, Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Virginia Vassilevska Williams
2017	J	`jnl`	Minimal forcing sets for 1D origami. CoRR Mirela Damian, Erik D. Demaine, Muriel Dulieu, Robin Y. Flatland, Hella Hoffman, Thomas C. Hull, Jayson Lynch, Suneeta Ramaswami
2017	C	`conf`	Push-Pull Block Puzzles are Hard. CIAC Erik D. Demaine, Isaac Grosof, Jayson Lynch
2017	J	`jnl`	Push-Pull Block Puzzles are Hard. CoRR Erik D. Demaine, Isaac Grosof, Jayson Lynch
2017	J	`jnl`	Total Tetris: Tetris with Monominoes, Dominoes, Trominoes, Pentominoes, ... J. Inf. Process. Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Adam Hesterberg, Andrea Lincoln, Jayson Lynch, Yun William Yu
2017	J	`jnl`	Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares. J. Inf. Process. Zachary Abel, Brad Ballinger, Erik D. Demaine, Martin L. Demaine, Jeff Erickson, Adam Hesterberg, Hiro Ito, Irina Kostitsyna, Jayson Lynch, Ryuhei Uehara
2016	B	`conf`	Cache-Adaptive Analysis. SPAA Michael A. Bender, Erik D. Demaine, Roozbeh Ebrahimi, Jeremy T. Fineman, Rob Johnson, Andrea Lincoln, Jayson Lynch, Samuel McCauley
2016	A	`conf`	Energy-Efficient Algorithms. ITCS Erik D. Demaine, Jayson Lynch, Geronimo J. Mirano, Nirvan Tyagi
2016	J	`jnl`	Energy-Efficient Algorithms. CoRR Erik D. Demaine, Jayson Lynch, Geronimo J. Mirano, Nirvan Tyagi
2016	J	`jnl`	Pachinko. CoRR Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Ferran Hurtado, Jason S. Ku, Jayson Lynch
2016	J	`jnl`	The Computational Complexity of Portal and Other 3D Video Games. CoRR Erik D. Demaine, Joshua Lockhart, Jayson Lynch
2016	C	`conf`	Toward an Energy Efficient Language and Compiler for (Partially) Reversible Algorithms. RC Nirvan Tyagi, Jayson Lynch, Erik D. Demaine
2016	J	`jnl`	Toward an Energy Efficient Language and Compiler for (Partially) Reversible Algorithms. CoRR Nirvan Tyagi, Jayson Lynch, Erik D. Demaine
2016	A*	`conf`	Who Needs Crossings? Hardness of Plane Graph Rigidity. SoCG Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl
2015	—	`conf`	Dissection with the Fewest Pieces is Hard, Even to Approximate. JCDCGG Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Jayson Lynch, Pasin Manurangsi, Mikhail Rudoy, Anak Yodpinyanee
2015	J	`jnl`	Dissection with the Fewest Pieces is Hard, Even to Approximate. CoRR Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Jayson Lynch, Pasin Manurangsi, Mikhail Rudoy, Anak Yodpinyanee
2015	J	`jnl`	Improved Connectivity Condition for Byzantine Fault Tolerance. CoRR Adam Hesterberg, Andrea Lincoln, Jayson Lynch
2015	—	`conf`	Mario Kart Is Hard. JCDCGG Jeffrey Bosboom, Erik D. Demaine, Adam Hesterberg, Jayson Lynch, Erik Waingarten
2013	J	`jnl`	Finding a Hamiltonian Path in a Cube with Specified Turns is Hard. Inf. Media Technol. Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl
2013	J	`jnl`	Finding a Hamiltonian Path in a Cube with Specified Turns is Hard. J. Inf. Process. Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl
2013	J	`jnl`	Folding Equilateral Plane graphs. Int. J. Comput. Geom. Appl. Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl, Isaac Shapiro-Ellowitz
2012	J	`jnl`	Collecting Things Under Time Pressure is Hard. Tiny Trans. Comput. Sci. Jayson Lynch
2011	B	`conf`	Folding Equilateral Plane Graphs. ISAAC Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl, Isaac Shapiro-Ellowitz