6 citations · 31 across the 34 of their papers we have counts for
35 papers
DAG-Inducing Problems and Algorithms
Arya Tanmay Gupta, Sandeep S Kulkarni
Consider the execution of a sequential algorithm that requires the program to converge to an optimal state, and then terminate/stutter. To design such an algorithm, we need to ensu…
Tolerance to Asynchrony in Algorithms for Multiplication and Modulo
Arya Tanmay Gupta, Sandeep S Kulkarni
In this article, we study some parallel processing algorithms for multiplication and modulo operations. We demonstrate that the state transitions that are formed under these algori…
Privacy-Preserving Methods for Outlier-Resistant Average Consensus and Shallow Ranked Vote Leader Election
Luke Sperling, Sandeep S Kulkarni
Consensus and leader election are fundamental problems in distributed systems. Consensus is the problem in which all processes in a distributed computation must agree on some value…
Fully Lattice-Linear Algorithms
Arya Tanmay Gupta, Sandeep S Kulkarni
Lattice-linearity was introduced as a way to model problems using predicates that induce a lattice among the global states (Garg, SPAA 2020). A key property of \textit{the predicat…
Fully Lattice Linear Algorithms
Arya Tanmay Gupta, Sandeep S Kulkarni
This paper focuses on analyzing and differentiating between lattice linear problems and algorithms. It introduces a new class of algorithms called \textit{(fully) lattice linear al…
Impact of the Consistency Model on Checkpointing of Distributed Shared Memory
Sandeep Kulkarni, Duong Nguyen, Lewis Tseng +1
In this report, we consider the impact of the consistency model on checkpointing and rollback algorithms for distributed shared memory. In particular, we consider specific implemen…