Prasad Jayanti

Available identifiers

zbMath Open jayanti.prasadMaRDI QIDQ1606985

List of research outcomes

Publication	Date of Publication	Type
Brief Announcement: Efficient Recoverable Writable-CAS	2024-03-26	Paper
Wait-free computing	2023-12-01	Paper
Recoverable FCFS mutual exclusion with wait-free recovery	2023-02-03	Paper
Recoverable mutual exclusion with abortability	2022-09-27	Paper
A Recoverable Mutex Algorithm with Sub-logarithmic RMR on Both CC and DSM	2021-01-20	Paper
Constant Amortized RMR Abortable Mutex for CC and DSM	2021-01-20	Paper
On the robustness of Herlihy's hierarchy	2017-09-29	Paper
Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies (extended abstract)	2017-09-29	Paper
A time complexity lower bound for randomized implementations of some shared objects	2016-03-02	Paper
A polylog time wait-free construction for closed objects	2016-03-02	Paper
A lower bound on the local time complexity of universal constructions	2016-03-02	Paper
Time and space lower bounds for non-blocking implementations (preliminary version)	2015-09-11	Paper
Adaptive and efficient abortable mutual exclusion	2015-09-04	Paper
Efficient and practical constructions of LL/SC variables	2015-09-04	Paper
Fair group mutual exclusion	2015-09-04	Paper
Constant RMR solutions to reader writer synchronization	2015-03-02	Paper
Every problem has a weakest failure detector	2014-12-12	Paper
f -arrays	2014-07-25	Paper
Extracting quorum failure detectors	2014-07-23	Paper
Tight time-space tradeoff for mutual exclusion	2014-05-13	Paper
Abortable Reader-Writer Locks Are No More Complex Than Abortable Mutex Locks	2013-03-13	Paper
An optimal multi-writer snapshot algorithm	2010-08-16	Paper
On the Existence of Weakest Failure Detectors for Mutual Exclusion and k-Exclusion	2009-11-19	Paper
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science	2006-11-14	Paper
Distributed Computing – IWDC 2005	2006-10-10	Paper
SOFSEM 2005: Theory and Practice of Computer Science	2005-12-07	Paper
Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus	2005-02-21	Paper
Fault-tolerant wait-free shared objects	2005-01-25	Paper
https://portal.mardi4nfdi.de/entity/Q4473994	2004-08-04	Paper
The cost of graceful degradation for omission failures	2002-07-25	Paper
https://portal.mardi4nfdi.de/entity/Q4230337	2002-01-21	Paper
Time and Space Lower Bounds for Nonblocking Implementations	2000-10-18	Paper
Almost optimal single reader, single writer atomic register	2000-05-07	Paper
Solvability of Consensus: Composition Breaks Down for NonDeterministic Types	1999-02-22	Paper
Robust wait-free hierarchies	1998-02-17	Paper

Research outcomes over time

This page was built for person: Prasad Jayanti