Paul Beame, Widad Machmouchi. Making Branching Programs Oblivious Requires Superlogarithmic Overhead. In Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, June 8-10, 2011. pages 12-22, IEEE Computer Society, 2011. [doi]
Abstract is missing.