Vipul Goyal, Abhishek Jain 0002. On the round complexity of covert computation. In Leonard J. Schulman, editor, Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010. pages 191-200, ACM, 2010. [doi]
Abstract is missing.