On Worst Case Robin-Hood Hashing
We consider open addressing hashing, and implement it by using the Robin Hood strategy, that is, in case of collision, the element that has traveled the furthest can stay in the slot. We hash elements into a table of size n where each probe is independent and uniformly distributed over the table, an...
Wedi'i Gadw mewn:
| Prif Awdur: | |
|---|---|
| Awduron Eraill: | , |
| Fformat: | report |
| Cyhoeddwyd: |
2002
|
| Pynciau: | |
| Mynediad Ar-lein: | http://hdl.handle.net/20.500.12008/3481 |
| Tagiau: |
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
|
Eitemau Tebyg: On Worst Case Robin-Hood Hashing
- Micronatia. Fisura de paladar, malformación de orejas. Asfixia, síndrome de Pierre Robin
- The free plan versus the nostalgia of history:: The Chicago Tribune of Walter Gropius and Adolf Meyer versus the Chicago Tribune of Hood y Howells.
- Optimal assignment mechanisms with imperfect verification
- Retrieving the structure of probabilistic sequences of auditory stimuli from EEG data
- Smoke detection for static cameras
- Real-Time Lane Region Detection Using a Combination of Geometrical and Image Features