Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Frédéric Magniez, Ashwin Nayak, Miklos Santha, David Xiao
Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority
ICALP, 2011.

ICALP v1 2011
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{ICALP-v1-2011-MagniezNSX,
	author        = "Frédéric Magniez and Ashwin Nayak and Miklos Santha and David Xiao",
	booktitle     = "{Proceedings of the 38th International Colloquium on Automata, Languages and Programming, Part I}",
	doi           = "10.1007/978-3-642-22006-7_27",
	isbn          = "978-3-642-22005-0",
	pages         = "317--329",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority}",
	volume        = 6755,
	year          = 2011,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.