Prasad Jayanti
From MaRDI portal
Person:1606985
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Brief Announcement: Efficient Recoverable Writable-CAS Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| Wait-free computing Distributed Algorithms | 2023-12-01 | Paper |
| Recoverable FCFS mutual exclusion with wait-free recovery | 2023-02-03 | Paper |
| Recoverable mutual exclusion with abortability Computing | 2022-09-27 | Paper |
| A Recoverable Mutex Algorithm with Sub-logarithmic RMR on Both CC and DSM Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
| Constant Amortized RMR Abortable Mutex for CC and DSM Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
| On the robustness of Herlihy's hierarchy Proceedings of the twelfth annual ACM symposium on Principles of distributed computing - PODC '93 | 2017-09-29 | Paper |
| Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies (extended abstract) Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94 | 2017-09-29 | Paper |
| A time complexity lower bound for randomized implementations of some shared objects Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98 | 2016-03-02 | Paper |
| A polylog time wait-free construction for closed objects Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98 | 2016-03-02 | Paper |
| A lower bound on the local time complexity of universal constructions Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98 | 2016-03-02 | Paper |
| Time and space lower bounds for non-blocking implementations (preliminary version) Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing - PODC '96 | 2015-09-11 | Paper |
| Adaptive and efficient abortable mutual exclusion Proceedings of the twenty-second annual symposium on Principles of distributed computing | 2015-09-04 | Paper |
| Efficient and practical constructions of LL/SC variables Proceedings of the twenty-second annual symposium on Principles of distributed computing | 2015-09-04 | Paper |
| Fair group mutual exclusion Proceedings of the twenty-second annual symposium on Principles of distributed computing | 2015-09-04 | Paper |
| Constant RMR solutions to reader writer synchronization Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
| Every problem has a weakest failure detector Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
| F-arrays, implementation and applications Proceedings of the twenty-first annual symposium on Principles of distributed computing | 2014-07-25 | Paper |
| Extracting quorum failure detectors Proceedings of the 28th ACM symposium on Principles of distributed computing | 2014-07-23 | Paper |
| Tight time-space tradeoff for mutual exclusion Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
| Abortable Reader-Writer Locks Are No More Complex Than Abortable Mutex Locks Lecture Notes in Computer Science | 2013-03-13 | Paper |
| An optimal multi-writer snapshot algorithm Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
| On the Existence of Weakest Failure Detectors for Mutual Exclusion and k-Exclusion Lecture Notes in Computer Science | 2009-11-19 | Paper |
| FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science Lecture Notes in Computer Science | 2006-11-14 | Paper |
| Distributed Computing – IWDC 2005 Lecture Notes in Computer Science | 2006-10-10 | Paper |
| SOFSEM 2005: Theory and Practice of Computer Science Lecture Notes in Computer Science | 2005-12-07 | Paper |
| Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus SIAM Journal on Computing | 2005-02-21 | Paper |
| Fault-tolerant wait-free shared objects Journal of the ACM | 2005-01-25 | Paper |
| scientific article; zbMATH DE number 2080925 (Why is no real title available?) | 2004-08-04 | Paper |
| The cost of graceful degradation for omission failures Information Processing Letters | 2002-07-25 | Paper |
| scientific article; zbMATH DE number 1256651 (Why is no real title available?) | 2002-01-21 | Paper |
| Time and Space Lower Bounds for Nonblocking Implementations SIAM Journal on Computing | 2000-10-18 | Paper |
| Almost optimal single reader, single writer atomic register Journal of Parallel and Distributed Computing | 2000-05-07 | Paper |
| Solvability of Consensus: Composition Breaks Down for NonDeterministic Types SIAM Journal on Computing | 1999-02-22 | Paper |
| Robust wait-free hierarchies Journal of the ACM | 1998-02-17 | Paper |
Research outcomes over time
This page was built for person: Prasad Jayanti
