|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
Note on Hazard Elimination
October 1973 (vol. 22 no. 10)
pp. 955-956
| ASCII Text | x | ||
| A. Kandel, "Note on Hazard Elimination," IEEE Transactions on Computers, vol. 22, no. 10, pp. 955-956, October, 1973. | |||
| BibTex | x | ||
| @article{ 10.1109/T-C.1973.223623, author = {A. Kandel}, title = {Note on Hazard Elimination}, journal ={IEEE Transactions on Computers}, volume = {22}, number = {10}, issn = {0018-9340}, year = {1973}, pages = {955-956}, doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1973.223623}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Note on Hazard Elimination IS - 10 SN - 0018-9340 SP955 EP956 EPD - 955-956 A1 - A. Kandel, PY - 1973 KW - Digraphs KW - graph theory KW - minimization KW - (n KW - k KW - i) tree KW - static hazard. VL - 22 JA - IEEE Transactions on Computers ER - | |||
This correspondence is concerned with the study of static hazards in combinational systems by means of ( n, k, i) trees and digraphs [1],[2].
Index Terms:
Digraphs, graph theory, minimization, (n, k, i) tree, static hazard.
Citation:
A. Kandel, "Note on Hazard Elimination," IEEE Transactions on Computers, vol. 22, no. 10, pp. 955-956, Oct. 1973, doi:10.1109/T-C.1973.223623
Usage of this product signifies your acceptance of the Terms of Use.