From post

A new algorithm for the binate covering problem and its application to the minimization of Boolean relations.

, и . ICCAD, стр. 417-420. IEEE Computer Society / ACM, (1992)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

The Charme of Abstract Entities.. CHARME, том 2860 из Lecture Notes in Computer Science, стр. 2. Springer, (2003)VIS: A System for Verification and Synthesis., , , , , , , , , и 6 other автор(ы). CAV, том 1102 из Lecture Notes in Computer Science, стр. 428-432. Springer, (1996)A Performance Study of BDD-Based Model Checking., , , , , , , и . FMCAD, том 1522 из Lecture Notes in Computer Science, стр. 255-289. Springer, (1998)Analysis of Symbolic SCC Hull Algorithms., , и . FMCAD, том 2517 из Lecture Notes in Computer Science, стр. 88-105. Springer, (2002)CirCUs: A Hybrid Satisfiability Solver., и . SAT, (2004)An ADD-based algorithm for shortest path back-tracing of large graphs., , , , и . Great Lakes Symposium on VLSI, стр. 248-251. IEEE, (1994)The Performance of the Concurrent Fault Simulation Algorithms in MOZART., , и . DAC, стр. 692-697. ACM, (1988)Algorithms for Approximate FSM Traversal., , , , и . DAC, стр. 25-30. ACM Press, (1993)Minimum Length Synchronizing Sequences of Finite State Machine., , и . DAC, стр. 463-468. ACM Press, (1993)Alembic: An Efficient Algorithm for CNF Preprocessing., и . DAC, стр. 582-587. IEEE, (2007)