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

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.

(newest | oldest) View ( | older 50) (20 | 50 | 100 | 250 | 500)

31 March 2010

30 March 2010

26 March 2010

15 March 2010

  • 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…'
(newest | oldest) View ( | older 50) (20 | 50 | 100 | 250 | 500)
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=Randomized_Algorithms_(Spring_2010)/Hashing,_limited_independence"