Siddhartha Jayanti సిద్ధార్థ జయంతి सिद्धार्थ जयन्ति
Siddhartha Jayanti is a Research Scientist at Google Research and AI in the United States. 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 he was advised by Professor Julian Shun. He received his Master of Science degree from MIT under the guidance of Professor Costis Daskalakis, and his Bachelor of Science in Engineering degree from Princeton University, where his undergraduate thesis was advised by Professor Robert Tarjan and his research on mathematics in Sanskrit was advised by Professor Manjul Bhargava.
Siddhartha's Ph.D. dissertation was awarded the ACM-EATCS Principles of Distributed Computing Doctoral Dissertation Award, and 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.
While a Ph.D. student, Siddhartha served as the president of MIT Samskritam and MIT HSC (Hindu Students Council). He received a foundation in the Sanskrit language through Samskrita Bharati USA's Samskritam As a Foreign Language (SAFL) program, after which he started writing poetry in Telugu and Sanskrit. At Princeton, he studied Sanskrit as his language elective, and also pursued academic research under the guidance of Mathematics Professor Manjul Bhargava—investigating the origins of mathematical sequences and series in ancient texts on Sanskrit prosody. Siddhartha's Computer Science MIT Ph.D. thesis includes a chapter of novel computer science results written entirely in Telugu along with an abstract in Sanskrit. Siddhartha was honored as the Samskritam Salutatorian at the inaugural Hindu Students Council (HSC) Virtual Commencement, where he delivered a speech in Sanskrit addressing graduating students from around the world.
Theses
Siddhartha Jayanti. Simple, Fast, Scalable, and Reliable Multiprocessor Algorithms. MIT Ph.D. Thesis 2022.
Committee: Prof. Julian Shun (MIT, advisor), Prof. Charles Leiserson (MIT, reader), Prof. Bob Tarjan (Princeton, reader)
Siddhartha Jayanti. On Computing Nash Equilibria of Borel's Colonel Blotto Game for Multiple Players Including in Arbitrary Measure Spaces. MIT S.M. Thesis 2020.
Advisor: Prof. Costis Daskalakis (MIT)
Siddhartha Jayanti. Concurrent Disjoint Set Union. Princeton University B.S.E. Thesis 2017.
Advisor: Prof. Bob Tarjan (Princeton)
Journal Articles
Siddhartha Jayanti and Robert Tarjan. Concurrent Disjoint Set Union. In Distributed Computing 2021.
Enric Boix-Adserà, Ben Edelman, and Siddhartha Jayanti. The Multiplayer Colonel Blotto Game. In Games and Economic Behavior 2021.
Prasad Jayanti and Siddhartha Jayanti. Deterministic Constant-Amortized-RMR Abortable Mutex for CC and DSM. In ACM Transactions on Parallel Computing 2021.
Conference Publications
Prasad Jayanti, Siddhartha Jayanti, and Sucharita Jayanti. Durable Algorithms for Writable LL/SC and CAS with Dynamic Joining. In Proceedings of the International Symposium on Distributed Computing (DISC) 2023.
Prasad Jayanti, Siddhartha Jayanti, and Anup Joshi. Constant RMR Recoverable Mutex under System-wide Crashes. In Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) 2023.
Prasad Jayanti, Siddhartha Jayanti, and Sucharita Jayanti. Brief Announcement: Efficient Recoverable Writable-CAS. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC) 2023.
Siddhartha Jayanti and Julian Shun. Fast Arrays: Atomic Arrays with Constant Time Initialization. In Proceedsings of the International Symposium on Distributed Computing (DISC) 2021.
Enric Boix-Adserà, Ben Edelman, and Siddhartha Jayanti. The Multiplayer Colonel Blotto Game. In Proceedings of the ACM Conference on Economics and Computation (EC) 2020.
Accepted for direct-to-journal publication in Games and Economic Behavior.
Siddhartha Jayanti, Srinivasan Raghuraman, and Nikhil Vyas. Efficient Constructions for Almost-everywhere Secure Computation. In Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT) 2020.
Prasad Jayanti, Siddhartha Jayanti, Sucharita Jayanti. Towards an Ideal Queue Lock. In Proceedings of the International Conference on Distributed Computing and Networking (ICDCN) 2020.
Invited to the spotlight session of the conference.
Yuval Dagan, Constantinos Daskalakis, Nishanth Dikkala, and Siddhartha Jayanti. Learning from Weakly Dependent data under Dobrushin’s Condition. In Proceedings of the Conference on Learning Theory (COLT) 2019.
Siddhartha Jayanti, Robert Tarjan, and Enric Boix-Adsera. Randomized Concurrent Set Union and Generalized Wake-Up. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC) 2019.
Invited to a special issue of the journal Distributed Computing.
Prasad Jayanti and Siddhartha Jayanti. Constant Amortized RMR Complexity Deterministic Abortable Mutual Exclusion Algorithm for CC and DSM Models. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC) 2019.
Prasad Jayanti, Siddhartha Jayanti, and Anup Joshi. A Recoverable Mutex Algorithm with Sub-logarithmic RMR on Both CC and DSM. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC) 2019.
Invited to a special issue of the journal Distributed Computing.
Constantinos Daskalakis, Nishanth Dikkala, and Siddhartha Jayanti. HOGWILD!-Gibbs can be PanAccurate. In Proceedings of Neural Information Processing Systems (NeurIPS) 2018.
Prasad Jayanti, Siddhartha Jayanti, and Anup Joshi. Optimal Recoverable Mutual Exclusion using only FASAS. In Proceedings of the 6th International Conference on Networked Systems (NETYS) 2018.
Siddhartha Jayanti and Robert Tarjan. A Randomized Concurrent Algorithm for Disjoint Set Union. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC) 2016.
Invited to a special issue of the journal Distributed Computing.
Preprints and Manuscripts
Siddhartha Jayanti. Nash Equilibria of The Multiplayer Colonel Blotto Game on Arbitrary Measure Spaces.
Siddhartha Jayanti. The Samskritam Technical Lexicon Project: A Shared STEM Lexicon for Indian Languages.
సిద్ధార్థ జయంతి. సామాన్య జాగృతి-పరిష్కారం.
Prasad Jayanti, Siddhartha Jayanti, Ugur Yavuz, and Lizzie Hernandez. A Universal Technique for Machine-Certified Proofs of Linearizable Algorithms.