Abstract. We establish a nonlinear lower bound for halfplane range searching over a group. Specifically, we show that summing up the weights of n (weighted) ...

We establish a nonlinear lower bound for halfplane range searching over a group. Specifically, we show that summing up the weights of n (weighted) points ...

We establish a nonlinear lower bound for halfplane range searching over a group. Specifically, we show that summing up the weights of n (weighted) points ...

Apr 1, 1998 · We establish a nonlinear lower bound for halfplane range searching over a group. Specifically, we show that summing up the weights of n ...

This work develops a general, entropy-based, method for relating the linear circuit complexity of a linear map A to the spectrum of A/sup T/A and shows that ...

A Spectral Approach to Lower Bounds with Applications to Geometric Searching. We establish a nonlinear lower bound for halfplane range searching over a group.

A Spectral Approach to Lower Bounds With Applications to Geometric Searching by Bernard Chazelle published in SIAM Journal on Computing.

Article "A spectral approach to lower bounds with applications to geometric searching." Detailed information of the J-GLOBAL is an information service ...

This paper proves three lower bounds for variants of the following rangesearching problem: Given n weighted points inR d andn axis-parallel boxes, ...

We develop lower bounds on the number of primitive operations required to solve several fundamental problems in computational geometry.