| The multiplayer colonel blotto game E Boix-Adserà, BL Edelman, S Jayanti Proceedings of the 21st ACM Conference on Economics and Computation, 47-48, 2020 | 32 | 2020 |
| Learning from weakly dependent data under dobrushin’s condition Y Dagan, C Daskalakis, N Dikkala, S Jayanti Conference on Learning Theory, 914-928, 2019 | 31 | 2019 |
| A recoverable mutex algorithm with sub-logarithmic RMR on both CC and DSM P Jayanti, S Jayanti, A Joshi Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019 | 29 | 2019 |
| A randomized concurrent algorithm for disjoint set union SV Jayanti, RE Tarjan Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016 | 26 | 2016 |
| Hogwild!-gibbs can be panaccurate C Daskalakis, N Dikkala, S Jayanti Advances in Neural Information Processing Systems 31, 2018 | 19 | 2018 |
| Randomized concurrent set union and generalized wake-up S Jayanti, RE Tarjan, E Boix-Adserà Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019 | 17 | 2019 |
| Optimal recoverable mutual exclusion using only FASAS P Jayanti, S Jayanti, A Joshi International Conference on Networked Systems, 191-206, 2018 | 16 | 2018 |
| Deterministic Constant-Amortized-RMR Abortable Mutex for CC and DSM P Jayanti, S Jayanti ACM Transactions on Parallel Computing 8 (4), 1-26, 2021 | 11* | 2021 |
| Concurrent disjoint set union SV Jayanti, RE Tarjan Distributed Computing 34 (6), 413-436, 2021 | 11 | 2021 |
| Towards an ideal queue lock P Jayanti, S Jayanti, S Jayanti Proceedings of the 21st International Conference on Distributed Computing …, 2020 | 9 | 2020 |
| Efficient constructions for almost-everywhere secure computation S Jayanti, S Raghuraman, N Vyas Advances in Cryptology–EUROCRYPT 2020: 39th Annual International Conference …, 2020 | 9 | 2020 |
| Durable algorithms for writable LL/SC and CAS with dynamic joining P Jayanti, S Jayanti, S Jayanti arXiv preprint arXiv:2302.00135, 2023 | 6 | 2023 |
| Nash equilibria of the multiplayer Colonel Blotto game on arbitrary measure spaces S Jayanti arXiv preprint arXiv:2104.11298, 2021 | 4 | 2021 |
| Constant rmr system-wide failure resilient durable locks with dynamic joining P Jayanti, S Jayanti, A Joshi Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and …, 2023 | 3 | 2023 |
| Constant rmr recoverable mutex under system-wide crashes P Jayanti, S Jayanti, A Joshi arXiv preprint arXiv:2302.00748, 2023 | 3 | 2023 |
| Brief announcement: Efficient recoverable writable-cas P Jayanti, SV Jayanti, S Jayanti Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing …, 2023 | 2 | 2023 |
| Simple, Fast, Scalable, and Reliable Multiprocessor Algorithms SV Jayanti Massachusetts Institute of Technology, 2023 | 2 | 2023 |
| Fast arrays: Atomic arrays with constant time initialization S Jayanti, J Shun 35th International Symposium on Distributed Computing (DISC 2021), 2021 | 2 | 2021 |
| A Universal, Sound, and Complete Forward Reasoning Technique for Machine-Verified Proofs of Linearizability P Jayanti, S Jayanti, U Yavuz, L Hernandez Proceedings of the ACM on Programming Languages 8 (POPL), 2456-2484, 2024 | 1 | 2024 |
| Generalized Wake-Up: Amortized Shared Memory Lower Bounds for Linearizable Data Structures SV Jayanti arXiv preprint arXiv:2207.07561, 2022 | 1 | 2022 |
Prasad JayantiDartmouth CollegeEmail verificata su cs.dartmouth.edu
