Jayson Lynch
Orcid: 0000-0003-0801-1671
According to our database1,
Jayson Lynch
authored at least 72 papers
between 2012 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
2023
Algorithmica, November, 2023
Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets.
Theor. Comput. Sci., August, 2023
Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter Machines.
Proceedings of the 2nd Symposium on Algorithmic Foundations of Dynamic Networks, 2023
Proceedings of the 29th International Conference on DNA Computing and Molecular Programming, 2023
A Dataset for Learning University STEM Courses at Scale and Generating Questions at a Human Level.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023
2022
Characterizing the Decidability of Finite State Automata Team Games with Communication.
Proceedings of the 13th International Symposium on Games, 2022
Proceedings of the Machines, Computations, and Universality - 9th International Conference, 2022
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.
Proceedings of the 11th International Conference on Fun with Algorithms, 2022
Proceedings of the 30th Annual European Symposium on Algorithms, 2022
Computational Complexity of Flattening Fixed-Angle Orthogonal Chains.
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.
CoRR, 2021
The Computational Complexity of Finding Arithmetic Expressions With and Without Parentheses.
CoRR, 2021
Comput. Geom., 2021
Comput. Geom., 2021
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021
Proceedings of the 2021 International Conference on Rebooting Computing (ICRC), Los Alamitos, CA, USA, November 30, 2021
Proceedings of the 38th International Conference on Machine Learning, 2021
Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021
Walking Through Doors Is Hard, Even Without Staircases: Proving PSPACE-Hardness via Planar Assemblies of Door Gadgets.
Proceedings of the 10th International Conference on Fun with Algorithms, 2021
Proceedings of the 10th International Conference on Fun with Algorithms, 2021
Proceedings of the 37th International Symposium on Computational Geometry, 2021
Yin-Yang Puzzles are NP-complete.
Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021
Generalized LR-Drawings of Trees.
Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021
Proceedings of the Asian Conference on Machine Learning, 2021
2020
Theor. Comput. Sci., 2020
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible.
Theor. Comput. Sci., 2020
J. Inf. Process., 2020
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020
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.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020
2048 Without Merging.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020
2019
Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths.
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.
CoRR, 2018
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018
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.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018
Proceedings of the 9th International Conference on Fun with Algorithms, 2018
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.
Proceedings of the 9th International Conference on Fun with Algorithms, 2018
The Computational Complexity of Finding Hamiltonian Cycles in Grid Graphs of Semiregular Tessellations.
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018
2017
J. Inf. Process., 2017
J. Inf. Process., 2017
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017
2016
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016
Toward an Energy Efficient Language and Compiler for (Partially) Reversible Algorithms.
Proceedings of the Reversible Computation - 8th International Conference, 2016
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016
Proceedings of the 32nd International Symposium on Computational Geometry, 2016
2015
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015
2013
J. Inf. Process., 2013
2012