1. Logic Minimization Algorithms for VLSI Synthesis
2. CIESIELSKI , M. J. , YANG , S. , and PERKOWSKI , M. A. , 1989 , Multiple-valued minimization based on graph coloring .Proceedings of the I.E.E.E. International Conference on Computer Design VLSI in Computers and Processors, pp. 262 – 265 .
3. One more way to calculate the Hadamard-Walsh spectrum for completely and incompletely specified boolean functions
4. FALKOWSKI , B. J. , SCHÄFER , I. , and PERKOWSKI , M. A. , 1990 , A fast computer algorithm for the generation of disjoint cubes for completely and incompletely specified Boolean functions .Proceedings of the 33rd I.E.E.E. Midwest Symposium on Circuits and Systems, pp. 1119 – 1122 .
5. HELLIWELL , M. , and PERKOWSKI , M. A. , 1988 , A fast algorithm to minimize multi-output mixed-polarity generalized Reed–Müller forms .Proceedings of the 25th ACM/I.E.E.E. Design Automation Conference, pp. 427 – 432 .