Siddhartha Jayanti is a Research Scientist at Google Atlanta. His research spans distributed computing, algorithms, machine learning, security, economics and computing, and formal verification. Siddhartha earned his Ph.D. in Computer Science with a minor in Machine Learning from MIT, where his thesis on Simple, Fast, Scalable, and Reliable Multiprocessor Algorithms was advised by Julian Shun. He earned his Master's in EECS from MIT, where his thesis On Computing Nash Equilibria of Borel’s Colonel Blotto Game for Multiple Players including in Arbitrary Measure Spaces was advised by Costis Daskalakis. He received his Bachelor's in CS with a certificate in Applied and Computational Mathematics from Princeton, where his undergraduate thesis was advised by Robert Tarjan and his research on mathematics in Sanskrit was advised by Manjul Bhargava.
Siddhartha's Ph.D. thesis received the ACM-EATCS Principles of Distributed Computing Doctoral Dissertation Award. His Ph.D. research was funded by a National Defense Science and Engineering Graduate (NDSEG) Fellowship from the United States Department of Defense. Siddhartha was also awarded the NSF Graduate Research Fellowship, the Barry Goldwater Scholarship, and the Channels Scholarship from NSF's Center for Science of Information. He also received the Outstanding Computer Science Senior Thesis Prize from the Princeton CS department, the Calvin Dodd Maccracken Senior Thesis Award from Princeton's School of Engineering and Applied Sciences, and was Runner-Up for CRA's Outstanding Undergraduate Research Award.