10 New Results on Reversible Boolean Functions Having Component. . .
235
References
1. de Vos, A.: Reversible Computing: Fundamentals, Quantum Computing, and Applications.
Wiley, Weinheim (2010)
2. Saeedi, M., Markov, I.L.: Synthesis and optimization of reversible circuits: a survey. ACM
Comput. Surv. 45(2), 21 (2013)
3. Soeken, M., Wille, R., Keszocze, O., Miller, D.M., Drechsler, R.: Embedding of large Boolean
functions for reversible logic. J. Emerg. Technol. Comput. Syst. 12(4), 41 (2015).; also
available as preprint arXiv.org:1408.3586, August 15, 2014
4. Carlet, C.: Vectorial Boolean functions for cryptography. In: Crama, Y., Hammer, P. (eds.)
Boolean Models and Methods in Mathematics, Computer Science, and Engineering, pp. 398–
472. Cambridge University Press, Cambridge (2010)
5. Tokareva, N.: Bent Functions. Results and Applications to Cryptography. Academic Press,
London (2015)
6. Kerntopf, P., Moraga, C., Podlaski, K., Stankovi´ c, R.S.: Towards classification of reversible
functions. In: Steinbach, B. (ed.) Proceedings of the 12th International Workshop on Boolean
Problems, pp. 21–28 (2016)
7. Kerntopf, P., Moraga, C., Podlaski, K., Stankovi´ c, R.S.: Towards classification of reversible
functions with homogeneous component functions. In: Steinbach, B. (ed.) Further Improvements in the Boolean Domain, pp. 386–406. Cambridge Scholars Publishing, Newcastle upon
Tyne (2018)
8. Kerntopf, P., Podlaski, K., Moraga, C., Stankovi´ c, R.S.: Study of reversible ternary functions
with homogeneous component functions. In: Proceedings of the 47th IEEE International
Conference on Multiple-Valued Logic, pp. 191–196 (2017)
9. Kerntopf, P., Stankovi´ c, R.S., Podlaski, K., Moraga, C.: Ternary/MV reversible functions with
component functions from different equivalence classes. In: Proceedings of the 48th IEEE
International Conference on Multiple-Valued Logic, pp. 109–114 (2018)
10. Tsai, C.-C., Marek-Sadowska, M.: Boolean functions classification via fixed polarity ReedMuller forms. IEEE Trans. Comput. 46(2), 173–186 (1997)
11. Debnath, D., Sasao, T.: Fast Boolean matching under variable permutation using representative.
In: Proceedings of the Asia and South Pacific Design Automation Conference, pp. 359–362
(1999)
12. Debnath, D., Sasao, T.: Efficient computation of canonical form for Boolean matching in large
libraries. In: Proceedings of the Asia and South Pacific Design Automation Conference, pp.
591–596 (2004)
13. Debnath, D., Sasao, T.: Fast Boolean matching under permutation by efficient computation of
canonical form. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E87-A, 3134–3140
(2004)
14. Debnath, D., Sasao, T.: Efficient computation of canonical form under variable permutation and
negation for Boolean matching in large libraries. IEICE Trans. Fundam. Electron. Commun.
Comput. Sci. E89-A(12), 3443–3450 (2006, Special Section on VLSI Design and CAD
Algorithms)
15. Stankovi´ c, R.S., Astola, J.T., Steinbach, B.: Former and recent work in classification of
switching functions. In: Steinbach, B. (ed.) Proceedings of the 8th International Workshop
on Boolean Problems, pp. 115–126 (2008)
16. Lorens, C.S.: Invertible Boolean Functions. Space-General Corp, El Monte (1962)
17. Lorens, C.S.: Invertible Boolean functions. IEEE Trans. Electron. Comput. EC-13(5), 529–541
(1964)
18. Harrison, M.A.: The number of classes of invertible Boolean functions. J. ACM. 10, 25–28
(1963)
19. Strazdins, I.E.: On the number of types of invertible binary networks. Avtomatika Vychislitelnaya Tekhnika. 1, 30–34 (1974)
20. Primenko, E.A.: Invertible Boolean functions and fundamental groups of transformations of
algebras of Boolean functions. Avtomatika Vychislitelnaya Tekhnika. 3, 17–21 (1976)
235
References
1. de Vos, A.: Reversible Computing: Fundamentals, Quantum Computing, and Applications.
Wiley, Weinheim (2010)
2. Saeedi, M., Markov, I.L.: Synthesis and optimization of reversible circuits: a survey. ACM
Comput. Surv. 45(2), 21 (2013)
3. Soeken, M., Wille, R., Keszocze, O., Miller, D.M., Drechsler, R.: Embedding of large Boolean
functions for reversible logic. J. Emerg. Technol. Comput. Syst. 12(4), 41 (2015).; also
available as preprint arXiv.org:1408.3586, August 15, 2014
4. Carlet, C.: Vectorial Boolean functions for cryptography. In: Crama, Y., Hammer, P. (eds.)
Boolean Models and Methods in Mathematics, Computer Science, and Engineering, pp. 398–
472. Cambridge University Press, Cambridge (2010)
5. Tokareva, N.: Bent Functions. Results and Applications to Cryptography. Academic Press,
London (2015)
6. Kerntopf, P., Moraga, C., Podlaski, K., Stankovi´ c, R.S.: Towards classification of reversible
functions. In: Steinbach, B. (ed.) Proceedings of the 12th International Workshop on Boolean
Problems, pp. 21–28 (2016)
7. Kerntopf, P., Moraga, C., Podlaski, K., Stankovi´ c, R.S.: Towards classification of reversible
functions with homogeneous component functions. In: Steinbach, B. (ed.) Further Improvements in the Boolean Domain, pp. 386–406. Cambridge Scholars Publishing, Newcastle upon
Tyne (2018)
8. Kerntopf, P., Podlaski, K., Moraga, C., Stankovi´ c, R.S.: Study of reversible ternary functions
with homogeneous component functions. In: Proceedings of the 47th IEEE International
Conference on Multiple-Valued Logic, pp. 191–196 (2017)
9. Kerntopf, P., Stankovi´ c, R.S., Podlaski, K., Moraga, C.: Ternary/MV reversible functions with
component functions from different equivalence classes. In: Proceedings of the 48th IEEE
International Conference on Multiple-Valued Logic, pp. 109–114 (2018)
10. Tsai, C.-C., Marek-Sadowska, M.: Boolean functions classification via fixed polarity ReedMuller forms. IEEE Trans. Comput. 46(2), 173–186 (1997)
11. Debnath, D., Sasao, T.: Fast Boolean matching under variable permutation using representative.
In: Proceedings of the Asia and South Pacific Design Automation Conference, pp. 359–362
(1999)
12. Debnath, D., Sasao, T.: Efficient computation of canonical form for Boolean matching in large
libraries. In: Proceedings of the Asia and South Pacific Design Automation Conference, pp.
591–596 (2004)
13. Debnath, D., Sasao, T.: Fast Boolean matching under permutation by efficient computation of
canonical form. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E87-A, 3134–3140
(2004)
14. Debnath, D., Sasao, T.: Efficient computation of canonical form under variable permutation and
negation for Boolean matching in large libraries. IEICE Trans. Fundam. Electron. Commun.
Comput. Sci. E89-A(12), 3443–3450 (2006, Special Section on VLSI Design and CAD
Algorithms)
15. Stankovi´ c, R.S., Astola, J.T., Steinbach, B.: Former and recent work in classification of
switching functions. In: Steinbach, B. (ed.) Proceedings of the 8th International Workshop
on Boolean Problems, pp. 115–126 (2008)
16. Lorens, C.S.: Invertible Boolean Functions. Space-General Corp, El Monte (1962)
17. Lorens, C.S.: Invertible Boolean functions. IEEE Trans. Electron. Comput. EC-13(5), 529–541
(1964)
18. Harrison, M.A.: The number of classes of invertible Boolean functions. J. ACM. 10, 25–28
(1963)
19. Strazdins, I.E.: On the number of types of invertible binary networks. Avtomatika Vychislitelnaya Tekhnika. 1, 30–34 (1974)
20. Primenko, E.A.: Invertible Boolean functions and fundamental groups of transformations of
algebras of Boolean functions. Avtomatika Vychislitelnaya Tekhnika. 3, 17–21 (1976)