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

by F. Magniez, A. Nayak, M. Santha and D. Xiao

Reference:

Improved bounds for the randomized decision tree complexity of recursive majority (F. Magniez, A. Nayak, M. Santha and D. Xiao), In Proceedings of 38th International Colloquium on Automata, Languages and Programming, 2011.

Bibtex Entry:

@inproceedings{mnsx11,
	author = {F. Magniez and A. Nayak and M. Santha and D. Xiao},
	booktitle = {Proceedings of 38th International Colloquium on Automata, Languages and Programming},
	pages = {317-329},
	pdf = {./PAPIERS/mnsx-icalp11.pdf},
	title = {Improved bounds for the randomized decision tree complexity of recursive majority},
	year = {2011},
	bdsk-url-1 = {./PAPIERS/mnsx-icalp11.pdf}}