Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Prasad Jayanti
Observed names:
Jayanti, Prasad,
P. Jayanti
Institution:
Dartmouth College
Observed institutions:
Dartmouth College,
Cornell University
ORCID:
0000-0002-8930-3467
Observed ORCID:
0000-0002-8930-3467
OpenAlex ID:
A5000699482
Fault-tolerant wait-free shared objects
1998
·
Prasad Jayanti
, Tushar Deepak Chandra
, et al.
·
Journal of the ACM
·
104
PDF
Time and Space Lower Bounds for Nonblocking Implementations
2000
·
Prasad Jayanti
, King Tan
, et al.
·
SIAM Journal on Computing
·
83
f -arrays
2002
·
Prasad Jayanti
·
67
Some results on the impossibility, universality, and decidability of consensus
1992
·
Prasad Jayanti
, Sam Toueg
·
Lecture notes in computer science
·
61
Adaptive and efficient abortable mutual exclusion
2003
·
Prasad Jayanti
·
59
Robust wait-free hierarchies
1997
·
Prasad Jayanti
·
Journal of the ACM
·
59
PDF
An optimal multi-writer snapshot algorithm
2005
·
Prasad Jayanti
·
ACM Symposium on Theory of Computing (STOC)
·
58
On the robustness of Herlihy's hierarchy
1993
·
Prasad Jayanti
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
54
PDF
Efficient and practical constructions of LL/SC variables
2003
·
Prasad Jayanti
, Srdjan Petrovic
·
49
Every problem has a weakest failure detector
2008
·
Prasad Jayanti
, Sam Toueg
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
47
A time complexity lower bound for randomized implementations of some shared objects
1998
·
Prasad Jayanti
·
43
Wait-freedom vs. t -resiliency and the robustness of wait-free hierarchies (extended abstract)
1994
·
Tushar Chandra
, Vassos Hadzilacos
, et al.
·
29
PDF
Generalized Irreducibility of Consensus and the Equivalence of t -Resilient and Wait-Free Implementations of Consensus
2004
·
Tushar Chandra
, Vassos Hadzilacos
, et al.
·
SIAM Journal on Computing
·
28
Wait-Freedom vs. t-Resiliency and the Robustness of Wait-Free Hierarchies.
1994
·
Tushar Chandra
, Vassos Hadzilacos
, et al.
·
Principles of Distributed Computing
·
26
A complete and constant time wait-free implementation of CAS from LL/SC and vice versa
1998
·
Prasad Jayanti
·
Lecture notes in computer science
·
23
Recoverable FCFS Mutual Exclusion with Wait-Free Recovery
2017
·
Jayanti, Prasad
, Joshi, Anup
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
22
PDF
A Recoverable Mutex Algorithm with Sub-logarithmic RMR on Both CC and DSM
2019
·
Prasad Jayanti
, Siddhartha Jayanti
, et al.
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
21
PDF
Efficient Wait-Free Implementation of Multiword LL/SC Variables
2005
·
P. Jayanti
, S. Petrovic
·
IEEE International Conference on Distributed Computing Systems (ICDCS)
·
20
A polylog time wait-free construction for closed objects
1998
·
Tushar Deepak Chandra
, Prasad Jayanti
, et al.
·
20
PDF
Wakeup under read/write atomicity
1991
·
Prasad Jayanti
, Sam Toueg
·
Lecture notes in computer science
·
20
Logarithmic-Time Single Deleter, Multiple Inserter Wait-Free Queues and Stacks
2005
·
Prasad Jayanti
, Srdjan Petrovic
·
Lecture notes in computer science
·
18
Bounding Lamport’s Bakery Algorithm
2001
·
Prasad Jayanti
, King Tan
, et al.
·
Lecture notes in computer science
·
18
Proceedings of the 13th International Symposium on Distributed Computing
1999
·
Prasad Jayanti
·
18
Fair group mutual exclusion
2003
·
Prasad Jayanti
, Srdjan Petrovic
, et al.
·
17
Wait-free computing
1995
·
Prasad Jayanti
·
Lecture notes in computer science
·
16
Show more works
View as search
Works count:
87
Citation count:
1,195
H-index:
20
I10-index:
33
Year
Topic
Type
