Marc Snir. Proving Lower Bounds for Linar Decision Trees. In Shimon Even, Oded Kariv, editors, Automata, Languages and Programming, 8th Colloquium, Acre (Akko), Israel, July 13-17, 1981, Proceedings. Volume 115 of Lecture Notes in Computer Science, pages 305-315, Springer, 1981.
@inproceedings{Snir81,
title = {Proving Lower Bounds for Linar Decision Trees},
author = {Marc Snir},
year = {1981},
researchr = {https://researchr.org/publication/Snir81},
cites = {0},
citedby = {0},
pages = {305-315},
booktitle = {Automata, Languages and Programming, 8th Colloquium, Acre (Akko), Israel, July 13-17, 1981, Proceedings},
editor = {Shimon Even and Oded Kariv},
volume = {115},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-10843-2},
}