Nikos Leonardos. An Improved Lower Bound for the Randomized Decision Tree Complexity of Recursive Majority, . In Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, David Peleg, editors, Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I. Volume 7965 of Lecture Notes in Computer Science, pages 696-708, Springer, 2013. [doi]
Abstract is missing.