@inproceedings{MagniezNSX11,
    author    = "Fr{\'e}d{\'e}ric Magniez and Ashwin Nayak and Miklos
                 Santha and David Xiao",
    title     = "Improved Bounds for the Randomized Decision Tree
                 Complexity of {Recursive Majority}",
    booktitle = "Proceedings of the 38th International Colloquium on
                 Automata, Languages and Programming",
    editor    = "Aceto, Luca and Henzinger, Monika and Sgall,
                  Jir{\'i}",
    series    = "Lecture Notes in Computer Science",
    volume    = "6755",
    year      = "2011",
    month     = jul # "~4--8",
    pages     = "317--329",
    location  = "Z{\"u}rich, Switzerland",
    publisher = "Springer, Berlin / Heidelberg, Germany",
    address   = "",
    isbn      = "",
    url       = "http://dx.doi.org/10.1007/978-3-642-22006-7_27",
    note      = "",
}