Siddhartha Jayanti

Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

Fast, Scalable, and Machine-Verified Multicore Disjoint Set Union Data Structures and their Wide Deployment in Parallel Algorithms (Abstract).

[BibT_eX]

[DOI]

Siddhartha Visveswara Jayanti

Proceedings of the 2024 ACM Workshop on Highlights of Parallel Computing, 2024

Meta-Configuration Tracking for Machine-Certified Correctness of Concurrent Data Structures (Abstract).

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM Workshop on Highlights of Parallel Computing, 2024

2023

Simple, Fast, Scalable, and Reliable Multiprocessor Algorithms

[BibT_eX]

[DOI]

PhD thesis, 2023

Constant RMR Recoverable Mutex under System-wide Crashes.

[BibT_eX]

[DOI]

CoRR, 2023

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

[BibT_eX]

[DOI]

CoRR, 2023

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

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

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

Siddhartha Visveswara Jayanti

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.

[BibT_eX]

[DOI]

CoRR, 2022

2021

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

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2021

The multiplayer Colonel Blotto game.

[BibT_eX]

[DOI]

Enric Boix-Adserà

Benjamin L. Edelman

Games Econ. Behav., 2021

Concurrent disjoint set union.

[BibT_eX]

[DOI]

Distributed Comput., 2021

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

[BibT_eX]

[DOI]

CoRR, 2021

Fast Arrays: Atomic Arrays with Constant Time Initialization.

[BibT_eX]

[DOI]

Julian Shun

Proceedings of the 35th International Symposium on Distributed Computing, 2021

2020

Towards an Ideal Queue Lock.

[BibT_eX]

[DOI]

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

2019

Efficient Constructions for Almost-everywhere Secure Computation.

[BibT_eX]

[DOI]

Srinivasan Raghuraman

Nikhil Vyas

IACR Cryptol. ePrint Arch., 2019

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

[BibT_eX]

[DOI]

CoRR, 2019

Randomized Concurrent Set Union and Generalized Wake-Up.

[BibT_eX]

[DOI]

Enric Boix-Adserà

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]

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

Constant Amortized RMR Abortable Mutex for CC and DSM.

[BibT_eX]

[DOI]

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

Learning from Weakly Dependent Data under Dobrushin's Condition.

[BibT_eX]

[DOI]

Yuval Dagan

Constantinos Daskalakis

Nishanth Dikkala

Proceedings of the Conference on Learning Theory, 2019

2018

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

[BibT_eX]

[DOI]

CoRR, 2018

HOGWILD!-Gibbs can be PanAccurate.

[BibT_eX]

[DOI]

Constantinos Daskalakis

Nishanth Dikkala

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.

[BibT_eX]

[DOI]

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

2016

A Randomized Concurrent Algorithm for Disjoint Set Union.

[BibT_eX]

[DOI]