Wakeup under Read/Write Atomicity. - Prasad Jayanti; Sam Toueg (WDAG, 1990)

Minimal Shared Information for Concurrent Reading and Writing. - Prasad Jayanti; Adarshpal S. Sethi; Errol L. Lloyd (WDAG, 1991)

Some Results on the Impossibility, Universality, and Decidability of Consensus. - Prasad Jayanti; Sam Toueg (WDAG, 1992)

On the Robustness of Herlihy's Hierarchy. - Prasad Jayanti (PODC, 1993)

Wait-Freedom vs. t-Resiliency and the Robustness of Wait-Free Hierarchies. - Tushar Deepak Chandra; Vassos Hadzilacos; Prasad Jayanti; Sam Toueg (PODC, 1994)

Fault-Tolerant Wait-Free Implementations and Robust Wait-Free Hierarchies. - Prasad Jayanti (1994)

Wait-free Computing. - Prasad Jayanti (WDAG, 1995)

Time and Space Lower Bounds for Non-Blocking Implementations (Preliminary Version). - Prasad Jayanti; King Tan; Sam Toueg (PODC, 1996)

On the Power of Multi-objects. - Prasad Jayanti; Sanjay Khanna (WDAG, 1997)

Robust wait-free hierarchies. - Prasad Jayanti (J. ACM, 1997)

A Polylog Time Wait-Free Construction for Closed Objects. - Tushar Deepak Chandra; Prasad Jayanti; King Tan (PODC, 1998)

A Lower Bound on the Local Time Complexity of Universal Constructions. - Prasad Jayanti (PODC, 1998)

A Time Complexity Lower Bound for Randomized Implementations of Some Shared Objects. - Prasad Jayanti (PODC, 1998)

A Complete and Constant Time Wait-Free Implementation of CAS from LL/SC and Vice Versa. - Prasad Jayanti (DISC, 1998)

Fault-Tolerant Wait-Free Shared Objects. - Prasad Jayanti; Tushar Deepak Chandra; Sam Toueg (J. ACM, 1998)

Solvability of Consensus: Composition Breaks Down for NonDeterministic Types. - Prasad Jayanti (SIAM J. Comput., 1998)

The Cost of Graceful Degradation for Omission Failures. - Prasad Jayanti; Tushar Deepak Chandra; Sam Toueg (Inf. Process. Lett., 1999)

Almost Optimal Single Reader, Single Writer Atomic Register. - Prasad Jayanti; James E. Burns; Gary L. Peterson (J. Parallel Distributed Comput., 2000)

Time and Space Lower Bounds for Nonblocking Implementations. - Prasad Jayanti; King Tan; Sam Toueg (SIAM J. Comput., 2000)

Bounding Lamport's Bakery Algorithm. - Prasad Jayanti; King Tan; Gregory Friedland; Amir Katz (SOFSEM, 2001)

f-arrays: implementation and applications. - Prasad Jayanti (PODC, 2002)

Adaptive and efficient abortable mutual exclusion. - Prasad Jayanti (PODC, 2003)

Efficient and practical constructions of LL/SC variables. - Prasad Jayanti; Srdjan Petrovic (PODC, 2003)

Fair group mutual exclusion. - Prasad Jayanti; Srdjan Petrovic; King Tan (PODC, 2003)

Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus. - Tushar Deepak Chandra; Vassos Hadzilacos; Prasad Jayanti; Sam Toueg (SIAM J. Comput., 2004)

Logarithmic-Time Single Deleter, Multiple Inserter Wait-Free Queues and Stacks. - Prasad Jayanti; Srdjan Petrovic (FSTTCS, 2005)

Efficient Wait-Free Implementation of Multiword LL/SC Variables. - Prasad Jayanti; Srdjan Petrovic (ICDCS, 2005)

Efficiently Implementing LL/SC Objects Shared by an Unknown Number of Processes. - Prasad Jayanti; Srdjan Petrovic (IWDC, 2005)

Efficiently Implementing a Large Number of LL/SC Objects. - Prasad Jayanti; Srdjan Petrovic (OPODIS, 2005)

Read/Write Based Fast-Path Transformation for FCFS Mutual Exclusion. - Prasad Jayanti; Srdjan Petrovic; Neha Narula (SOFSEM, 2005)

An optimal multi-writer snapshot algorithm. - Prasad Jayanti (STOC, 2005)

Every problem has a weakest failure detector. - Prasad Jayanti; Sam Toueg (PODC, 2008)

Extracting quorum failure detectors. - Vibhor Bhatt; Nicholas Christman; Prasad Jayanti (PODC, 2009)

The 2009 Edsger W. Dijkstra Prize in Distributed Computing. - Lorenzo Alvisi; Rachid Guerraoui; Prasad Jayanti; Idit Keidar; Shay Kutten; Jennifer L. Welch (DISC, 2009)

On the Existence of Weakest Failure Detectors for Mutual Exclusion and k-Exclusion. - Vibhor Bhatt; Prasad Jayanti (DISC, 2009)

