We stand with Ukraine

We stand with Ukraine

Prasad Jayanti

Orcid: 0000-0002-8930-3467

Affiliations:

Dartmouth College, Hanover, USA

According to our database¹, Prasad Jayanti authored at least 57 papers between 1990 and 2024.

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

Online presence:

on cs.dartmouth.edu

On csauthors.net:

Bibliography

2024

A Universal, Sound, and Complete Forward Reasoning Technique for Machine-Verified Proofs of Linearizability.

[BibT_eX]

[DOI]

,

Siddhartha Jayanti

,

,

Lizzie Hernandez

Proc. ACM Program. Lang., January, 2024

2023

Constant RMR Recoverable Mutex under System-wide Crashes.

[BibT_eX]

[DOI]

,

Siddhartha Jayanti

,

CoRR, 2023

A Universal Technique for Machine-Certified Proofs of Linearizable Algorithms.

[BibT_eX]

[DOI]

,

Siddhartha Jayanti

,

,

Lizzie Hernandez

CoRR, 2023

Durable Algorithms for Writable LL/SC and CAS with Dynamic Joining.

[BibT_eX]

[DOI]

,

Siddhartha Jayanti

,

Sucharita Jayanti

Proceedings of the 37th International Symposium on Distributed Computing, 2023

Constant RMR System-wide Failure Resilient Durable Locks with Dynamic Joining.

[BibT_eX]

[DOI]

,

Siddhartha Jayanti

,

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Brief Announcement: Efficient Recoverable Writable-CAS.

[BibT_eX]

[DOI]

,

Siddhartha Visveswara Jayanti

,

Sucharita Jayanti

Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

2022

Recoverable mutual exclusion with abortability.

[BibT_eX]

[DOI]

,

Computing, 2022

2021

Deterministic Constant-Amortized-RMR Abortable Mutex for CC and DSM.

[BibT_eX]

[DOI]

,

Siddhartha Jayanti

ACM Trans. Parallel Comput., 2021

2020

Towards an Ideal Queue Lock.

[BibT_eX]

[DOI]

,

Siddhartha Jayanti

,

Sucharita Jayanti

Proceedings of the ICDCN 2020: 21st International Conference on Distributed Computing and Networking, 2020

2019

Recoverable Mutual Exclusion with Sub-logarithmic RMR Complexity on CC and DSM machines.

[BibT_eX]

[DOI]

,

Siddhartha V. Jayanti

,

CoRR, 2019

2019 Principles of Distributed Computing Doctoral Dissertation Award.

[BibT_eX]

[DOI]

,

,

Boaz Patt-Shamir

,

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

A Recoverable Mutex Algorithm with Sub-logarithmic RMR on Both CC and DSM.

[BibT_eX]

[DOI]

,

Siddhartha V. Jayanti

,

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Constant Amortized RMR Abortable Mutex for CC and DSM.

[BibT_eX]

[DOI]

,

Siddhartha Jayanti

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

2018

Constant Amortized RMR Complexity Deterministic Abortable Mutual Exclusion Algorithm for CC and DSM Models.

[BibT_eX]

[DOI]

,

Siddhartha V. Jayanti

CoRR, 2018

Optimal Recoverable Mutual Exclusion Using only FASAS.

[BibT_eX]

[DOI]

,

Siddhartha V. Jayanti

,

Proceedings of the Networked Systems - 6th International Conference, 2018

2017

Recoverable FCFS Mutual Exclusion with Wait-Free Recovery.

[BibT_eX]

[DOI]

,

Proceedings of the 31st International Symposium on Distributed Computing, 2017

2016

Priority Mutual Exclusion: Specification and Algorithm.

[BibT_eX]

[DOI]

Chien-Chung Huang

,

Proceedings of the Distributed Computing - 30th International Symposium, 2016

2015

Enhancing Readers-Writers Exclusion with Upgrade/Downgrade Primitives.

[BibT_eX]

[DOI]

Michael Diamond

,

,

Jake Leichtling

Proceedings of the Networked Systems - Third International Conference, 2015

2012

Abortable Reader-Writer Locks Are No More Complex Than Abortable Mutex Locks.

[BibT_eX]

[DOI]

,

Proceedings of the Distributed Computing - 26th International Symposium, 2012

Tight time-space tradeoff for mutual exclusion.

[BibT_eX]

[DOI]

,

,

,

Ranganath Kondapally

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

2011

Specification and Constant RMR Algorithm for Phase-Fair Reader-Writer Lock.

[BibT_eX]

[DOI]

,

Proceedings of the Distributed Computing and Networking - 12th International Conference, 2011

2010

Constant RMR solutions to reader writer synchronization.

[BibT_eX]

[DOI]

,

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

2009

On the Existence of Weakest Failure Detectors for Mutual Exclusion and <i>k</i>-Exclusion.

[BibT_eX]

[DOI]

,

Proceedings of the Distributed Computing, 23rd International Symposium, 2009

