Before revision:  In this work, we develop sublinear time algorithms that find the planted clique when k=\omega(n \log \log n).
After revision:  In this work, we initiate the development of sublinear time algorithms that find the planted clique when k=\omega(n \log \log n).