Robin Hood hashing is a variation on open addressing hashing designed to reduce the maximum search time as well as the variance in the search time for elements in the hash table. While the case of insertions only using Robin Hood hashing is well understood, the behavior with deletions has remained open. Here we show that Robin Hood hashing can be analyzed under the framework of finite-level fin...

This paper presents a new algorithm for distributing bits to the subchannels of a DMT modem. The so-called Inverse Robin Hood algorithm converges rapidly and can effectively optimise the overall bit error rate in a non-Gaussian channel. Key-words: Discrete multi-tone modulation, adaptive bit-loading, DSL modems, non-Gaussian channels.

Street gangs pose serious threats to their members, to their victims, and to communities at large. The behavior problems associated with gangs are many and varied. Suggested causes for the emergence of gangs are complicated, and many of them are interdependent. Interventions planned to rehabilitate individuals and to weaken the power of the gang are numerous. Research shows that few of these in...

Gasarch, Golub, and Srinivasan studied the Robin Hood game in the case of random, memoryless strategies. In this brief note we extend their main result to the case of bounded memory, and clarify several questions raised by them. 1. The Robin Hood game The Robin Hood game RH(r, s, A) is defined for functions r, s : N → N such that 1 ≤ r(i) < s(i) for each i, and for a set A, as follows: (1) On d...

The Robin Hood game is played as follows: On day i, the Sheriff puts s(i) bags of gold in the cave. On night i, Robin removes r(i) bags from the cave. The game is played for each i ∈ N. Robin wins if each bag which was put in the cave is eventually removed from it; otherwise the Sheriff wins. Gasarch, Golub, and Srinivasan studied the Robin Hood game in the case of random strategies where Robin...