Siddhartha Jayanti

Orcid: 0000-0002-2681-1632

According to our database1, Siddhartha Jayanti authored at least 23 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Universal, Sound, and Complete Forward Reasoning Technique for Machine-Verified Proofs of Linearizability.
Proc. ACM Program. Lang., January, 2024

2023
Constant RMR Recoverable Mutex under System-wide Crashes.
CoRR, 2023

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

Durable Algorithms for Writable LL/SC and CAS with Dynamic Joining.
Proceedings of the 37th International Symposium on Distributed Computing, 2023

Constant RMR System-wide Failure Resilient Durable Locks with Dynamic Joining.
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Brief Announcement: Efficient Recoverable Writable-CAS.
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

2022
Generalized Wake-Up: Amortized Shared Memory Lower Bounds for Linearizable Data Structures.
CoRR, 2022

2021
Deterministic Constant-Amortized-RMR Abortable Mutex for CC and DSM.
ACM Trans. Parallel Comput., 2021

The multiplayer Colonel Blotto game.
Games Econ. Behav., 2021

Concurrent disjoint set union.
Distributed Comput., 2021

Nash Equilibria of The Multiplayer Colonel Blotto Game on Arbitrary Measure Spaces.
CoRR, 2021

Fast Arrays: Atomic Arrays with Constant Time Initialization.
Proceedings of the 35th International Symposium on Distributed Computing, 2021

2020
Towards an Ideal Queue Lock.
Proceedings of the ICDCN 2020: 21st International Conference on Distributed Computing and Networking, 2020

2019
Efficient Constructions for Almost-everywhere Secure Computation.
IACR Cryptol. ePrint Arch., 2019

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

Randomized Concurrent Set Union and Generalized Wake-Up.
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.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Constant Amortized RMR Abortable Mutex for CC and DSM.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Learning from Weakly Dependent Data under Dobrushin's Condition.
Proceedings of the Conference on Learning Theory, 2019

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

HOGWILD!-Gibbs can be PanAccurate.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Optimal Recoverable Mutual Exclusion Using only FASAS.
Proceedings of the Networked Systems - 6th International Conference, 2018

2016
A Randomized Concurrent Algorithm for Disjoint Set Union.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016


  Loading...