Randomized Algorithms (Spring 2010)/Hashing, limited independence: Revision history

View logs for this page

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

curprev 08:4108:41, 7 June 2010‎ imported>WikiSysop‎ 43,332 bytes −241‎ No edit summary

curprev 06:3706:37, 2 April 2010‎ imported>WikiSysop‎ 42,852 bytes +11‎ →‎Birthday problem
curprev 03:3903:39, 2 April 2010‎ imported>WikiSysop‎ 42,841 bytes +77‎ →‎Construction of 2-universal family of hash functions
curprev 03:3703:37, 2 April 2010‎ imported>WikiSysop‎ 42,764 bytes +2,164‎ →‎Construction of 2-universal family of hash functions

curprev 09:5609:56, 15 March 2010‎ imported>WikiSysop‎ 6,051 bytes +6,051‎ Created page with '=== Perfect hashing === In a '''hash table''', <math>m</math> ''keys'' are stored in <math>n</math> ''slots'', and the keys are mapped to slots by a '''hash function'''. A ''col…'

Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=Randomized_Algorithms_(Spring_2010)/Hashing,_limited_independence"