%0 Journal Article %1 journals/rsa/MagniezNSSTX16 %A Magniez, Frédéric %A Nayak, Ashwin %A Santha, Miklos %A Sherman, Jonah %A Tardos, Gábor %A Xiao, David %D 2016 %J Random Struct. Algorithms %K %N 3 %P 612-638 %T Improved bounds for the randomized decision tree Complexity of recursive majority. %U http://dblp.uni-trier.de/db/journals/rsa/rsa48.html#MagniezNSSTX16 %V 48

@article{journals/rsa/MagniezNSSTX16, added-at = {2023-12-12T18:31:44.000+0100}, author = {Magniez, Frédéric and Nayak, Ashwin and Santha, Miklos and Sherman, Jonah and Tardos, Gábor and Xiao, David}, biburl = {https://www.bibsonomy.org/bibtex/2d71bf4ea8fc1574a93138b1182da65ab/admin}, ee = {http://dx.doi.org/10.1002/rsa.20598}, interhash = {1395195508a6f8cdb1330a6a3ec9bc58}, intrahash = {d71bf4ea8fc1574a93138b1182da65ab}, journal = {Random Struct. Algorithms}, keywords = {}, number = 3, pages = {612-638}, timestamp = {2023-12-12T18:31:44.000+0100}, title = {Improved bounds for the randomized decision tree Complexity of recursive majority.}, url = {http://dblp.uni-trier.de/db/journals/rsa/rsa48.html#MagniezNSSTX16}, volume = 48, year = 2016 }