| Fault-tolerant wait-free shared objects P Jayanti, TD Chandra, S Toueg Journal of the ACM (JACM) 45 (3), 451-500, 1998 | 161* | 1998 |
| Robust wait-free hierarchies P Jayanti Journal of the ACM (JACM) 44 (4), 592-614, 1997 | 132* | 1997 |
| Time and space lower bounds for nonblocking implementations P Jayanti, K Tan, S Toueg SIAM Journal on Computing 30 (2), 438-456, 2000 | 113 | 2000 |
| An optimal multi-writer snapshot algorithm P Jayanti Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005 | 90 | 2005 |
| Some results on the impossibility, universality, and decidability of consensus P Jayanti, S Toueg International Workshop on Distributed Algorithms, 69-84, 1992 | 79 | 1992 |
| Adaptive and efficient abortable mutual exclusion P Jayanti Proceedings of the twenty-second annual symposium on Principles of …, 2003 | 75 | 2003 |
| Generalized irreducibility of consensus and the equivalence of t-resilient and wait-free implementations of consensus T Chandra, V Hadzilacos, P Jayanti, S Toueg SIAM Journal on Computing 34 (2), 333-357, 2005 | 74* | 2005 |
| Efficient and practical constructions of LL/SC variables P Jayanti, S Petrovic Proceedings of the twenty-second annual symposium on Principles of …, 2003 | 70 | 2003 |
| A time complexity lower bound for randomized implementations of some shared objects P Jayanti Proceedings of the seventeenth annual ACM symposium on Principles of …, 1998 | 55 | 1998 |
| Every problem has a weakest failure detector P Jayanti, S Toueg Proceedings of the twenty-seventh ACM symposium on Principles of distributed …, 2008 | 51 | 2008 |
| f-arrays: implementation and applications P Jayanti Proceedings of the twenty-first annual symposium on Principles of …, 2002 | 48 | 2002 |
| Recoverable FCFS mutual exclusion with wait-free recovery P Jayanti, A Joshi 31st International Symposium on Distributed Computing (DISC 2017), 2017 | 37 | 2017 |
| A complete and constant time wait-free implementation of CAS from LL/SC and vice versa P Jayanti Distributed Computing: 12th International Symposium, DISC’98 Andros, Greece …, 1998 | 34 | 1998 |
| 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 | 32 | 2019 |
| A polylog time wait-free construction for closed objects TD Chandra, P Jayanti, K Tan Proceedings of the seventeenth annual ACM symposium on Principles of …, 1998 | 32 | 1998 |
| Bounding Lamport’s bakery algorithm P Jayanti, K Tan, G Friedland, A Katz SOFSEM 2001: Theory and Practice of Informatics: 28th Conference on Current …, 2001 | 31 | 2001 |
| Fair group mutual exclusion P Jayanti, S Petrovic, K Tan Proceedings of the twenty-second annual symposium on Principles of …, 2003 | 30 | 2003 |
| Wakeup under read/write atomicity P Jayanti, S Toueg International Workshop on Distributed Algorithms, 277-288, 1990 | 28 | 1990 |
| Logarithmic-time single deleter, multiple inserter wait-free queues and stacks P Jayanti, S Petrovic International Conference on Foundations of Software Technology and …, 2005 | 26 | 2005 |
| Wait-free computing P Jayanti International Workshop on Distributed Algorithms, 19-50, 1995 | 26 | 1995 |
