Jayson Lynch

444 total citations
27 papers, 114 citations indexed

About

Jayson Lynch is a scholar working on Artificial Intelligence, Computer Networks and Communications and Computational Theory and Mathematics. According to data from OpenAlex, Jayson Lynch has authored 27 papers receiving a total of 114 indexed citations (citations by other indexed papers that have themselves been cited), including 18 papers in Artificial Intelligence, 11 papers in Computer Networks and Communications and 6 papers in Computational Theory and Mathematics. Recurrent topics in Jayson Lynch's work include Artificial Intelligence in Games (8 papers), Digital Games and Media (5 papers) and Advanced Materials and Mechanics (4 papers). Jayson Lynch is often cited by papers focused on Artificial Intelligence in Games (8 papers), Digital Games and Media (5 papers) and Advanced Materials and Mechanics (4 papers). Jayson Lynch collaborates with scholars based in United States, Japan and Canada. Jayson Lynch's co-authors include Erik D. Demaine, Taylor L. Patti, Kevin Liu, Nikhil Singh, Nakul Verma, Eugene Wu, Linda Chen, Gilbert Strang, Avi Shporer and Leonard Tang and has published in prestigious journals such as Proceedings of the National Academy of Sciences, IEEE Journal on Selected Areas in Communications and Theoretical Computer Science.

In The Last Decade

Jayson Lynch

21 papers receiving 107 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Jayson Lynch United States 4 62 15 13 12 11 27 114
Han Shi China 5 38 0.6× 14 0.9× 21 1.6× 16 1.3× 8 0.7× 11 96
Christopher Akiki Germany 4 133 2.1× 6 0.4× 7 0.5× 14 1.2× 5 0.5× 10 201
Daniel Hesslow France 2 139 2.2× 5 0.3× 7 0.5× 13 1.1× 5 0.5× 4 194
Varun Kumar United States 8 119 1.9× 26 1.7× 14 1.1× 49 4.1× 3 0.3× 19 179
Adam Freeman United Kingdom 6 36 0.6× 3 0.2× 28 2.2× 25 2.1× 5 0.5× 44 120
Francisco Fernández de Vega Spain 8 91 1.5× 2 0.1× 22 1.7× 17 1.4× 25 2.3× 25 149
Maxwell Nye United States 5 68 1.1× 7 0.5× 5 0.4× 30 2.5× 7 0.6× 8 106
Dongho Kim United Kingdom 8 140 2.3× 8 0.5× 36 2.8× 19 1.6× 5 0.5× 18 190
Félix Castro Spain 6 35 0.6× 37 2.5× 8 0.6× 31 2.6× 4 0.4× 16 75
Moshe Looks United States 9 132 2.1× 8 0.5× 29 2.2× 14 1.2× 50 4.5× 21 178

Countries citing papers authored by Jayson Lynch

Since Specialization
Citations

This map shows the geographic impact of Jayson Lynch's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Jayson Lynch with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jayson Lynch more than expected).

Fields of papers citing papers by Jayson Lynch

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jayson Lynch. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Jayson Lynch. The network helps show where Jayson Lynch may publish in the future.

Co-authorship network of co-authors of Jayson Lynch

This figure shows the co-authorship network connecting the top 25 collaborators of Jayson Lynch. A scholar is included among the top collaborators of Jayson Lynch based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Jayson Lynch. Jayson Lynch is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Drori, Iddo, Sarah Zhang, Leonard Tang, et al.. (2022). 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. 119(32). e2123433119–e2123433119. 68 indexed citations
2.
Demaine, Erik D., et al.. (2021). Continuous flattening of all polyhedral manifolds using countably infinite creases. Computational Geometry. 98. 101773–101773. 1 indexed citations
3.
Demaine, Erik D., et al.. (2021). Multidimensional Scaling: Approximation and Complexity. arXiv (Cornell University).
4.
Demaine, Erik D., et al.. (2020). PSPACE-completeness of Pulling Blocks to Reach a Goal. arXiv (Cornell University). 1 indexed citations
5.
Coulombe, Michael & Jayson Lynch. (2020). Cooperating in video games? Impossible! Undecidability of Team Multiplayer Games. Theoretical Computer Science. 839. 30–40. 1 indexed citations
6.
Coulombe, Michael, et al.. (2020). Tetris is NP-hard even with <i>O</i>(1) Rows or Columns. Journal of Information Processing. 28(0). 942–958.
7.
Demaine, Erik D., et al.. (2019). Cookie Clicker. Graphs and Combinatorics. 36(2). 269–302. 2 indexed citations
8.
Demaine, Erik D., et al.. (2018). The Computational Complexity of Portal and Other 3D Video Games. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).
9.
Bosboom, Jeffrey, et al.. (2018). Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible. arXiv (Cornell University). 1 indexed citations
10.
Demaine, Erik D., et al.. (2017). Pachinko. Computational Geometry. 68. 226–242. 2 indexed citations
11.
Demaine, Erik D., et al.. (2017). Total Tetris: Tetris with Monominoes, Dominoes, Trominoes, Pentominoes,.... Journal of Information Processing. 25(0). 515–527. 1 indexed citations
12.
Bender, Michael A., et al.. (2016). Cache-Adaptive Analysis. 135–144. 4 indexed citations
13.
Demaine, Erik D., et al.. (2016). Energy-Efficient Algorithms. 321–332. 13 indexed citations
14.
Demaine, Erik D., Martin L. Demaine, Jeff Erickson, et al.. (2016). Unfolding and dissection of multiple cubes. TU/e Research Portal (Eindhoven University of Technology). 1 indexed citations
15.
Demaine, Erik D., et al.. (2013). FOLDING EQUILATERAL PLANE GRAPHS. International Journal of Computational Geometry & Applications. 23(2). 75–92. 1 indexed citations
16.
Demaine, Erik D., et al.. (2013). Finding a Hamiltonian Path in a Cube with Specified Turns is Hard. Journal of Information Processing. 21(3). 368–377. 1 indexed citations
17.
Lynch, Jayson. (2012). Collecting Things Under Time Pressure is Hard.. 1. 1 indexed citations
18.
Gold, Ben, Jayson Lynch, & J. Tierney. (2005). Vocoded speech through fading channels. 8. 101–103.
19.
20.
Lynch, Jayson. (1987). Evaluation of the Comprehension of Noncontinous Sped-Up Vocoded Speech: A Strategy for Coping with Fading HF Channels. IEEE Journal on Selected Areas in Communications. 5(2). 308–311.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Han Shi Breakdown of academic impact, for papers by Christopher Akiki Breakdown of academic impact, for papers by Daniel Hesslow Breakdown of academic impact, for papers by Varun Kumar Breakdown of academic impact, for papers by Adam Freeman Breakdown of academic impact, for papers by Francisco Fernández de Vega Breakdown of academic impact, for papers by Maxwell Nye Breakdown of academic impact, for papers by Dongho Kim Breakdown of academic impact, for papers by Félix Castro Breakdown of academic impact, for papers by Moshe Looks
Rankless by CCL
2026