Woodruff and Zemel present four effective functions that can be used f
or hashing within tabu search algorithms. However, the authors overloo
k one property that may affect the performance of algorithms that use
the proposed functions. This paper clarifies the effects that the ''bi
rthday paradox'' may have on algorithms using these functions.