This work generalizes the classical binary search problem to a d-dimensional domain, where the target element must be found using a minimum number of queries.
