Search the dblp DataBase
Prasad Jayanti: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Prasad Jayanti, Tushar Deepak Chandra, Sam Toueg
Fault-tolerant Wait-free Shared Objects [Citation Graph (0, 0)][DBLP]
FOCS, 1992, pp:157-166 [Conf] - Prasad Jayanti, Srdjan Petrovic
Logarithmic-Time Single Deleter, Multiple Inserter Wait-Free Queues and Stacks. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2005, pp:408-419 [Conf] - Prasad Jayanti, Srdjan Petrovic
Efficient Wait-Free Implementation of Multiword LL/SC Variables. [Citation Graph (0, 0)][DBLP]
ICDCS, 2005, pp:59-68 [Conf] - Prasad Jayanti, Srdjan Petrovic
Efficiently Implementing LL/SC Objects Shared by an Unknown Number of Processes. [Citation Graph (0, 0)][DBLP]
IWDC, 2005, pp:45-56 [Conf] - Prasad Jayanti, Srdjan Petrovic
Efficiently Implementing a Large Number of LL/SC Objects. [Citation Graph (0, 0)][DBLP]
OPODIS, 2005, pp:17-31 [Conf] - Tushar Deepak Chandra, Vassos Hadzilacos, Prasad Jayanti, Sam Toueg
Wait-Freedom vs. t-Resiliency and the Robustness of Wait-Free Hierarchies. [Citation Graph (0, 0)][DBLP]
PODC, 1994, pp:334-343 [Conf] - Tushar Deepak Chandra, Prasad Jayanti, King Tan
A Polylog Time Wait-Free Construction for Closed Objects. [Citation Graph (0, 0)][DBLP]
PODC, 1998, pp:287-296 [Conf] - Prasad Jayanti
f-arrays: implementation and applications. [Citation Graph (0, 0)][DBLP]
PODC, 2002, pp:270-279 [Conf] - Prasad Jayanti
Adaptive and efficient abortable mutual exclusion. [Citation Graph (0, 0)][DBLP]
PODC, 2003, pp:295-304 [Conf] - Prasad Jayanti
On the Robustness of Herlihy's Hierarchy. [Citation Graph (0, 0)][DBLP]
PODC, 1993, pp:145-157 [Conf] - Prasad Jayanti
A Lower Bound on the Local Time Complexity of Universal Constructions. [Citation Graph (0, 0)][DBLP]
PODC, 1998, pp:183-192 [Conf] - Prasad Jayanti
A Time Complexity Lower Bound for Randomized Implementations of Some Shared Objects. [Citation Graph (0, 0)][DBLP]
PODC, 1998, pp:201-210 [Conf] - Prasad Jayanti, Srdjan Petrovic
Efficient and practical constructions of LL/SC variables. [Citation Graph (0, 0)][DBLP]
PODC, 2003, pp:285-294 [Conf] - Prasad Jayanti, Srdjan Petrovic, King Tan
Fair group mutual exclusion. [Citation Graph (0, 0)][DBLP]
PODC, 2003, pp:275-284 [Conf] - Prasad Jayanti, King Tan, Sam Toueg
Time and Space Lower Bounds for Non-Blocking Implementations (Preliminary Version). [Citation Graph (0, 0)][DBLP]
PODC, 1996, pp:257-266 [Conf] - Prasad Jayanti, Srdjan Petrovic, Neha Narula
Read/Write Based Fast-Path Transformation for FCFS Mutual Exclusion. [Citation Graph (0, 0)][DBLP]
SOFSEM, 2005, pp:209-218 [Conf] - Prasad Jayanti, King Tan, Gregory Friedland, Amir Katz
Bounding Lamport's Bakery Algorithm. [Citation Graph (0, 0)][DBLP]
SOFSEM, 2001, pp:261-270 [Conf] - Prasad Jayanti
An optimal multi-writer snapshot algorithm. [Citation Graph (0, 0)][DBLP]
STOC, 2005, pp:723-732 [Conf] - Prasad Jayanti
Wait-free Computing. [Citation Graph (0, 0)][DBLP]
WDAG, 1995, pp:19-50 [Conf] - Prasad Jayanti
A Complete and Constant Time Wait-Free Implementation of CAS from LL/SC and Vice Versa. [Citation Graph (0, 0)][DBLP]
DISC, 1998, pp:216-230 [Conf] - Prasad Jayanti, Sanjay Khanna
On the Power of Multi-objects. [Citation Graph (0, 0)][DBLP]
WDAG, 1997, pp:320-332 [Conf] - Prasad Jayanti, Adarshpal S. Sethi, Errol L. Lloyd
Minimal Shared Information for Concurrent Reading and Writing. [Citation Graph (0, 0)][DBLP]
WDAG, 1991, pp:212-228 [Conf] - Prasad Jayanti, Sam Toueg
Wakeup under Read/Write Atomicity. [Citation Graph (0, 0)][DBLP]
WDAG, 1990, pp:277-288 [Conf] - Prasad Jayanti, Sam Toueg
Some Results on the Impossibility, Universality, and Decidability of Consensus. [Citation Graph (0, 0)][DBLP]
WDAG, 1992, pp:69-84 [Conf] - Prasad Jayanti, Tushar Deepak Chandra, Sam Toueg
The Cost of Graceful Degradation for Omission Failures. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1999, v:71, n:3-4, pp:167-172 [Journal] - Prasad Jayanti
Robust wait-free hierarchies. [Citation Graph (0, 0)][DBLP]
J. ACM, 1997, v:44, n:4, pp:592-614 [Journal] - Prasad Jayanti, Tushar Deepak Chandra, Sam Toueg
Fault-Tolerant Wait-Free Shared Objects. [Citation Graph (0, 0)][DBLP]
J. ACM, 1998, v:45, n:3, pp:451-500 [Journal] - Prasad Jayanti, James E. Burns, Gary L. Peterson
Almost Optimal Single Reader, Single Writer Atomic Register. [Citation Graph (0, 0)][DBLP]
J. Parallel Distrib. Comput., 2000, v:60, n:2, pp:150-168 [Journal] - Tushar Deepak Chandra, Vassos Hadzilacos, Prasad Jayanti, Sam Toueg
Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 2004, v:34, n:2, pp:333-357 [Journal] - Prasad Jayanti
Solvability of Consensus: Composition Breaks Down for NonDeterministic Types. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1998, v:28, n:3, pp:782-797 [Journal] - Prasad Jayanti, King Tan, Sam Toueg
Time and Space Lower Bounds for Nonblocking Implementations. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 2000, v:30, n:2, pp:438-456 [Journal]
Every problem has a weakest failure detector. [Citation Graph (, )][DBLP]
Extracting quorum failure detectors. [Citation Graph (, )][DBLP]
Constant RMR solutions to reader writer synchronization. [Citation Graph (, )][DBLP]
The 2009 Edsger W. Dijkstra Prize in Distributed Computing. [Citation Graph (, )][DBLP]
On the Existence of Weakest Failure Detectors for Mutual Exclusion and k-Exclusion. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.153secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002