A symbolic algorithm for maximum flow in 0-1 networks

Authors:
Gary D. Hachtel;Fabio Somenzi
Affiliations:
Department of Electrical and Computer Engineering, University of Colorado at Boulder, 80309;Department of Electrical and Computer Engineering, University of Colorado at Boulder, 80309
Venue:
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Year:
1993

Introduction to algorithms

Introduction to algorithms
Efficient implementation of a BDD package

DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Algebraic decision diagrams and their applications

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Graph Algorithms

Graph Algorithms

Re-encoding sequential circuits to reduce power dissipation

ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
Incremental re-encoding for symbolic traversal of product machines

EURO-DAC '96/EURO-VHDL '96 Proceedings of the conference on European design automation
Algebraic decision diagrams and their applications

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
A symbolic algorithm for low-power sequential synthesis

ISLPED '97 Proceedings of the 1997 international symposium on Low power electronics and design
Efficient state classification of finite state Markov chains

DAC '98 Proceedings of the 35th annual Design Automation Conference
Verification of Similar FSMs by Mixing Incremental Re-encoding, Reachability Analysis, and Combinational Checks

Formal Methods in System Design

Hi-index	0.00