A functional TypeScript implementation of Dijkstra’s classic algorithm for parsing mathematical expressions, converting infix notation to reverse Polish notation for stack-based evaluation.

Attending the annual Slate Star Codex meetup in San Francisco’s Dolores Park, connecting with the rationalist community during my first summer in the Bay Area.

We explore a solution to finding Pythagorean triples with a product constraint, achieving O(√n) time complexity by reducing the problem to the well-known 3SUM problem.

Exploring methods to extract human-readable step-by-step solutions from Mathematica’s symbolic computation, addressing the black-box problem in automated mathematical derivation.

A JavaScript particle physics simulation using a quadtree spatial data structure to efficiently compute inter-particle forces, optimizing from O(n²) to near-linear complexity.

An interactive JavaScript simulation demonstrating the chaotic behavior of a double pendulum system, showcasing how small changes in initial conditions lead to dramatically different outcomes.

A fast O(n) heuristic for finding near-optimal oriented bounding boxes around point sets, using orthogonal linear regression to align rectangles with the natural orientation of the data.

A memorable meeting with ODU’s president as part of a Tau Beta Pi engineering honor society event.

An interactive demonstration of simple linear regression, showing how the least-squares method finds the best-fitting line through a set of data points by minimizing vertical distances.

An interactive visualization of quadratic Bézier curves, demonstrating how three control points define smooth parametric curves commonly used in computer graphics and design.