Jayson Lynch

Orcid: 0000-0003-0801-1671

According to our database¹, Jayson Lynch authored at least 80 papers between 2012 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2024

Optimal-area visibility representations of outer-1-plane graphs.

[BibT_eX]

[DOI]

Therese Biedl

Giuseppe Liotta

Jayson Lynch

Fabrizio Montecchiani

J. Comput. Geom., 2024

Pushing Blocks via Checkable Gadgets: PSPACE-completeness of Push-1F and Block/Box Dude.

[BibT_eX]

[DOI]

CoRR, 2024

Folding One Polyhedral Metric Graph into Another.

[BibT_eX]

[DOI]

CoRR, 2024

All Polyhedral Manifolds are Connected by a 2-Step Refolding.

[BibT_eX]

[DOI]

CoRR, 2024

Super Guarding and Dark Rays in Art Galleries.

[BibT_eX]

[DOI]

CoRR, 2024

Agent Motion Planning as Block Asynchronous Cellular Automata: Pushing, Pulling, Suplexing, and More.

[BibT_eX]

[DOI]

Proceedings of the Unconventional Computation and Natural Computation, 2024

Figuring Figures: An assessment of large language models on different modalities of math word problems.

[BibT_eX]

[DOI]

Yan Wang

Jayson Lynch

Elizabeth Krueger

Proceedings of the 2024 9th International Conference on Machine Learning Technologies, 2024

Domain-Based Nucleic-Acid Minimum Free Energy: Algorithmic Hardness and Parameterized Bounds.

[BibT_eX]

[DOI]

Proceedings of the 30th International Conference on DNA Computing and Molecular Programming, 2024

2023

Traversability, Reconfiguration, and Reachability in the Gadget Framework.

[BibT_eX]

[DOI]

Algorithmica, November, 2023

Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., August, 2023

When Can You Tile an Integer Rectangle with Integer Squares?

[BibT_eX]

[DOI]

CoRR, 2023

Complexity of Reconfiguration in Surface Chemical Reaction Networks.

[BibT_eX]

[DOI]

CoRR, 2023

Complexity of Solo Chess with Unlimited Moves.

[BibT_eX]

[DOI]

CoRR, 2023

This Game Is Not Going To Analyze Itself.

[BibT_eX]

[DOI]

CoRR, 2023

Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter Machines.

[BibT_eX]

[DOI]

Proceedings of the 2nd Symposium on Algorithmic Foundations of Dynamic Networks, 2023

Complexity of Reconfiguration in Surface Chemical Reaction Networks.

[BibT_eX]

[DOI]

Proceedings of the 29th International Conference on DNA Computing and Molecular Programming, 2023

Super Guarding and Dark Rays in Art Galleries.

[BibT_eX]

Proceedings of the 35th Canadian Conference on Computational Geometry, 2023

A Dataset for Learning University STEM Courses at Scale and Generating Questions at a Human Level.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Characterizing the Decidability of Finite State Automata Team Games with Communication.

[BibT_eX]

[DOI]

Michael J. Coulombe

Jayson Lynch

Proceedings of the 13th International Symposium on Games, 2022

Reconfiguration of Non-crossing Spanning Trees.

[BibT_eX]

[DOI]

CoRR, 2022

The Legend of Zelda: The Complexity of Mechanics.

[BibT_eX]

[DOI]

CoRR, 2022

PSPACE-Completeness of Reversible Deterministic Systems.

[BibT_eX]

[DOI]

Proceedings of the Machines, Computations, and Universality - 9th International Conference, 2022

Lower Bounds on Retroactive Data Structures.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Pushing Blocks via Checkable Gadgets: PSPACE-Completeness of Push-1F and Block/Box Dude.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Fun with Algorithms, 2022

Hardness of Token Swapping on Trees.

[BibT_eX]

[DOI]

Virginia Vassilevska Williams

Nicole Wein

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Computational Complexity of Flattening Fixed-Angle Orthogonal Chains.

[BibT_eX]

Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

2021

A Neural Network Solves and Generates Mathematics Problems by Program Synthesis: Calculus, Differential Equations, Linear Algebra, and More.

[BibT_eX]

[DOI]

CoRR, 2021

An Efficient Reversible Algorithm for Linear Regression.

[BibT_eX]

[DOI]

Jayson Lynch

Jiaying Sun

CoRR, 2021

The Computational Complexity of Finding Arithmetic Expressions With and Without Parentheses.

[BibT_eX]

[DOI]

Jayson Lynch

Yan Weng

CoRR, 2021

Continuous flattening of all polyhedral manifolds using countably infinite creases.

[BibT_eX]

[DOI]

Comput. Geom., 2021

Snipperclips: Cutting tools into desired polygons using themselves.

[BibT_eX]

[DOI]

Comput. Geom., 2021

Dynamic Boolean Formula Evaluation.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

An Efficient Reversible Algorithm for Linear Regression.

[BibT_eX]

[DOI]

Erik D. Demaine

Jayson Lynch

Jiaying Sun

Proceedings of the 2021 International Conference on Rebooting Computing (ICRC), Los Alamitos, CA, USA, November 30, 2021

Multidimensional Scaling: Approximation and Complexity.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

Walking Through Doors Is Hard, Even Without Staircases: Proving PSPACE-Hardness via Planar Assemblies of Door Gadgets.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Fun with Algorithms, 2021

Tatamibari Is NP-Complete.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Fun with Algorithms, 2021

Characterizing Universal Reconfigurability of Modular Pivoting Robots.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Computational Geometry, 2021

