# Siddhartha Jayanti సిద్ధార్థ జయంతి सिद्धार्थ जयन्ति

Siddhartha Jayanti is a PhD student advised by Professor Julian Shun at the Computer Science and Artificial Intelligence Lab (CSAIL) at MIT, where his research is supported by an NDSEG Fellowship from the US Department of Defense. Previously, he received a Masters Degree in Electrical Engineering and Computer Science at MIT under the guidance of Professor Costis Daskalakis, and a Bachelor of Science in Engineering Degree with a certificate in Applied Mathematics from Princeton University, where his undergraduate thesis was advised by Professor Robert Tarjan. Siddhartha is interested in a wide range of topics in Computer Science, including theory, systems, and machine learning. He has authored research publications in the fields of Distributed Computing, Machine Learning, Game Theory, Statistics, and Cryptography.

Alongside CS research, Siddhartha enjoys understanding the history of language, linguistics, poetry, and their relation to computation. He was introduced to this discipline while at Princeton, where he and Professor Manjul Bhargava explored the Samskrtam text Vrttajatisamucchaya (वृत्तजातिसमुच्चय) written by Acharya Virahanka (आचार्य विरहङ्क). The text derives combinatorial objects such as "Fibonacci's numbers" and "Pascal's Triangle" (Pingla's Meru Prastara पिङ्गल मेरुप्रस्तार) from Samskrtam prosody. Siddhartha is currently learning Panini's Ashtadhyayi (अष्टाध्यायी), the grammar of the Samskrtam language, through an online course taught by Dr. Sowmya Krishnapur, and is interested in exploring its relations to computing.

Along with research, Siddhartha enjoys writing poetry and short stories in Telugu, English, and Samskrtam.

**Publications (****dblp****) **

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.

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*.