Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

STOC
2007
ACM

favoriteEmaildiscussreport

100views Algorithms» more STOC 2007»

Linear probing with constant independence

14 years 4 months ago

Linear probing with constant independence

Download www.it-c.dk

Anna Pagh, Rasmus Pagh, Milan Ruzic

Real-time Traffic

Algorithms | Constant Independence | STOC 2007 |

claim paper

Related Content

» On the kIndependence Required by Linear Probing and Minwise Independence

» TabulationBased 5Independent Hashing with Applications to Linear Probing and Second Moment...

» Characterisations and LinearTime Recognition of Probe Cographs

» Extractors for a constant number of polynomially small minentropy independent sources

» An asymptotically constant linearly bounded methodology for the statistical simulation of ...

» On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lat...

» Scalable and dynamic quorum systems

» Cell Probe Lower Bounds and Approximations for Range Mode

» Optimization of area in digitserial Multiple Constant Multiplications at gatelevel

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2007
Where	STOC
Authors	Anna Pagh, Rasmus Pagh, Milan Ruzic

Comments (0)