Efficient algorithms for computing the longest viable path in a combinational network

Proceedings - Design Automation Conference

Volumn , Issue , 1989, Pages 561-567

  McGeer, Patrick C ^a   Brayton, Robert K ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER METATHEORY--BOOLEAN FUNCTIONS; COMPUTER PROGRAMMING--ALGORITHMS; COMPUTERS, DIGITAL--ADDERS;

CARRY-BYPASS ADDERS; COMBINATIONAL NETWORK; FALSE PATHS; GENERIC ALGORITHM; LONGEST VIABLE PATH; VIABILITY CONDITION;

LOGIC CIRCUITS, COMBINATORIAL;

EID: 0024890438     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/74382.74476     Document Type: Conference Paper

References (11)