Sotabase

Career

· Research Scientist, Massachusetts Institute of Technology2015–
· Research Scientist, MIT Computer Science and Artificial Intelligence Laboratory (CSAIL)2015–
· Postdoctoral Researcher, University of Waterloo2015–
· PhD Student, Massachusetts Institute of Technology2012–2015
· Computer Science Researcher, MIT Computer Science and Artificial Intelligence Laboratory (CSAIL)
· Head of Algorithms, MIT FutureTech Lab
· Research Scientist, MIT FutureTech Lab

Publications (177)

Humanity's Last Exam
Robotics · 2025
284
cited
A neural network solves, explains, and generates university math problems by program synthesis and few-shot learning at human level
Proceedings of the National Academy of Sciences of the United States of America · 2021
176
cited
Energy-Efficient Algorithms
Information Technology Convergence and Services · 2016
173
cited
Who Needs Crossings? Hardness of Plane Graph Rigidity
International Symposium on Computational Geometry · 2016
37
cited
Computational Complexity of Motion Planning of a Robot through Simple Gadgets
Fun with Algorithms · 2018
30
cited
Walking through Doors is Hard, even without Staircases: Proving PSPACE-hardness via Planar Assemblies of Door Gadgets
Fun with Algorithms · 2020
21
cited
A Neural Network Solves and Generates Mathematics Problems by Program Synthesis: Calculus, Differential Equations, Linear Algebra, and More
arXiv.org · 2021
20
cited
The Computational Complexity of Portal and Other 3D Video Games
Fun with Algorithms · 2016
19
cited
Hardness of Token Swapping on Trees
Embedded Systems and Applications · 2021
17
cited
Multidimensional Scaling: Approximation and Complexity
International Conference on Machine Learning · 2021
15
cited
Tatamibari is NP-complete
Fun with Algorithms · 2020
15
cited
Cache-Adaptive Analysis
ACM Symposium on Parallelism in Algorithms and Architectures · 2013
14
cited
Pushing Blocks via Checkable Gadgets: PSPACE-Completeness of Push-1F and Block/Box Dude
Fun with Algorithms · 2024
13
cited
A General Theory of Motion Planning Complexity: Characterizing Which Gadgets Make Games Hard
Information Technology Convergence and Services · 2018
12
cited
Solving Machine Learning Problems
Asian Conference on Machine Learning · 2021
12
cited
Characterizing Universal Reconfigurability of Modular Pivoting Robots
International Symposium on Computational Geometry · 2020
11
cited
Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy
Information Technology Convergence and Services · 2017
11
cited
Toward a General Complexity Theory of Motion Planning: Characterizing Which Gadgets Make Games Hard.
2020
11
cited
Trains, Games, and Complexity: 0/1/2-Player Motion Planning through Input/Output Gadgets
Workshop on Algorithms and Computation · 2020
11
cited
PSPACE-completeness of Pulling Blocks to Reach a Goal
Journal of Information Processing · 2020
10
cited
Sotabase
Jayson Lynch | Researcher Profile | Sotabase | Sotabase