research
∙
03/16/2023
Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set
Set cover and hitting set are fundamental problems in combinatorial opti...
share
research
∙
11/06/2022
4D Range Reporting in the Pointer Machine Model in Almost-Optimal Time
In the orthogonal range reporting problem we must pre-process a set P of...
research
∙
05/04/2021
Optimal Algorithms for Range Searching over Multi-Armed Bandits
This paper studies a multi-armed bandit (MAB) version of the range-searc...
research
∙
05/03/2019
Range closest-pair search in higher dimensions
Range closest-pair (RCP) search is a range-search variant of the classic...
research
∙
03/08/2019
Active Learning a Convex Body in Low Dimensions
Consider a set P ⊆R^d of n points, and a convex body C provided via a se...
research
∙
07/25/2018
Searching for the closest-pair in a query translate
In this paper, we consider a range-search variant of the closest-pair pr...
research
∙
05/19/2018
Orthogonal Point Location and Rectangle Stabbing Queries in 3-d
In this work, we present a collection of new results on two fundamental ...
research
∙
12/28/2017
