126 search results - page 4 / 26 » Lower Bounds for Set Intersection Queries |
189
Voted
COMPGEOM
2011
ACM
14 years 5 months ago
2011
ACM
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...
107
click to vote
STOC
2002
ACM
16 years 2 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
128
click to vote
SIGMOD
2003
ACM
16 years 2 months ago
2003
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
111
click to vote
STOC
2009
ACM
16 years 2 months ago
2009
ACM
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
116
click to vote
ISAAC
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...