Yin-Yang Puzzles are NP-complete.

[BibT_eX]

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

Generalized LR-Drawings of Trees.

[BibT_eX]

Therese Biedl

Giuseppe Liotta

Jayson Lynch

Fabrizio Montecchiani

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

Solving Machine Learning Problems.

[BibT_eX]

[DOI]

Proceedings of the Asian Conference on Machine Learning, 2021

2020

A framework for proving the computational intractability of motion planning problems

[BibT_eX]

[DOI]

Jayson Lynch

PhD thesis, 2020

Cooperating in video games? Impossible! Undecidability of Team Multiplayer Games.

[BibT_eX]

[DOI]

Michael J. Coulombe

Jayson Lynch

Theor. Comput. Sci., 2020

Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Mad Science is Provably Hard: Puzzles in Hearthstone's Boomsday Lab are NP-hard.

[BibT_eX]

[DOI]

Michael Hoffmann

Jayson Lynch

Andrew Winslow

J. Inf. Process., 2020

Tetris is NP-hard even with <i>O</i>(1) Rows or Columns.

[BibT_eX]

[DOI]

J. Inf. Process., 2020

PSPACE-completeness of Pulling Blocks to Reach a Goal.

[BibT_eX]

[DOI]

J. Inf. Process., 2020

Cookie Clicker.

[BibT_eX]

[DOI]

Graphs Comb., 2020

Tetris is NP-hard even with $O(1)$ rows or columns.

[BibT_eX]

[DOI]

CoRR, 2020

Escaping a Polygon.

[BibT_eX]

[DOI]

CoRR, 2020

Closing the Gap Between Cache-oblivious and Cache-adaptive Analysis.

[BibT_eX]

[DOI]

Michael A. Bender

Rezaul Alam Chowdhury

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Recursed Is Not Recursive: A Jarring Result.

[BibT_eX]

[DOI]

Erik D. Demaine

Justin Kopinsky

Jayson Lynch

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Arithmetic Expression Construction.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Toward a General Complexity Theory of Motion Planning: Characterizing Which Gadgets Make Games Hard.

[BibT_eX]

[DOI]

Erik D. Demaine

Dylan H. Hendrickson

Jayson Lynch

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

2048 Without Merging.

[BibT_eX]

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019

Hamiltonicity in Semi-Regular Tessellation Dual Graphs.

[BibT_eX]

[DOI]

CoRR, 2019

Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths.

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

Steven Skiena

Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

2018

A General Theory of Motion Planning Complexity: Characterizing Which Gadgets Make Games Hard.

[BibT_eX]

[DOI]

Erik D. Demaine

Dylan H. Hendrickson

Jayson Lynch

CoRR, 2018

Losing at Checkers is Hard.

[BibT_eX]

[DOI]

CoRR, 2018

Pachinko.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Cache-Adaptive Exploration: Experimental Results and Scan-Hiding for Adaptivity.

[BibT_eX]

[DOI]

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Negative Instance for the Edge Patrolling Beacon Problem.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Graphs, and Games, 2018

Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy.

[BibT_eX]

[DOI]

Virginia Vassilevska Williams

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

The Computational Complexity of Portal and Other 3D Video Games.

[BibT_eX]

[DOI]

Erik D. Demaine

Joshua Lockhart

Jayson Lynch

Proceedings of the 9th International Conference on Fun with Algorithms, 2018

Computational Complexity of Motion Planning of a Robot through Simple Gadgets.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Fun with Algorithms, 2018

Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Fun with Algorithms, 2018

The Computational Complexity of Finding Hamiltonian Cycles in Grid Graphs of Semiregular Tessellations.

[BibT_eX]

[DOI]

Kaiying Hou

Jayson Lynch

Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017

Total Tetris: Tetris with Monominoes, Dominoes, Trominoes, Pentominoes, ...

[BibT_eX]

[DOI]

J. Inf. Process., 2017

Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares.

[BibT_eX]

[DOI]

J. Inf. Process., 2017

Minimal forcing sets for 1D origami.

[BibT_eX]

[DOI]

CoRR, 2017

Push-Pull Block Puzzles are Hard.

[BibT_eX]

[DOI]

Erik D. Demaine

Isaac Grosof

Jayson Lynch

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016

Cache-Adaptive Analysis.

[BibT_eX]

[DOI]

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Toward an Energy Efficient Language and Compiler for (Partially) Reversible Algorithms.

[BibT_eX]

[DOI]

Nirvan Tyagi

Jayson Lynch

Erik D. Demaine

Proceedings of the Reversible Computation - 8th International Conference, 2016

Energy-Efficient Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

Who Needs Crossings? Hardness of Plane Graph Rigidity.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015

Improved Connectivity Condition for Byzantine Fault Tolerance.

[BibT_eX]

[DOI]

Adam Hesterberg

Andrea Lincoln

Jayson Lynch

CoRR, 2015

Mario Kart Is Hard.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

Dissection with the Fewest Pieces is Hard, Even to Approximate.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

2013

Finding a Hamiltonian Path in a Cube with Specified Turns is Hard.

[BibT_eX]

[DOI]

J. Inf. Process., 2013

Folding Equilateral Plane graphs.

[BibT_eX]

[DOI]

Isaac Shapiro-Ellowitz

Int. J. Comput. Geom. Appl., 2013

2012

Collecting Things Under Time Pressure is Hard.

[BibT_eX]

[DOI]

Jayson Lynch

Adv. Math. Commun., 2012

Jayson Lynch

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...