Anzo Teh is a PhD candidate in MIT EECS researching empirical Bayes, statistical inference, and information theory under Prof. Yury Polyanskiy, combining deep theoretical work with practical ML and quant experience. He holds a dual degree in Computer Science and Pure Mathematics from the University of Waterloo (Mike & Ophelia Lazaridis Scholar) and brings nine years of experience across research and engineering internships at Uber ATG, Cockroach Labs, Waterfront International, Enlighted, Voloridge, and IMC. His background spans dynamic graph algorithms, high-frequency finance models, and compressed neural networks, and he has published substantial speedups for connected-components algorithms during undergraduate research. A former IMO gold medallist and Putnam top-team finisher, he pairs contest-level mathematical creativity with production-minded software contributions (including back-end algorithm implementations on popular open-source repos). Outside research he is a trained pianist who occasionally posts covers on YouTube, reflecting a disciplined yet creative approach to problem solving.
9 years of coding experience
1 year of employment as a software developer
High school certificate, High school certificate at SMJK Chung Ling Butterworth
Doctor of Philosophy - PhD, Computer Science, Doctor of Philosophy - PhD, Computer Science at Massachusetts Institute of Technology
A-levels, Mathematics, Further mathematics, Physics, Economics, A-levels, Mathematics, Further mathematics, Physics, Economics at Sunway College
Bachelor's degree, Computer Science and Pure Mathematics, Honors, Co-operative Program, Bachelor's degree, Computer Science and Pure Mathematics, Honors, Co-operative Program at University of Waterloo
:musical_note: Algorithms written in different programming languages - https://zoranpandovski.github.io/al-go-rithms/
Role in this project:
Back-end Developer
Contributions:6 commits, 4 PRs in 1 day
Contributions summary:Anzo contributed algorithms and data structures implementations in various programming languages, primarily focusing on connected components graph algorithms. Their work involved adding new algorithms like quick-find and quick-union, along with weighted quick union. The user also added a Python implementation for prime factorization and a polynomial regression algorithm.
Contributions:3 PRs, 73 pushes, 1 branch in 7 years 4 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.