5 citations · 17 across the 10 of their papers we have counts for
14 papers
Asynchronous Quantum Distributed Computing: Causality, Snapshots, and Global Operations
Siddhartha Visveswara Jayanti, Anand Natarajan
We initiate the study of asynchronous quantum distributed systems, focusing on the case of implementing atomic quantum global operations that can be decomposed into a collection of…
On the First Computer Science Research Paper in an Indian Language and the Future of Science in Indian Languages
Siddhartha Visveswara Jayanti
I describe my experience writing the first original, modern Computer Science research paper expressed entirely in an Indian language. The paper is in Telugu, a language with approx…
A Universal Technique for Machine-Certified Proofs of Linearizable Algorithms
Prasad Jayanti, Siddhartha Jayanti, Ugur Y. Yavuz +1
Linearizability has been the long standing gold standard for consistency in concurrent data structures. However, proofs of linearizability can be long and intricate, hard to produc…
Constant RMR Recoverable Mutex under System-wide Crashes
Prasad Jayanti, Siddhartha Jayanti, Anup Joshi
We design two Recoverable Mutual Exclusion (RME) locks for the system-wide crash model. Our first algorithm requires only space per process, and achieves worst-case R…
Durable Algorithms for Writable LL/SC and CAS with Dynamic Joining
Prasad Jayanti, Siddhartha Jayanti, Sucharita Jayanti
We present durable implementations for two well known universal primitives -- CAS (compare-and-swap), and its ABA-free counter-part LLSC (load-linked, store-conditional). All our i…
Generalized Wake-Up: Amortized Shared Memory Lower Bounds for Linearizable Data Structures
Siddhartha Visveswara Jayanti
In this work, we define the generalized wake-up problem, , for a shared memory asynchronous system with processes. Informally, the problem, which is parametrized by an…
Nash Equilibria of The Multiplayer Colonel Blotto Game on Arbitrary Measure Spaces
Siddhartha Jayanti
The Colonel Blotto Problem proposed by Borel in 1921 has served as a widely applicable model of budget-constrained simultaneous winner-take-all competitions in the social sciences.…
Concurrent Disjoint Set Union
Siddhartha V. Jayanti, Robert E. Tarjan
We develop and analyze concurrent algorithms for the disjoint set union (union-find) problem in the shared memory, asynchronous multiprocessor model of computation, with CAS (compa…
The Multiplayer Colonel Blotto Game
Enric Boix-Adserà, Benjamin L. Edelman, Siddhartha Jayanti
We initiate the study of the natural multiplayer generalization of the classic continuous Colonel Blotto game. The two-player Blotto game, introduced by Borel as a model of resourc…
Learning from weakly dependent data under Dobrushin's condition
Yuval Dagan, Constantinos Daskalakis, Nishanth Dikkala +1
Statistical learning theory has largely focused on learning and generalization given independent and identically distributed (i.i.d.) samples. Motivated by applications involving t…
A Recoverable Mutex Algorithm with Sub-logarithmic RMR on Both CC and DSM
Prasad Jayanti, Siddhartha Jayanti, Anup Joshi
In light of recent advances in non-volatile main memory technology, Golab and Ramaraju reformulated the traditional mutex problem into the novel {\em Recoverable Mutual Exclusion}…
HOGWILD!-Gibbs can be PanAccurate
Constantinos Daskalakis, Nishanth Dikkala, Siddhartha Jayanti
Asynchronous Gibbs sampling has been recently shown to be fast-mixing and an accurate method for estimating probabilities of events on a small number of variables of a graphical mo…
Constant Amortized RMR Complexity Deterministic Abortable Mutual Exclusion Algorithm for CC and DSM Models
Prasad Jayanti, Siddhartha Jayanti
The abortable mutual exclusion problem was introduced by Scott and Scherer to meet a need that arises in database and real time systems, where processes sometimes have to abandon t…
A Randomized Concurrent Algorithm for Disjoint Set Union
Siddhartha V. Jayanti, Robert E. Tarjan
The disjoint set union problem is a basic problem in data structures with a wide variety of applications. We extend a known efficient sequential algorithm for this problem to obtai…