### 5 papers:

- DAC-2005-LiSB #bound #effectiveness #problem
- Effective bounding techniques for solving unate and binate covering problems (XYL, MFMS, FB), pp. 385–390.
- DATE-2000-CordoneFSC #approach #heuristic #performance #problem
- An Efficient Heuristic Approach to Solve the Unate Covering Problem (RC, FF, DS, RWC), pp. 364–371.
- DATE-2000-KallaZCH #framework #paradigm #recursion #satisfiability #using
- A BDD-Based Satisfiability Infrastructure Using the Unate Recursive Paradigm (PK, ZZ, MJC, CH), pp. 232–236.
- DAC-1994-Minato #algebra #set #using
- Calculation of Unate Cube Set Algebra Using Zero-Suppressed BDDs (SiM), pp. 420–424.
- DAC-1990-McGeerB #analysis #network
- Timing Analysis in Precharge/Unate Networks (PCM, RKB), pp. 124–129.