Andrew Gainer
Lead Software Engineer at LogRocket
Canton, Massachusetts, United States
Summary
👤
Senior🎓
Top SchoolAndrew Gainer is a Lead Software Engineer with 13 years of experience who blends deep mathematical training (Ph.D.) with pragmatic engineering to simplify complex systems through paradigmatic change. He spent nearly a decade at Google as a senior engineer before moving to LogRocket to drive architectural and team-level improvements, favoring reorganizing stacks and rebuilding brittle components for greater maintainability and extensibility. A former academic and postdoc in quantitative medicine, he brings rigorous problem formulation and a habit of proving edge cases—skills reflected in notable open-source contributions to the JGraphT project, including a Dijkstra-style all-paths algorithm and thorough test coverage. Based in Canton, Massachusetts, Andrew is as comfortable authoring algorithms and test automation as he is leading teams to reimagine how a system should be organized.
14 years of coding experience
10 years of employment as a software developer
High School, High School at Woodstock High SchoolBachelor's Degree Philosophy, Bachelor's Degree Philosophy at Mercer UniversityDoctor of Philosophy (Ph.D.) Mathematics, Doctor of Philosophy (Ph.D.) Mathematics at Brandeis University
German, English
Stackoverflow
1reputation
0reached
0answers
0questions
Github Skills (12)
unit-testing10
data-structures10
javas10
graph-algorithms10
graph-database10
data-structure10
java10
graph-datastructures10
graph-theory10
jgrapht10
junit9
graph9
Programming languages (9)
Github contributions (5)
jgrapht/jgrapht
Feb 2016 - Jul 2018
Master repository for the JGraphT project
Role in this project:
Back-end Developer / Test Automation Engineer
Back-end Developer / Test Automation EngineerContributions:15 commits, 9 PRs, 13 comments in 2 years 5 months
Contributions summary:Andrew significantly contributed to the JGraphT project by implementing and refining graph algorithms, particularly focusing on pathfinding. Their work involved implementing a Dijkstra-style all paths algorithm and addressing edge case handling. The user also demonstrated a strong understanding of testing by adding tests for algorithms and ensuring the integrity of the library's core functionalities, as well as fixing existing bugs.
jgraphtgraph-algorithmsgraph-theorydata-structuresdatastructures
agdphd/calculus-reader
Feb 2014 - Apr 2020
Contributions:209 commits, 26 pushes, 1 tag in 6 years 2 months
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.