Proving lower bounds for linear decision trees

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Original languageEnglish (US)
Title of host publicationAutomata, Languages and Programming - 8th Colloquium
EditorsShimon Even, Oded Kariv
PublisherSpringer-Verlag
Pages305-315
Number of pages11
ISBN (Print)9783540108436
DOIs
StatePublished - Jan 1 1981
Externally publishedYes
Event8th International Colloquium on Automata, Languages and Programming, ICALP 1981 - Acre, Israel
Duration: Jul 13 1981Jul 17 1981

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume115 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other8th International Colloquium on Automata, Languages and Programming, ICALP 1981
CountryIsrael
CityAcre
Period7/13/817/17/81

Fingerprint

Decision trees
Decision tree
Lower bound

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Snir, M. (1981). Proving lower bounds for linear decision trees. In S. Even, & O. Kariv (Eds.), Automata, Languages and Programming - 8th Colloquium (pp. 305-315). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 115 LNCS). Springer-Verlag. https://doi.org/10.1007/3-540-10843-2_25

Proving lower bounds for linear decision trees. / Snir, Marc.

Automata, Languages and Programming - 8th Colloquium. ed. / Shimon Even; Oded Kariv. Springer-Verlag, 1981. p. 305-315 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 115 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Snir, M 1981, Proving lower bounds for linear decision trees. in S Even & O Kariv (eds), Automata, Languages and Programming - 8th Colloquium. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 115 LNCS, Springer-Verlag, pp. 305-315, 8th International Colloquium on Automata, Languages and Programming, ICALP 1981, Acre, Israel, 7/13/81. https://doi.org/10.1007/3-540-10843-2_25
Snir M. Proving lower bounds for linear decision trees. In Even S, Kariv O, editors, Automata, Languages and Programming - 8th Colloquium. Springer-Verlag. 1981. p. 305-315. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-10843-2_25
Snir, Marc. / Proving lower bounds for linear decision trees. Automata, Languages and Programming - 8th Colloquium. editor / Shimon Even ; Oded Kariv. Springer-Verlag, 1981. pp. 305-315 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{5e395d0dddfa449790828b558947a8de,
title = "Proving lower bounds for linear decision trees",
author = "Marc Snir",
year = "1981",
month = "1",
day = "1",
doi = "10.1007/3-540-10843-2_25",
language = "English (US)",
isbn = "9783540108436",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer-Verlag",
pages = "305--315",
editor = "Shimon Even and Oded Kariv",
booktitle = "Automata, Languages and Programming - 8th Colloquium",

}

TY - GEN

T1 - Proving lower bounds for linear decision trees

AU - Snir, Marc

PY - 1981/1/1

Y1 - 1981/1/1

UR - http://www.scopus.com/inward/record.url?scp=85030870212&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85030870212&partnerID=8YFLogxK

U2 - 10.1007/3-540-10843-2_25

DO - 10.1007/3-540-10843-2_25

M3 - Conference contribution

AN - SCOPUS:85030870212

SN - 9783540108436

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 305

EP - 315

BT - Automata, Languages and Programming - 8th Colloquium

A2 - Even, Shimon

A2 - Kariv, Oded

PB - Springer-Verlag

ER -