The 2009 Edsger W. Dijkstra Prize in Distributed Computing.

[BibT_eX]

[DOI]

,

Rachid Guerraoui

,

,

,

,

Jennifer L. Welch

Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Extracting quorum failure detectors.

[BibT_eX]

[DOI]

,

Nicholas Christman

,

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

2008

Every problem has a weakest failure detector.

[BibT_eX]

[DOI]

,

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

2005

An optimal multi-writer snapshot algorithm.

[BibT_eX]

[DOI]

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Read/Write Based Fast-Path Transformation for FCFS Mutual Exclusion.

[BibT_eX]

[DOI]

,

Srdjan Petrovic

,

Proceedings of the SOFSEM 2005: Theory and Practice of Computer Science, 2005

Efficiently Implementing a Large Number of LL/SC Objects.

[BibT_eX]

[DOI]

,

Srdjan Petrovic

Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005

Efficiently Implementing LL/SC Objects Shared by an Unknown Number of Processes.

[BibT_eX]

[DOI]

,

Srdjan Petrovic

Proceedings of the Distributed Computing, 2005

Efficient Wait-Free Implementation of Multiword LL/SC Variables.

[BibT_eX]

[DOI]

,

Srdjan Petrovic

Proceedings of the 25th International Conference on Distributed Computing Systems (ICDCS 2005), 2005

Logarithmic-Time Single Deleter, Multiple Inserter Wait-Free Queues and Stacks.

[BibT_eX]

[DOI]

,

Srdjan Petrovic

Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

2004

Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus.

[BibT_eX]

[DOI]

Tushar Deepak Chandra

,

Vassos Hadzilacos

,

,

SIAM J. Comput., 2004

2003

Fair group mutual exclusion.

[BibT_eX]

[DOI]

,

Srdjan Petrovic

,

Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Efficient and practical constructions of LL/SC variables.

[BibT_eX]

[DOI]

,

Srdjan Petrovic

Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Adaptive and efficient abortable mutual exclusion.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

2002

<i>f</i>-arrays: implementation and applications.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

2001

Bounding Lamport's Bakery Algorithm.

[BibT_eX]

[DOI]

,

,

Gregory Friedland

,

Proceedings of the SOFSEM 2001: Theory and Practice of Informatics, 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24, 2001

2000

Time and Space Lower Bounds for Nonblocking Implementations.

[BibT_eX]

[DOI]

,

,

SIAM J. Comput., 2000

Almost Optimal Single Reader, Single Writer Atomic Register.

[BibT_eX]

[DOI]

,

,

Gary L. Peterson

J. Parallel Distributed Comput., 2000

1999

The Cost of Graceful Degradation for Omission Failures.

[BibT_eX]

[DOI]

,

Tushar Deepak Chandra

,

Inf. Process. Lett., 1999

1998

Solvability of Consensus: Composition Breaks Down for NonDeterministic Types.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

Fault-Tolerant Wait-Free Shared Objects.

[BibT_eX]

[DOI]

,

Tushar Deepak Chandra

,

J. ACM, 1998

A Complete and Constant Time Wait-Free Implementation of CAS from LL/SC and Vice Versa.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 12th International Symposium, 1998

A Time Complexity Lower Bound for Randomized Implementations of Some Shared Objects.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

A Lower Bound on the Local Time Complexity of Universal Constructions.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

A Polylog Time Wait-Free Construction for Closed Objects.

[BibT_eX]

[DOI]

Tushar Deepak Chandra

,

,

Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

1997

Robust wait-free hierarchies.

[BibT_eX]

[DOI]

J. ACM, 1997

On the Power of Multi-objects.

[BibT_eX]

[DOI]

,

Proceedings of the Distributed Algorithms, 11th International Workshop, 1997

1996

Time and Space Lower Bounds for Non-Blocking Implementations (Preliminary Version).

[BibT_eX]

[DOI]

,

,

Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

1995

Wait-free Computing.

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 9th International Workshop, 1995

1994

Fault-Tolerant Wait-Free Implementations and Robust Wait-Free Hierarchies.

[BibT_eX]

PhD thesis, 1994

Wait-Freedom vs. t-Resiliency and the Robustness of Wait-Free Hierarchies.

[BibT_eX]

[DOI]

Tushar Deepak Chandra

,

Vassos Hadzilacos

,

,

Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

1993

On the Robustness of Herlihy's Hierarchy.

[BibT_eX]

[DOI]

Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, 1993

1992

Some Results on the Impossibility, Universality, and Decidability of Consensus.

[BibT_eX]

[DOI]

,

Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

1991

Minimal Shared Information for Concurrent Reading and Writing.

[BibT_eX]

[DOI]

,

Adarshpal S. Sethi

,

Proceedings of the Distributed Algorithms, 5th International Workshop, 1991

1990

Wakeup under Read/Write Atomicity.

[BibT_eX]

[DOI]

,

Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

Loading...