An Improved Lower Bound 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

Nikos Leonardos
An Improved Lower Bound for the Randomized Decision Tree Complexity of Recursive Majority,
ICALP, 2013.

ICALP v1 2013
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{ICALP-v1-2013-Leonardos,
	author        = "Nikos Leonardos",
	booktitle     = "{Proceedings of the 40th International Colloquium on Automata, Languages, and Programming, Part I}",
	doi           = "10.1007/978-3-642-39206-1_59",
	isbn          = "978-3-642-39205-4",
	pages         = "696--708",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{An Improved Lower Bound for the Randomized Decision Tree Complexity of Recursive Majority, }",
	volume        = 7965,
	year          = 2013,
}

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.