Prasad Jayanti
Affiliations: | Dartmouth College, Hanover, NH, United States |
Area:
Computer ScienceGoogle:
"Prasad Jayanti"Children
Sign in to add traineeKing Y. Tan | grad student | 2004 | Dartmouth |
Srdjan Petrovic | grad student | 2006 | Dartmouth |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Diamond M, Jayanti P, Leichtling J. (2015) Enhancing readers-writers exclusion with upgrade/downgrade primitives Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9466: 461-467 |
Jayanti P, Liu Z. (2012) Abortable reader-writer locks are no more complex than abortable mutex locks Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7611: 282-296 |
Bhatt V, Jayanti P. (2011) Specification and constant RMR algorithm for phase-fair reader-writer lock Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6522: 119-130 |
Bhatt V, Jayanti P. (2010) Constant RMR solutions to reader writer synchronization Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 468-477 |
Jayanti P, Petrovic S. (2006) Efficiently implementing a large number of LL/SC objects Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3974: 17-31 |
Jayanti P. (2005) An optimal multi-writer snapshot algorithm Proceedings of the Annual Acm Symposium On Theory of Computing. 723-732 |
Chandra T, Hadzilacos V, Jayanti P, et al. (2005) Generalized irreducibility of consensus and the equivalence of t-resilient and wait-free implementations of consensus Siam Journal On Computing. 34: 333-357 |
Jayanti P, Petrovic S. (2005) Efficiently implementing LL/SC objects shared by an unknown number of processes Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3741: 45-56 |
Jayanti P, Petrovic S. (2005) Logarithmic-time single deleter, multiple inserter wait-free queues and stacks Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3821: 408-419 |
Jayanti P, Petrovic S. (2005) Efficient wait-free implementation of multiword LL/SC variables Proceedings - International Conference On Distributed Computing Systems. 59-68 |