 Ambainis and Kutin independently (and via different proofs) extended his work to obtain the lower bound for all functions.Elements that occur more than "n"/"k" times in a multiset of size n may be found in time O("n" log "k").The element distinctness problem is a special case of "k"="n".