The following pages link to Prasad Jayanti (Q1606985):
Displaying 34 items.
- The cost of graceful degradation for omission failures (Q1606987) (← links)
- Almost optimal single reader, single writer atomic register (Q1974681) (← links)
- Recoverable mutual exclusion with abortability (Q2676225) (← links)
- A lower bound on the local time complexity of universal constructions (Q2790113) (← links)
- A time complexity lower bound for randomized implementations of some shared objects (Q2790115) (← links)
- A polylog time wait-free construction for closed objects (Q2790119) (← links)
- Every problem has a weakest failure detector (Q2934334) (← links)
- Time and space lower bounds for non-blocking implementations (preliminary version) (Q2942740) (← links)
- Fair group mutual exclusion (Q2943764) (← links)
- Efficient and practical constructions of LL/SC variables (Q2943765) (← links)
- Adaptive and efficient abortable mutual exclusion (Q2943766) (← links)
- Fault-tolerant wait-free shared objects (Q3158512) (← links)
- An optimal multi-writer snapshot algorithm (Q3581459) (← links)
- On the Existence of Weakest Failure Detectors for Mutual Exclusion and k-Exclusion (Q3646234) (← links)
- Solvability of Consensus: Composition Breaks Down for NonDeterministic Types (Q4229406) (← links)
- (Q4230337) (← links)
- Robust wait-free hierarchies (Q4377589) (← links)
- (Q4473994) (← links)
- Time and Space Lower Bounds for Nonblocking Implementations (Q4507358) (← links)
- Generalized Irreducibility of Consensus and the Equivalence of <i>t</i>-Resilient and Wait-Free Implementations of Consensus (Q4651538) (← links)
- Abortable Reader-Writer Locks Are No More Complex Than Abortable Mutex Locks (Q4909418) (← links)
- Constant Amortized RMR Abortable Mutex for CC and DSM (Q5145197) (← links)
- A Recoverable Mutex Algorithm with Sub-logarithmic RMR on Both CC and DSM (Q5145198) (← links)
- Extracting quorum failure detectors (Q5170304) (← links)
- <i>f</i> -arrays (Q5170887) (← links)
- Constant RMR solutions to reader writer synchronization (Q5176222) (← links)
- On the robustness of Herlihy's hierarchy (Q5361374) (← links)
- Wait-freedom vs. <i>t</i>-resiliency and the robustness of wait-free hierarchies (extended abstract) (Q5361425) (← links)
- Tight time-space tradeoff for mutual exclusion (Q5415529) (← links)
- Distributed Computing – IWDC 2005 (Q5491765) (← links)
- SOFSEM 2005: Theory and Practice of Computer Science (Q5711536) (← links)
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science (Q5897787) (← links)
- Wait-free computing (Q6062513) (← links)
- Recoverable FCFS mutual exclusion with wait-free recovery (Q6487502) (← links)
