Combinatorial Merging

IEEE Transactions on Computers

Volumn C-25, Issue 11, 1976, Pages 1164-1167

  Golumbic, Martin C ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

Fan in; integer weighted nodes; number of internal nodes; parallel processing; r ary tree; switching circuit theory; weight of the root of the tree

Indexed keywords

SWITCHING THEORY;

EID: 0017017371     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.1976.1674574     Document Type: Article

References (4)

1. M. C. Golumbic, “An optimal merging procedure with applications,” Columbia Univ., New York, NY, Res. Rep., 1974.
2. G. L. Hicks and A. J. Bernstein, “On the minimum stage realization of switching functions using logical gates with limited fan-in,” in 1964 Proc. 5th Symp. Switching Circuit Theory Logical Design, vol. S-164, PP. 149–155.
3. D. A. Huffman, “A method for the construction of minimum-redundancy codes,” Proc. IRE, vol. 40, pp. 1098–1101, 1952.
4. P. E. Wood, Switching Theory. New York: McGraw-Hill, pp. 103–104, 1968.