default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPrasad Jayanti
Person information
- affiliation: Dartmouth College, Hanover, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Prasad Jayanti
, Siddhartha Jayanti, Ugur Y. Yavuz, Lizzie Hernandez:
A Universal, Sound, and Complete Forward Reasoning Technique for Machine-Verified Proofs of Linearizability. Proc. ACM Program. Lang. 8(POPL): 2456-2484 (2024)- [c46]Prasad Jayanti, Siddhartha Jayanti, Ugur Y. Yavuz, Lizzie Hernandez:
Meta-Configuration Tracking for Machine-Certified Correctness of Concurrent Data Structures (Abstract). HOPC@SPAA 2024 - [c45]Prasad Jayanti, Siddhartha Jayanti, Sucharita Jayanti:
MemSnap: A Fast Adaptive Snapshot Algorithm for RMWable Shared-Memory. PODC 2024: 25-35 - 2023
- [c44]Prasad Jayanti, Siddhartha Visveswara Jayanti, Sucharita Jayanti:
Brief Announcement: Efficient Recoverable Writable-CAS. PODC 2023: 366-369 - [c43]Prasad Jayanti, Siddhartha Jayanti, Anup Joshi:
Constant RMR System-wide Failure Resilient Durable Locks with Dynamic Joining. SPAA 2023: 227-237 - [c42]Prasad Jayanti, Siddhartha Jayanti, Sucharita Jayanti:
Durable Algorithms for Writable LL/SC and CAS with Dynamic Joining. DISC 2023: 25:1-25:20 - [i6]Prasad Jayanti, Siddhartha Jayanti, Sucharita Jayanti:
Durable Algorithms for Writable LL/SC and CAS with Dynamic Joining. CoRR abs/2302.00135 (2023) - [i5]Prasad Jayanti, Siddhartha Jayanti, Ugur Y. Yavuz, Lizzie Hernandez:
A Universal Technique for Machine-Certified Proofs of Linearizable Algorithms. CoRR abs/2302.00737 (2023) - [i4]Prasad Jayanti, Siddhartha Jayanti, Anup Joshi:
Constant RMR Recoverable Mutex under System-wide Crashes. CoRR abs/2302.00748 (2023) - 2022
- [j9]Prasad Jayanti, Anup Joshi:
Recoverable mutual exclusion with abortability. Computing 104(10): 2225-2252 (2022) - 2021
- [j8]Prasad Jayanti, Siddhartha Jayanti:
Deterministic Constant-Amortized-RMR Abortable Mutex for CC and DSM. ACM Trans. Parallel Comput. 8(4): 22:1-22:26 (2021) - 2020
- [c41]Prasad Jayanti, Siddhartha Jayanti, Sucharita Jayanti:
Towards an Ideal Queue Lock. ICDCN 2020: 19:1-19:10 - [i3]Prasad Jayanti, Anup Joshi:
Recoverable Mutual Exclusion with Abortability. CoRR abs/2012.03140 (2020)
2010 – 2019
- 2019
- [c40]Prasad Jayanti, Anup Joshi:
Recoverable Mutual Exclusion with Abortability. NETYS 2019: 217-232 - [c39]Prasad Jayanti, Nancy A. Lynch, Boaz Patt-Shamir, Ulrich Schmid:
2019 Principles of Distributed Computing Doctoral Dissertation Award. PODC 2019: 2 - [c38]Prasad Jayanti, Siddhartha Jayanti:
Constant Amortized RMR Abortable Mutex for CC and DSM. PODC 2019: 167-176 - [c37]Prasad Jayanti, Siddhartha V. Jayanti, Anup Joshi:
A Recoverable Mutex Algorithm with Sub-logarithmic RMR on Both CC and DSM. PODC 2019: 177-186 - [i2]Prasad Jayanti, Siddhartha V. Jayanti, Anup Joshi:
Recoverable Mutual Exclusion with Sub-logarithmic RMR Complexity on CC and DSM machines. CoRR abs/1904.02124 (2019) - 2018
- [c36]Prasad Jayanti, Siddhartha V. Jayanti, Anup Joshi:
Optimal Recoverable Mutual Exclusion Using only FASAS. NETYS 2018: 191-206 - [i1]Prasad Jayanti, Siddhartha V. Jayanti:
Constant Amortized RMR Complexity Deterministic Abortable Mutual Exclusion Algorithm for CC and DSM Models. CoRR abs/1809.04561 (2018) - 2017
- [c35]Prasad Jayanti, Anup Joshi:
Recoverable FCFS Mutual Exclusion with Wait-Free Recovery. DISC 2017: 30:1-30:15 - 2016
- [c34]Chien-Chung Huang, Prasad Jayanti:
Priority Mutual Exclusion: Specification and Algorithm. DISC 2016: 385-398 - 2015
- [c33]Michael Diamond, Prasad Jayanti, Jake Leichtling:
Enhancing Readers-Writers Exclusion with Upgrade/Downgrade Primitives. NETYS 2015: 461-467 - 2012
- [c32]Nikhil Bansal, Vibhor Bhatt, Prasad Jayanti, Ranganath Kondapally:
Tight time-space tradeoff for mutual exclusion. STOC 2012: 971-982 - [c31]Prasad Jayanti, Zhiyu Liu:
Abortable Reader-Writer Locks Are No More Complex Than Abortable Mutex Locks. DISC 2012: 282-296 - 2011
- [c30]Vibhor Bhatt, Prasad Jayanti:
Specification and Constant RMR Algorithm for Phase-Fair Reader-Writer Lock. ICDCN 2011: 119-130 - 2010
- [c29]Vibhor Bhatt, Prasad Jayanti:
Constant RMR solutions to reader writer synchronization. PODC 2010: 468-477
2000 – 2009
- 2009
- [c28]Vibhor Bhatt, Nicholas Christman, Prasad Jayanti:
Extracting quorum failure detectors. PODC 2009: 73-82 - [c27]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 - [c26]Vibhor Bhatt, Prasad Jayanti:
On the Existence of Weakest Failure Detectors for Mutual Exclusion and k-Exclusion. DISC 2009: 311-325 - 2008
- [c25]Prasad Jayanti, Sam Toueg:
Every problem has a weakest failure detector. PODC 2008: 75-84 - [e2]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. Lecture Notes in Computer Science 4904, Springer 2008, ISBN 978-3-540-77443-3 [contents] - 2005
- [c24]Prasad Jayanti, Srdjan Petrovic:
Logarithmic-Time Single Deleter, Multiple Inserter Wait-Free Queues and Stacks. FSTTCS 2005: 408-419 - [c23]Prasad Jayanti, Srdjan Petrovic:
Efficient Wait-Free Implementation of Multiword LL/SC Variables. ICDCS 2005: 59-68 - [c22]Prasad Jayanti, Srdjan Petrovic:
Efficiently Implementing LL/SC Objects Shared by an Unknown Number of Processes. IWDC 2005: 45-56 - [c21]Prasad Jayanti, Srdjan Petrovic:
Efficiently Implementing a Large Number of LL/SC Objects. OPODIS 2005: 17-31 - [c20]Prasad Jayanti, Srdjan Petrovic, Neha Narula:
Read/Write Based Fast-Path Transformation for FCFS Mutual Exclusion. SOFSEM 2005: 209-218 - [c19]Prasad Jayanti:
An optimal multi-writer snapshot algorithm. STOC 2005: 723-732 - 2004
- [j7]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
- [c18]Prasad Jayanti, Srdjan Petrovic, King Tan:
Fair group mutual exclusion. PODC 2003: 275-284 - [c17]Prasad Jayanti, Srdjan Petrovic:
Efficient and practical constructions of LL/SC variables. PODC 2003: 285-294 - [c16]Prasad Jayanti:
Adaptive and efficient abortable mutual exclusion. PODC 2003: 295-304 - 2002
- [c15]Prasad Jayanti:
f-arrays: implementation and applications. PODC 2002: 270-279 - 2001
- [c14]Prasad Jayanti, King Tan, Gregory Friedland, Amir Katz:
Bounding Lamport's Bakery Algorithm. SOFSEM 2001: 261-270 - 2000
- [j6]Prasad Jayanti, James E. Burns, Gary L. Peterson:
Almost Optimal Single Reader, Single Writer Atomic Register. J. Parallel Distributed Comput. 60(2): 150-168 (2000) - [j5]Prasad Jayanti, King Tan, Sam Toueg:
Time and Space Lower Bounds for Nonblocking Implementations. SIAM J. Comput. 30(2): 438-456 (2000)
1990 – 1999
- 1999
- [j4]Prasad Jayanti, Tushar Deepak Chandra, Sam Toueg:
The Cost of Graceful Degradation for Omission Failures. Inf. Process. Lett. 71(3-4): 167-172 (1999) - [e1]Prasad Jayanti:
Distributed Computing, 13th International Symposium, Bratislava, Slovak Republic, September 27-29, 1999, Proceedings. Lecture Notes in Computer Science 1693, Springer 1999, ISBN 3-540-66531-5 [contents] - 1998
- [j3]Prasad Jayanti, Tushar Deepak Chandra, Sam Toueg:
Fault-Tolerant Wait-Free Shared Objects. J. ACM 45(3): 451-500 (1998) - [j2]Prasad Jayanti:
Solvability of Consensus: Composition Breaks Down for NonDeterministic Types. SIAM J. Comput. 28(3): 782-797 (1998) - [c13]Prasad Jayanti:
A Lower Bound on the Local Time Complexity of Universal Constructions. PODC 1998: 183-192 - [c12]Prasad Jayanti:
A Time Complexity Lower Bound for Randomized Implementations of Some Shared Objects. PODC 1998: 201-210 - [c11]Tushar Deepak Chandra, Prasad Jayanti, King Tan:
A Polylog Time Wait-Free Construction for Closed Objects. PODC 1998: 287-296 - [c10]Prasad Jayanti:
A Complete and Constant Time Wait-Free Implementation of CAS from LL/SC and Vice Versa. DISC 1998: 216-230 - 1997
- [j1]Prasad Jayanti:
Robust wait-free hierarchies. J. ACM 44(4): 592-614 (1997) - [c9]Prasad Jayanti, Sanjay Khanna:
On the Power of Multi-objects. WDAG 1997: 320-332 - 1996
- [c8]Prasad Jayanti, King Tan, Sam Toueg:
Time and Space Lower Bounds for Non-Blocking Implementations (Preliminary Version). PODC 1996: 257-266 - 1995
- [c7]Prasad Jayanti:
Wait-free Computing. WDAG 1995: 19-50 - 1994
- [b1]Prasad Jayanti:
Fault-Tolerant Wait-Free Implementations and Robust Wait-Free Hierarchies. Cornell University, USA, 1994 - [c6]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
- [c5]Prasad Jayanti:
On the Robustness of Herlihy's Hierarchy. PODC 1993: 145-157 - 1992
- [c4]Prasad Jayanti, Tushar Deepak Chandra, Sam Toueg:
Fault-tolerant Wait-free Shared Objects. FOCS 1992: 157-166 - [c3]Prasad Jayanti, Sam Toueg:
Some Results on the Impossibility, Universality, and Decidability of Consensus. WDAG 1992: 69-84 - 1991
- [c2]Prasad Jayanti, Adarshpal S. Sethi, Errol L. Lloyd:
Minimal Shared Information for Concurrent Reading and Writing. WDAG 1991: 212-228 - 1990
- [c1]Prasad Jayanti, Sam Toueg:
Wakeup under Read/Write Atomicity. WDAG 1990: 277-288
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 20:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
