4 citations · 5 across the 7 of their papers we have counts for
8 papers
Dynamic Necklace Splitting
Rishi Advani, Abolfazl Asudeh, Mohsen Dehghankar +1
The necklace splitting problem is a classic problem in fair division with many applications, including data-informed fair hash maps. We extend necklace splitting to a dynamic setti…
Decentralized Fair Division
Joel Miller, Rishi Advani, Ian Kash +2
Fair division is typically framed from a centralized perspective. However, in practice resource allocation often occurs via decentralized networks. We study a decentralized variant…
Online Maximum Independent Set of Hyperrectangles
Rishi Advani, Abolfazl Asudeh
The maximum independent set problem is a classical NP-hard problem in theoretical computer science. In this work, we study a special case where the family of graphs considered is r…
[Experiments & Analysis] Evaluating the Feasibility of Sampling-Based Techniques for Training Multilayer Perceptrons
Sana Ebrahimi, Rishi Advani, Abolfazl Asudeh
The training process of neural networks is known to be time-consuming, and having a deep architecture only aggravates the issue. This process consists mostly of matrix operations,…
Maximizing Neutrality in News Ordering
Rishi Advani, Paolo Papotti, Abolfazl Asudeh
The detection of fake news has received increasing attention over the past few years, but there are more subtle ways of deceiving one's audience. In addition to the content of news…
Efficient Algorithms for Constructing an Interpolative Decomposition
Rishi Advani, Sean O'Hagan
Low-rank approximations are essential in modern data science. The interpolative decomposition provides one such approximation. Its distinguishing feature is that it reuses columns…
Random Projections and Dimension Reduction
Rishi Advani, Madison Crim, Sean O'Hagan
This paper, broadly speaking, covers the use of randomness in two main areas: low-rank approximation and kernel methods. Low-rank approximation is very important in numerical linea…
On the Prevalence of Bridge Graphs Among Non-3-Connected Cubic Non-Hamiltonian Graphs
Rishi Advani
There is empirical evidence supporting the claim that almost all cubic non-Hamiltonian graphs are bridge graphs. In this paper, we pose a related conjecture and prove that the orig…