ISAAC
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. In this paper we present an implicit dictionary with the working set property i.e. a dictionary supporting insert(e), delete(x) and predecessor(x) in O(log n) time and se...
ARSCOM
2005
14 years 10 days ago
2005
A subset U of a set S with a binary operation is called avoidable if S can be partitioned into two subsets A and B such that no element of U can be written as a product of two dis...
EJC
2006
14 years 13 days ago
2006
For a fixed polyomial f Z[X], let k(N) denote the maximum size of a set A {1, 2, . . . , N} such that no product of k distinct elements of A is in the value set of f. In this pap...
PODS
2010
ACM
14 years 5 months ago
2010
ACM
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
EDBT
2008
ACM
15 years 17 days ago
2008
ACM
Estimating the number of distinct elements in a large multiset has several applications, and hence has attracted active research in the past two decades. Several sampling and sket...