Hashing with linear probing

More documents

Recommendations

Info

Today • Background and motivation • Hash functions ‣ New analysis of linear probing Joint work with Anna Pagh and Milan Ružić • Hash functions - details 8
Total cost of insertions ((analysis on blackboard)) 9
Page 1 and 2: Hashing with linear probing Rasmus
Page 3 and 4: Hashing with linear probing 2
Page 5 and 6: Hashing with linear probing 2
Page 7: Hashing with linear probing It was
Page 10 and 11: Race car vs golf car • Linear pro
Page 12 and 13: History of linear probing • First
Page 14 and 15: History of linear probing • First
Page 16 and 17: log(n)-wise independence • Siegel
Page 20 and 21: Hash function details h(x1, x2) = T
Page 22 and 23: Single insertion upper bound 11
Page 24 and 25: Single insertion upper bound { { 1.
Page 26 and 27: Single insertion upper bound { { 1.
Page 28 and 29: Proof idea • Lemma: If operation
Page 30 and 31: Our main result Theorem 2 Consider
Page 32 and 33: End remarks • Theory and practice
Page 34 and 35: Advertisement • Call for applicat
Page 36: Practical exercise • Implement a

Hashing with linear probing

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?