Prasad Jayanti

From MaRDI portal
Revision as of 16:44, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:1606985

Available identifiers

zbMath Open jayanti.prasadMaRDI QIDQ1606985

List of research outcomes

PublicationDate of PublicationType
Brief Announcement: Efficient Recoverable Writable-CAS2024-03-26Paper
Wait-free computing2023-12-01Paper
Recoverable FCFS mutual exclusion with wait-free recovery2023-02-03Paper
Recoverable mutual exclusion with abortability2022-09-27Paper
Constant Amortized RMR Abortable Mutex for CC and DSM2021-01-20Paper
A Recoverable Mutex Algorithm with Sub-logarithmic RMR on Both CC and DSM2021-01-20Paper
On the robustness of Herlihy's hierarchy2017-09-29Paper
Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies (extended abstract)2017-09-29Paper
A lower bound on the local time complexity of universal constructions2016-03-02Paper
A time complexity lower bound for randomized implementations of some shared objects2016-03-02Paper
A polylog time wait-free construction for closed objects2016-03-02Paper
Time and space lower bounds for non-blocking implementations (preliminary version)2015-09-11Paper
Fair group mutual exclusion2015-09-04Paper
Efficient and practical constructions of LL/SC variables2015-09-04Paper
Adaptive and efficient abortable mutual exclusion2015-09-04Paper
Constant RMR solutions to reader writer synchronization2015-03-02Paper
Every problem has a weakest failure detector2014-12-12Paper
f -arrays2014-07-25Paper
Extracting quorum failure detectors2014-07-23Paper
Tight time-space tradeoff for mutual exclusion2014-05-13Paper
Abortable Reader-Writer Locks Are No More Complex Than Abortable Mutex Locks2013-03-13Paper
An optimal multi-writer snapshot algorithm2010-08-16Paper
On the Existence of Weakest Failure Detectors for Mutual Exclusion and k-Exclusion2009-11-19Paper
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science2006-11-14Paper
Distributed Computing – IWDC 20052006-10-10Paper
SOFSEM 2005: Theory and Practice of Computer Science2005-12-07Paper
Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus2005-02-21Paper
Fault-tolerant wait-free shared objects2005-01-25Paper
https://portal.mardi4nfdi.de/entity/Q44739942004-08-04Paper
The cost of graceful degradation for omission failures2002-07-25Paper
https://portal.mardi4nfdi.de/entity/Q42303372002-01-21Paper
Time and Space Lower Bounds for Nonblocking Implementations2000-10-18Paper
Almost optimal single reader, single writer atomic register2000-05-07Paper
Solvability of Consensus: Composition Breaks Down for NonDeterministic Types1999-02-22Paper
Robust wait-free hierarchies1998-02-17Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Prasad Jayanti