Benjamin Rossman. On the constant-depth complexity of k-clique. In Richard E. Ladner, Cynthia Dwork, editors, Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008. pages 721-730, ACM, 2008. [doi]
Abstract is missing.