Constant RMR solutions to reader writer synchronization. - Vibhor Bhatt; Prasad Jayanti (PODC, 2010)

Specification and Constant RMR Algorithm for Phase-Fair Reader-Writer Lock. - Vibhor Bhatt; Prasad Jayanti (ICDCN, 2011)

Tight time-space tradeoff for mutual exclusion. - Nikhil Bansal 001; Vibhor Bhatt; Prasad Jayanti; Ranganath Kondapally (STOC, 2012)

Abortable Reader-Writer Locks Are No More Complex Than Abortable Mutex Locks. - Prasad Jayanti; Zhiyu Liu (DISC, 2012)

Enhancing Readers-Writers Exclusion with Upgrade/Downgrade Primitives. - Michael Diamond; Prasad Jayanti; Jake Leichtling (NETYS, 2015)

Priority Mutual Exclusion: Specification and Algorithm. - Chien-Chung Huang 001; Prasad Jayanti (DISC, 2016)

Recoverable FCFS Mutual Exclusion with Wait-Free Recovery. - Prasad Jayanti; Anup Joshi (DISC, 2017)

Optimal Recoverable Mutual Exclusion Using only FASAS. - Prasad Jayanti; Siddhartha V. Jayanti; Anup Joshi (NETYS, 2018)

Constant Amortized RMR Complexity Deterministic Abortable Mutual Exclusion Algorithm for CC and DSM Models. - Prasad Jayanti; Siddhartha V. Jayanti (CoRR, 2018)

Constant Amortized RMR Abortable Mutex for CC and DSM. - Prasad Jayanti; Siddhartha Jayanti (PODC, 2019)

A Recoverable Mutex Algorithm with Sub-logarithmic RMR on Both CC and DSM. - Prasad Jayanti; Siddhartha V. Jayanti; Anup Joshi (PODC, 2019)

2019 Principles of Distributed Computing Doctoral Dissertation Award. - Prasad Jayanti; Nancy A. Lynch; Boaz Patt-Shamir; Ulrich Schmid 001 (PODC, 2019)

Recoverable Mutual Exclusion with Sub-logarithmic RMR Complexity on CC and DSM machines. - Prasad Jayanti; Siddhartha V. Jayanti; Anup Joshi (CoRR, 2019)

Towards an Ideal Queue Lock. - Prasad Jayanti; Siddhartha Jayanti; Sucharita Jayanti (ICDCN, 2020)

Deterministic Constant-Amortized-RMR Abortable Mutex for CC and DSM. - Prasad Jayanti; Siddhartha Jayanti (ACM Trans. Parallel Comput., 2021)

Recoverable mutual exclusion with abortability. - Prasad Jayanti; Anup Joshi (Computing, 2022)

Brief Announcement: Efficient Recoverable Writable-CAS. - Prasad Jayanti; Siddhartha Visveswara Jayanti; Sucharita Jayanti (PODC, 2023)

Constant RMR System-wide Failure Resilient Durable Locks with Dynamic Joining. - Prasad Jayanti; Siddhartha Jayanti; Anup Joshi (SPAA, 2023)

Durable Algorithms for Writable LL/SC and CAS with Dynamic Joining. - Prasad Jayanti; Siddhartha Jayanti; Sucharita Jayanti (DISC, 2023)

A Universal Technique for Machine-Certified Proofs of Linearizable Algorithms. - Prasad Jayanti; Siddhartha Jayanti; Ugur Y. Yavuz; Lizzie Hernandez (CoRR, 2023)

Constant RMR Recoverable Mutex under System-wide Crashes. - Prasad Jayanti; Siddhartha Jayanti; Anup Joshi (CoRR, 2023)

Meta-Configuration Tracking for Machine-Certified Correctness of Concurrent Data Structures (Abstract). - Prasad Jayanti; Siddhartha Jayanti; Ugur Y. Yavuz; Lizzie Hernandez (HOPC@SPAA, 2024)

MemSnap: A Fast Adaptive Snapshot Algorithm for RMWable Shared-Memory. - Prasad Jayanti; Siddhartha Jayanti; Sucharita Jayanti (PODC, 2024)

A Universal, Sound, and Complete Forward Reasoning Technique for Machine-Verified Proofs of Linearizability. - Prasad Jayanti; Siddhartha Jayanti; Ugur Y. Yavuz; Lizzie Hernandez (Proc. ACM Program. Lang., 2024)

MemSnap: Checkpointing Modern Shared-Memory (Abstract). - Prasad Jayanti; Siddhartha Jayanti; Sucharita Jayanti (HOPC@SPAA, 2025)

A Shared Archive of Snapshots. - Prasad Jayanti; Siddhartha Visveswara Jayanti (PODC, 2025)

Δ-Snap: Snapshotting the Differential. - Prasad Jayanti; Siddhartha Jayanti (SPAA, 2025)