Sciweavers

ISAAC
2010
Springer
313views Algorithms» more  ISAAC 2010»
13 years 8 months ago
A Cache-Oblivious Implicit Dictionary with the Working Set Property
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...
Gerth Stølting Brodal, Casper Kejlberg-Rasm...
ARSCOM
2005
67views more  ARSCOM 2005»
13 years 10 months ago
Avoidable Sets in The Bicyclic Inverse Semigroup
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...
Nándor Sieben
EJC
2006
13 years 11 months ago
Product representations of polynomials
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...
Jacques Verstraëte
PODS
2010
ACM
215views Database» more  PODS 2010»
14 years 4 months ago
An optimal algorithm for the distinct elements problem
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...
Daniel M. Kane, Jelani Nelson, David P. Woodruff
EDBT
2008
ACM
160views Database» more  EDBT 2008»
14 years 11 months ago
Why go logarithmic if we can go linear?: Towards effective distinct counting of search traffic
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...
Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi