 | 2012 |
| 40 |  | Nikhil Bansal,
Vibhor Bhatt,
Prasad Jayanti,
Ranganath Kondapally:
Tight time-space tradeoff for mutual exclusion.
STOC 2012: 971-982 |
| 2011 |
| 39 |  | Vibhor Bhatt,
Prasad Jayanti:
Specification and Constant RMR Algorithm for Phase-Fair Reader-Writer Lock.
ICDCN 2011: 119-130 |
| 2010 |
| 38 |  | Vibhor Bhatt,
Prasad Jayanti:
Constant RMR solutions to reader writer synchronization.
PODC 2010: 468-477 |
| 2009 |
| 37 |  | Lorenzo Alvisi,
Rachid Guerraoui,
Prasad Jayanti,
Idit Keidar,
Shay Kutten,
Jennifer L. Welch:
The 2009 Edsger W. Dijkstra Prize in Distributed Computing.
DISC 2009: 1-2 |
| 36 |  | Vibhor Bhatt,
Prasad Jayanti:
On the Existence of Weakest Failure Detectors for Mutual Exclusion and k-Exclusion.
DISC 2009: 311-325 |
| 35 |  | Vibhor Bhatt,
Nicholas Christman,
Prasad Jayanti:
Extracting quorum failure detectors.
PODC 2009: 73-82 |
| 2008 |
| 34 |  | Shrisha Rao,
Mainak Chatterjee,
Prasad Jayanti,
C. Siva Ram Murthy,
Sanjoy Kumar Saha:
Distributed Computing and Networking, 9th International Conference, ICDCN 2008, Kolkata, India, January 5-8, 2008.
Springer 2008 |
| 33 |  | Prasad Jayanti,
Sam Toueg:
Every problem has a weakest failure detector.
PODC 2008: 75-84 |
| 2005 |
| 32 |  | Prasad Jayanti,
Srdjan Petrovic:
Logarithmic-Time Single Deleter, Multiple Inserter Wait-Free Queues and Stacks.
FSTTCS 2005: 408-419 |
| 31 |  | Prasad Jayanti,
Srdjan Petrovic:
Efficient Wait-Free Implementation of Multiword LL/SC Variables.
ICDCS 2005: 59-68 |
| 30 |  | Prasad Jayanti,
Srdjan Petrovic:
Efficiently Implementing LL/SC Objects Shared by an Unknown Number of Processes.
IWDC 2005: 45-56 |
| 29 |  | Prasad Jayanti,
Srdjan Petrovic:
Efficiently Implementing a Large Number of LL/SC Objects.
OPODIS 2005: 17-31 |
| 28 |  | Prasad Jayanti,
Srdjan Petrovic,
Neha Narula:
Read/Write Based Fast-Path Transformation for FCFS Mutual Exclusion.
SOFSEM 2005: 209-218 |
| 27 |  | Prasad Jayanti:
An optimal multi-writer snapshot algorithm.
STOC 2005: 723-732 |
| 2004 |
| 26 |  | 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.
SIAM J. Comput. 34(2): 333-357 (2004) |
| 2003 |
| 25 |  | Prasad Jayanti,
Srdjan Petrovic,
King Tan:
Fair group mutual exclusion.
PODC 2003: 275-284 |
| 24 |  | Prasad Jayanti,
Srdjan Petrovic:
Efficient and practical constructions of LL/SC variables.
PODC 2003: 285-294 |
| 23 |  | Prasad Jayanti:
Adaptive and efficient abortable mutual exclusion.
PODC 2003: 295-304 |
| 2002 |
| 22 |  | Prasad Jayanti:
f-arrays: implementation and applications.
PODC 2002: 270-279 |
| 2001 |
| 21 |  | Prasad Jayanti,
King Tan,
Gregory Friedland,
Amir Katz:
Bounding Lamport's Bakery Algorithm.
SOFSEM 2001: 261-270 |
| 2000 |
| 20 |  | Prasad Jayanti,
James E. Burns,
Gary L. Peterson:
Almost Optimal Single Reader, Single Writer Atomic Register.
J. Parallel Distrib. Comput. 60(2): 150-168 (2000) |
| 19 |  | Prasad Jayanti,
King Tan,
Sam Toueg:
Time and Space Lower Bounds for Nonblocking Implementations.
SIAM J. Comput. 30(2): 438-456 (2000) |
| 1999 |
| 18 |  | Prasad Jayanti:
Distributed Computing, 13th International Symposium, Bratislava, Slavak Republic, September 27-29, 1999, Proceedings
Springer 1999 |
| 17 |  | Prasad Jayanti,
Tushar Deepak Chandra,
Sam Toueg:
The Cost of Graceful Degradation for Omission Failures.
Inf. Process. Lett. 71(3-4): 167-172 (1999) |
| 1998 |
| 16 |  | Prasad Jayanti:
A Complete and Constant Time Wait-Free Implementation of CAS from LL/SC and Vice Versa.
DISC 1998: 216-230 |
| 15 |  | Prasad Jayanti:
A Lower Bound on the Local Time Complexity of Universal Constructions.
PODC 1998: 183-192 |
| 14 |  | Prasad Jayanti:
A Time Complexity Lower Bound for Randomized Implementations of Some Shared Objects.
PODC 1998: 201-210 |
| 13 |  | Tushar Deepak Chandra,
Prasad Jayanti,
King Tan:
A Polylog Time Wait-Free Construction for Closed Objects.
PODC 1998: 287-296 |
| 12 |  | Prasad Jayanti,
Tushar Deepak Chandra,
Sam Toueg:
Fault-Tolerant Wait-Free Shared Objects.
J. ACM 45(3): 451-500 (1998) |
| 11 |  | Prasad Jayanti:
Solvability of Consensus: Composition Breaks Down for NonDeterministic Types.
SIAM J. Comput. 28(3): 782-797 (1998) |
| 1997 |
| 10 |  | Prasad Jayanti,
Sanjay Khanna:
On the Power of Multi-objects.
WDAG 1997: 320-332 |
| 9 |  | Prasad Jayanti:
Robust wait-free hierarchies.
J. ACM 44(4): 592-614 (1997) |
| 1996 |
| 8 |  | Prasad Jayanti,
King Tan,
Sam Toueg:
Time and Space Lower Bounds for Non-Blocking Implementations (Preliminary Version).
PODC 1996: 257-266 |
| 1995 |
| 7 |  | Prasad Jayanti:
Wait-free Computing.
WDAG 1995: 19-50 |
| 1994 |
| 6 |  | Tushar Deepak Chandra,
Vassos Hadzilacos,
Prasad Jayanti,
Sam Toueg:
Wait-Freedom vs. t-Resiliency and the Robustness of Wait-Free Hierarchies.
PODC 1994: 334-343 |
| 1993 |
| 5 |  | Prasad Jayanti:
On the Robustness of Herlihy's Hierarchy.
PODC 1993: 145-157 |
| 1992 |
| 4 |  | Prasad Jayanti,
Tushar Deepak Chandra,
Sam Toueg:
Fault-tolerant Wait-free Shared Objects
FOCS 1992: 157-166 |
| 3 |  | Prasad Jayanti,
Sam Toueg:
Some Results on the Impossibility, Universality, and Decidability of Consensus.
WDAG 1992: 69-84 |
| 1991 |
| 2 |  | Prasad Jayanti,
Adarshpal S. Sethi,
Errol L. Lloyd:
Minimal Shared Information for Concurrent Reading and Writing.
WDAG 1991: 212-228 |
| 1990 |
| 1 |  | Prasad Jayanti,
Sam Toueg:
Wakeup under Read/Write Atomicity.
WDAG 1990: 277-288 |