126 search results - page 5 / 26 » Lower Bounds for Set Intersection Queries |
COCO
2010
Springer
15 years 1 months ago
2010
Springer
—We prove new lower bounds in the area of property testing of boolean functions. Specifically, we study the problem of testing whether a boolean function f is isomorphic to a ...
100
Voted
STOC
2007
ACM
15 years 10 months ago
2007
ACM
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
COMPGEOM
1995
ACM
15 years 1 months ago
1995
ACM
Abstract. We show that there is a matching between the edges of any two triangulations of a planar point set such that an edge of one triangulation is matched either to the identic...
ENDM
2008
14 years 9 months ago
2008
A generalized configuration is a set of n points and n 2 pseudolines such that each pseudoline passes through exactly two points, two pseudolines intersect exactly once, and no th...
CCCG
2010
14 years 11 months ago
2010
We present a data structure for efficient axis-aligned orthogonal range search on a set of n lines in a bounded plane. The algorithm requires O(log n + k) time in the worst case t...