A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A lower bound for the integer element distinctness problem
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