13 citations · 28 across the 7 of their papers we have counts for
8 papers
Solving sparse linear systems with approximate inverse preconditioners on analog devices
Vasileios Kalantzis, Anshul Gupta, Lior Horesh +3
Sparse linear system solvers are computationally expensive kernels that lie at the heart of numerous applications. This paper proposes a flexible preconditioning framework to subst…
Finding All Bounded-Length Simple Cycles in a Directed Graph
Anshul Gupta, Toyotaro Suzumura
A new efficient algorithm is presented for finding all simple cycles that satisfy a length constraint in a directed graph. When the number of vertices is non-trivial, most cycle-fi…
Sensor-Based Spreader Automation for Reducing Salt Use and Improving Safety
Ayushmaan Aggarwal, Niharika Bhattacharjee, Aadi Bhattacharya +5
Over 30 million tons of deicing salt is applied on U.S. roads annually at a cost of roughly $1.2 billion and with significant negative environmental impact. Therefore, it is desira…
Incentive Stackelberg Mean-payoff Games
Anshul Gupta, M. S. Krishna Deepak, Bharath Kumar Padarthi +2
We introduce and study incentive equilibria for multi-player meanpayoff games. Incentive equilibria generalise well-studied solution concepts such as Nash equilibria and leader equ…
Making the Best of Limited Memory in Multi-Player Discounted Sum Games
Anshul Gupta, Sven Schewe, Dominik Wojtczak
In this paper, we establish the existence of optimal bounded memory strategy profiles in multi-player discounted sum games. We introduce a non-deterministic approach to compute opt…
The benefit of law-making power
Anshul Gupta, Sven Schewe
We study optimal equilibria in multi-player games. An equilibrium is optimal for a player, if her payoff is maximal. A tempting approach to solving this problem is to seek optimal…
Revisiting Asynchronous Linear Solvers: Provable Convergence Rate Through Randomization
Haim Avron, Alex Druinsky, Anshul Gupta
Asynchronous methods for solving systems of linear equations have been researched since Chazan and Miranker's pioneering 1969 paper on chaotic relaxation. The underlying idea of as…
Extending Task Parallelism for Frequent Pattern Mining
Prabhanjan Kambadur, Amol Ghoting, Anshul Gupta +1
Algorithms for frequent pattern mining, a popular informatics application, have unique requirements that are not met by any of the existing parallel tools. In particular, such appl…