Improved bounds for the randomized decision tree complexity of recursive majority (bibtex)

by F. Magniez, A. Nayak, M. Santha, J. Sherman, G. Tardos and D. Xiao

Reference:

Improved bounds for the randomized decision tree complexity of recursive majority (F. Magniez, A. Nayak, M. Santha, J. Sherman, G. Tardos and D. Xiao), In Random Structures & Algorithms, volume 48, 2016.

Bibtex Entry:

@article{mnsstx16,
	author = {F. Magniez and A. Nayak and M. Santha and J. Sherman and G. Tardos and D. Xiao},
	doi = {10.1002/rsa.20598},
	journal = {Random Structures \& Algorithms},
	number = {3},
	pages = {612-638},
	pdf = {./PAPIERS/mnsstx-rsa16.pdf},
	title = {Improved bounds for the randomized decision tree complexity of recursive majority},
	volume = {48},
	year = {2016},
	bdsk-url-1 = {https://doi.org/10.1002/rsa.20598},
	bdsk-url-2 = {./PAPIERS/mnsstx-rsa16.pdf}}