A lower bound for the integer element distinctness problem

Anna Lubiw, András Rácz
1991 Information and Computation  
A lower bound of Q(n log n) is proved for the integer element distinctness problem-Given
doi:10.1016/0890-5401(91)90034-y fatcat:kikxwteekjfvhmlrav7zcj6y7y