1. Borowik, G., Łuba, T., Tomaszewicz, P.: A notion of r-admissibility and its application in logic synthesis. In: Proc. of the 4th IFAC Workshop on Discrete-Event System Design, DESDES 2009, Gandia Beach, Spain, pp. 207–212 (October 2009)
2. Brzozowski, J.A., Łuba, T.: Decomposition of Boolean functions specified by cubes. Journal of Multi-Valued Logic & Soft. Computing 9, 377–417 (2003)
3. Meyer-Baese, U.: Digital Signal Processing with Field Programmable Gate Arrays, Signals and Communication Technology. Springer-Verlag New York, Inc., Secaucus (2004)
4. Rawski, M., Jóźwiak, L., Nowicka, M., Łuba, T.: Non-disjoint decomposition of boolean functions and its application in fpga-oriented technology mapping. In: EUROMICRO 1997: ‘New Frontiers of Information Technology’, Proceedings of the 23rd EUROMICRO Conference, pp. 24–30 (September 1997)
5. Sasao, T.: On the number of LUTs to realize sparse logic functions. In: Proc. of the 18th International Workshop on Logic and Synthesis, Berkeley, CA, U.S.A., July 31-August 2, pp. 64–71 (2009)