|
|
|
Publications in Math-Net.Ru |
Citations |
|
2025 |
| 1. |
Yu. V. Pottosin, “Decomposition of a parallel automaton into a net of sequential automata”, Prikl. Diskr. Mat., 2025, no. 70, 27–44  |
|
2023 |
| 2. |
Yu. V. Pottosin, “Synthesis of combinational circuits by means of bi-decomposition of Boolean functions”, Prikl. Diskr. Mat., 2023, no. 60, 95–105 |
|
2022 |
| 3. |
Yu. V. Pottosin, “Low power assignment of partial states of a parallel automaton”, Prikl. Diskr. Mat., 2022, no. 56, 113–122  |
3
|
|
2020 |
| 4. |
Yu. V. Pottosin, “A method for bi-decomposition of partial Boolean functions”, Prikl. Diskr. Mat., 2020, no. 47, 108–116  |
4
|
|
2015 |
| 5. |
Yu. V. Pottosin, “Low power race-free state assignment of an asynchronous automaton”, Prikl. Diskr. Mat. Suppl., 2015, no. 8, 120–123 |
|
2014 |
| 6. |
Yu. V. Pottosin, S. N. Kardash, “Pipelining combinational circuits”, Prikl. Diskr. Mat., 2014, no. 1(23), 106–113 |
|
2013 |
| 7. |
Yu. V. Pottosin, S. N. Kardash, “Pipelining of combinational circuits”, Prikl. Diskr. Mat. Suppl., 2013, no. 6, 121–123 |
|
2011 |
| 8. |
Yu. V. Pottosin, “State assignment in a discrete automaton targeting an implementing low power circuit”, Prikl. Diskr. Mat., 2011, no. 4(14), 62–71 |
1
|
|
2010 |
| 9. |
Yu. V. Pottosin, E. A. Shestakov, “Series parallel decomposition of a system of incompletely specified Boolean functions”, Prikl. Diskr. Mat., 2010, no. 4(10), 55–63 |
1
|
|
| Organisations |
|
| |
|
|
Contact us: