Eric Zhang — Writing

Fast and reliable network infrastructure, built with love.

In-browser code editor hooked up to a sandboxed container runtime.

Translating the HTTP and WebSocket protocols into serverless function calls.

Graduate-level class discussing inference on statistical models, frequentist and Bayesian perspectives.

Graduate seminar class exploring programming languages for verification, differentiation, compilation, logic, etc.

Smooth manifolds, transversality, intersection theory, differential forms, Stokes' theorem, and cohomology.

Graduate seminar class on topics at the intersection of programming languages and artificial intelligence.

Graduate-level probability class providing foundational material for statistics PhD students.

Instructive solutions for nine years of past F=ma physics competition problems.

A fast, kinetic data structure that offers flexibility, a simple implementation, and interesting combinatorial analysis.

Graduate-level class on computational learning theory taught by Leslie Valiant, Turing award laureate.

The second semester of Math 55, a rigorous first-year math class. Point-set and algebraic topology, real analysis, and complex analysis.

The first semester of Math 55, a rigorous first-year math class. Group theory, abstract linear algebra, and representation theory.

My senior thesis, where I design and implement two logic programming languages, present case studies on their real-world usage, and evaluate them as systems.

Fabrication and characterization of a tandem solar device. Final project for MIT class 6.2540 on nanofabrication.

Envisioning flexible parallelism in deep learning compilers on heterogeneous compute. Final project for CS 243, Advanced Computer Networks.

Efficient simulation of contact dynamics using a hydroelastic intersection model. Final project for 6.834, Robotic Manipulation.

Real-time stylized rendering of meshes and SDFs using geometry processing techniques. Final project for 6.838, Shape Analysis.

An technical exposition of Ran Raz's strong hardness result for learning problems. Final project for CS 221, Advanced Computational Complexity.

Mathematics research paper, published in the Electronic Journal of Combinatorics (E-JC).

Dynamic taint analysis for user privacy on the web. Final project for CS 263, Systems Security.

Composing music by annealed Langevin dynamics and noise-conditional score networks. Final project for CS 252r, Advanced Topics in Programming Languages and AI.

Presentation on chaos theory of the Lorenz system, local and global bifurcations. Final project for Math 118r, Chaotic Dynamical Systems.

Seminar presentation on learned inductive program synthesis (published in ICLR 2017) for CS 252r, Advanced Topics in Programming Languages and AI.

Survey of modern research in deep learning theory. Final project for CS 228, Computational Learning Theory.

Survey of research in mechanism design and optimal transport theory. Final project for CS 223, Random Processes and Algorithms.

Talk introducing new forcing results on quasirandom permutations. This solved an open problem in combinatorics.