5 citations · 5 across the 3 of their papers we have counts for
6 papers
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…
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…