Frédéric Magniez, Ashwin Nayak, Miklos Santha, David Xiao. Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority. In Luca Aceto, Monika Henzinger, Jiri Sgall, editors, Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part I. Volume 6755 of Lecture Notes in Computer Science, pages 317-329, Springer, 2011. [doi]
Abstract is missing.