10 citations · 15 across the 13 of their papers we have counts for
13 papers
Convergence Sans Synchronization
Arya Tanmay Gupta
We currently see a steady rise in the usage and size of multiprocessor systems, and so the community is evermore interested in developing fast parallel processing algorithms. Howev…
Eventually Lattice-Linear Algorithms
Arya Tanmay Gupta, Sandeep S Kulkarni
Lattice-linear systems allow nodes to execute asynchronously. We introduce eventually lattice-linear algorithms, where lattices are induced only among the states in a subset of the…
Tolerance to Asynchrony of an Algorithm for Gathering Myopic Robots on an Infinite Triangular Grid
Arya Tanmay Gupta, Sandeep S Kulkarni
In this paper, we study the problem of gathering distance-1 myopic robots on an infinite triangular grid. We show that the algorithm developed by Goswami et al. (SSS, 2022) is latt…
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…
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…
Extending Lattice linearity for Self-Stabilizing Algorithms
Arya Tanmay Gupta, Sandeep S Kulkarni
In this article, we focus on extending the notion of lattice linearity to self-stabilizing programs. Lattice linearity allows a node to execute its actions with old information abo…
A secure home automation prototype built on raspberry-pi
Arya Tanmay Gupta, Himani Gupta, Muskan Sharma +1
With the development of sensors, wireless mobile communication, embedded system, the technologies of the Internet of Things have been widely used in SmartMeter, public security, in…
Technical Report: Using Static Analysis to Compute Benefit of Tolerating Consistency
Duong Nguyen, Arya Tanmay Gupta, Sandeep S. Kulkarni
Synchronization is the Achilles heel of concurrent programs. Synchronization requirement is often used to ensure that the execution of the concurrent program can be serialized. Wit…
Spread and defend infection in graphs
Arya Tanmay Gupta
The spread of an infection, a contagion, meme, emotion, message and various other spreadable objects have been discussed in several works. Burning and firefighting have been discus…
Burning Geometric Graphs
Arya Tanmay Gupta
A procedure called \textit{graph burning} was introduced to facilitate the modelling of spread of an alarm, a social contagion, or a social influence or emotion on graphs and netwo…
NP-Completeness Results for Graph Burning on Geometric Graphs
Arya Tanmay Gupta, Swapnil A. Lokhande, Kaushik Mondal
Graph burning runs on discrete time steps. The aim is to burn all the vertices in a given graph in the least number of time steps. This number is known to be the burning number of…