5 citations · 11 across the 46 of their papers we have counts for
61 papers
Geometric Hashing in MPC with Applications to Clustering and Stochastic Embeddings
Sujoy Bhore, Arnold Filter, Eunjin Oh +2
In this paper we study consistent hashing (a.k.a. sparse partitions) for doubling metrics in the Massively Parallel Computation (MPC) model. A -hash with diameter bound …
Approximation Algorithms for Geometric Maximum Coverage
Sujoy Bhore, Timothy M. Chan, Pasin Manurangsi
We study the maximum coverage problem for geometric set systems: given a set of points, a set of geometric objects, and a number , select objects maximizing the number of po…
Explaining Rankings with Hidden Group Bonuses
Alvin Hong Yao Yan, Suraj Shetiya, Sujoy Bhore +2
Determining a linear utility function that correlates with observed candidate rankings is a foundational problem with applications in domains such as admissions, hiring, and recomm…
Visibility Queries in Simple Polygons
Sujoy Bhore, Chih-Hung Liu, Anurag Murty Naredla +6
Given a simple polygon with vertices, we consider the problem of constructing a data structure for visibility queries: for any query point , compute the visibility…
Optimal Regret for Single Index Bandits
Devdan Dey, Sujoy Bhore, Avishek Ghosh
We study the problem, where rewards depend on an unknown one-dimensional projection of high-dimensional contexts through an unknown reward function.…
Online TCP Acknowledgment under General Delays
Sujoy Bhore, Michał Pawłowski, Seeun William Umboh
In a seminal work, Dooly, Goldman, and Scott (STOC 1998; JACM 2001) introduced the classic Online TCP Acknowledgment} problem: a sequence of packets arrives over time, and the…