AN INFORMATION THEORETIC APPROACH TO THE CONSTRUCTION OF EFFICIENT DECISION TREES

[1]  Michael Montalbano.  Tables, Flow Charts and Program Logic , 1962, IBM Syst. J..

[2]  J. F. Egler,et al.  A procedure for converting logic table conditions into an efficient sequence of test instructions , 1963, CACM.

[3]  H. W. Kirk.  Use of decision tables in computer programming , 1965, CACM.

[4]  Solomon L. Pollack,et al.  Conversion of limited-entry decision tables to computer programs , 1965, CACM.

[5]  Laurence I. Press,et al.  Conversion of decision tables to computer programs , 1965, CACM.

[6]  Peter J. H. King.  Conversion of decision tables to computer programs by rule mask techniques , 1966, CACM.

[7]  Lewis T. Reinwald,et al.  Conversion of Limited-Entry Decision Tables to Optimal Computer Programs I: Minimum Average Processing Time , 1966, JACM.

[8]  D. A. Bell,et al.  Information Theory and Reliable Communication , 1969 .

[9]  C. R. Muthukrishnan,et al.  On the conversion of decision tables to computer programs , 1970, CACM.

[10]  Keith Shwayder,et al.  Conversion of limited-entry decision tables to computer programs—a proposed modification to Pollack's algorithm , 1971, CACM.

[11]  M. Verhelst,et al.  The conversion of limited-entry decision tables to optimal and near-optimal flowcharts: two new algorithms , 1972, CACM.

[12]  S. Ganapathy,et al.  Information theory applied to the conversion of decision tables to computer programs , 1973, CACM.

[13]  Keith Shwayder.  Extending the infomation theory approach to converting limited-entry decision tables to computer programs , 1974, CACM.

[14]  Douglas Comer,et al.  Complexity of trie index construction , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[15]  Ronald L. Rivest,et al.  Constructing Optimal Binary Decision Trees is NP-Complete , 1976, Inf. Process. Lett..

[16]  Deepak Kumar Goel.  Random test generation for fault detection and diagnosis. , 1978 .