Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSiddhartha Jayanti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j4]Prasad Jayanti
, Siddhartha Jayanti, Ugur Y. Yavuz, Lizzie Hernandez:
A Universal, Sound, and Complete Forward Reasoning Technique for Machine-Verified Proofs of Linearizability. Proc. ACM Program. Lang. 8(POPL): 2456-2484 (2024)- 2021
- [j3]Siddhartha V. Jayanti, Robert E. Tarjan:
Concurrent disjoint set union. Distributed Comput. 34(6): 413-436 (2021) - [j2]Enric Boix-Adserà, Benjamin L. Edelman, Siddhartha Jayanti:
The multiplayer Colonel Blotto game. Games Econ. Behav. 129: 15-31 (2021) - [j1]Prasad Jayanti, Siddhartha Jayanti:
Deterministic Constant-Amortized-RMR Abortable Mutex for CC and DSM. ACM Trans. Parallel Comput. 8(4): 22:1-22:26 (2021)
Conference and Workshop Papers
- 2024
- [c15]Prasad Jayanti, Siddhartha Jayanti, Sucharita Jayanti:
MemSnap: A Fast Adaptive Snapshot Algorithm for RMWable Shared-Memory. PODC 2024: 25-35 - 2023
- [c14]Prasad Jayanti, Siddhartha Visveswara Jayanti, Sucharita Jayanti:
Brief Announcement: Efficient Recoverable Writable-CAS. PODC 2023: 366-369 - [c13]Prasad Jayanti, Siddhartha Jayanti, Anup Joshi:
Constant RMR System-wide Failure Resilient Durable Locks with Dynamic Joining. SPAA 2023: 227-237 - [c12]Prasad Jayanti, Siddhartha Jayanti, Sucharita Jayanti:
Durable Algorithms for Writable LL/SC and CAS with Dynamic Joining. DISC 2023: 25:1-25:20 - 2021
- [c11]Siddhartha Jayanti, Julian Shun:
Fast Arrays: Atomic Arrays with Constant Time Initialization. DISC 2021: 25:1-25:19 - 2020
- [c10]Siddhartha Jayanti, Srinivasan Raghuraman, Nikhil Vyas:
Efficient Constructions for Almost-Everywhere Secure Computation. EUROCRYPT (2) 2020: 159-183 - [c9]Prasad Jayanti, Siddhartha Jayanti, Sucharita Jayanti:
Towards an Ideal Queue Lock. ICDCN 2020: 19:1-19:10 - [c8]Enric Boix-Adserà, Benjamin L. Edelman, Siddhartha Jayanti:
The Multiplayer Colonel Blotto Game. EC 2020: 47-48 - 2019
- [c7]Yuval Dagan, Constantinos Daskalakis, Nishanth Dikkala, Siddhartha Jayanti:
Learning from Weakly Dependent Data under Dobrushin's Condition. COLT 2019: 914-928 - [c6]Prasad Jayanti, Siddhartha Jayanti:
Constant Amortized RMR Abortable Mutex for CC and DSM. PODC 2019: 167-176 - [c5]Prasad Jayanti, Siddhartha V. Jayanti, Anup Joshi:
A Recoverable Mutex Algorithm with Sub-logarithmic RMR on Both CC and DSM. PODC 2019: 177-186 - [c4]Siddhartha V. Jayanti, Robert E. Tarjan, Enric Boix-Adserà:
Randomized Concurrent Set Union and Generalized Wake-Up. PODC 2019: 187-196 - 2018
- [c3]Prasad Jayanti, Siddhartha V. Jayanti, Anup Joshi:
Optimal Recoverable Mutual Exclusion Using only FASAS. NETYS 2018: 191-206 - [c2]Constantinos Daskalakis, Nishanth Dikkala, Siddhartha Jayanti:
HOGWILD!-Gibbs can be PanAccurate. NeurIPS 2018: 32-41 - 2016
- [c1]Siddhartha V. Jayanti, Robert E. Tarjan:
A Randomized Concurrent Algorithm for Disjoint Set Union. PODC 2016: 75-82
Informal and Other Publications
- 2023
- [i13]Prasad Jayanti, Siddhartha Jayanti, Sucharita Jayanti:
Durable Algorithms for Writable LL/SC and CAS with Dynamic Joining. CoRR abs/2302.00135 (2023) - [i12]Prasad Jayanti, Siddhartha Jayanti, Ugur Y. Yavuz, Lizzie Hernandez:
A Universal Technique for Machine-Certified Proofs of Linearizable Algorithms. CoRR abs/2302.00737 (2023) - [i11]Prasad Jayanti, Siddhartha Jayanti, Anup Joshi:
Constant RMR Recoverable Mutex under System-wide Crashes. CoRR abs/2302.00748 (2023) - 2022
- [i10]Siddhartha Visveswara Jayanti:
Generalized Wake-Up: Amortized Shared Memory Lower Bounds for Linearizable Data Structures. CoRR abs/2207.07561 (2022) - 2021
- [i9]Siddhartha Jayanti:
Nash Equilibria of The Multiplayer Colonel Blotto Game on Arbitrary Measure Spaces. CoRR abs/2104.11298 (2021) - 2020
- [i8]Enric Boix-Adserà, Benjamin L. Edelman, Siddhartha Jayanti:
The Multiplayer Colonel Blotto Game. CoRR abs/2002.05240 (2020) - [i7]Siddhartha V. Jayanti, Robert E. Tarjan:
Concurrent Disjoint Set Union. CoRR abs/2003.01203 (2020) - 2019
- [i6]Prasad Jayanti, Siddhartha V. Jayanti, Anup Joshi:
Recoverable Mutual Exclusion with Sub-logarithmic RMR Complexity on CC and DSM machines. CoRR abs/1904.02124 (2019) - [i5]Yuval Dagan, Constantinos Daskalakis, Nishanth Dikkala, Siddhartha Jayanti:
Learning from weakly dependent data under Dobrushin's condition. CoRR abs/1906.09247 (2019) - [i4]Siddhartha Jayanti, Srinivasan Raghuraman, Nikhil Vyas:
Efficient Constructions for Almost-everywhere Secure Computation. IACR Cryptol. ePrint Arch. 2019: 156 (2019) - 2018
- [i3]Prasad Jayanti, Siddhartha V. Jayanti:
Constant Amortized RMR Complexity Deterministic Abortable Mutual Exclusion Algorithm for CC and DSM Models. CoRR abs/1809.04561 (2018) - [i2]Constantinos Daskalakis, Nishanth Dikkala, Siddhartha Jayanti:
HOGWILD!-Gibbs can be PanAccurate. CoRR abs/1811.10581 (2018) - 2016
- [i1]Siddhartha V. Jayanti, Robert E. Tarjan:
A Randomized Concurrent Algorithm for Disjoint Set Union. CoRR abs/1612.01514 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-09 05:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
