Jonathan Conroy is a PhD student and Graduate Research Assistant at Dartmouth College specializing in computational geometry, graph algorithms, and theoretical computer science, with nine years of research and teaching experience. He has published work in venues such as SoCG and ICRA stemming from projects on geometric intersection graph spanners and robotic path planning, and has applied his algorithmic skills to practical problems like high-resolution wind-speed downscaling at REsurety. Jonathan blends rigorous theory with hands-on implementation—building Python tools for network science, prototyping robot-disinfection planners, and integrating statistical methods into production codebases. Based in Greater Boston, he teaches algorithms and computational geometry, mentoring students while advancing research that connects discrete theory to real-world systems. A detail often missed: his background spans both pure mathematics and applied data-science workflows, enabling him to move fluidly between proofs, experiments, and production integration.
9 years of coding experience
Doctor of Philosophy - PhD, Computer Science, Doctor of Philosophy - PhD, Computer Science at Dartmouth College
Bachelor of Science - BS, Mathematics and Computer Science, Bachelor of Science - BS, Mathematics and Computer Science at Tufts University
Find and Hire Top DevelopersWe’ve analyzed the programming source code of over 60 million software developers on GitHub and scored them by 50,000 skills. Sign-up on Prog,AI to search for software developers.