|
|
|
Publications in Math-Net.Ru |
Citations |
|
2019 |
| 1. |
P. V. Roldugin, “Letter to the Editors”, Diskr. Mat., 31:4 (2019), 128   |
|
2017 |
| 2. |
P. V. Roldugin, “Верхняя оценка одной комбинаторной суммы”, Diskr. Mat., 29:1 (2017), 80–94  |
|
2016 |
| 3. |
P. V. Roldugin, “On the number of subsets of the residue ring such that the difference of any pair of elements is not invertible”, Diskr. Mat., 28:4 (2016), 122–138 ; Discrete Math. Appl., 28:2 (2018), 83–96   |
| 4. |
P. V. Roldugin, “Cardinality of subsets of the residue group with nonunit differences of elements”, Diskr. Mat., 28:3 (2016), 111–125 ; Discrete Math. Appl., 27:3 (2017), 187–197 |
1
|
| 5. |
P. V. Roldugin, “On a method for constructing low-weight Boolean functions without majorants of the given number of variables”, Mat. Vopr. Kriptogr., 7:3 (2016), 73–92 |
|
2015 |
| 6. |
P. V. Roldugin, A. V. Tarasov, “Functions without short implicents. Part II: Construction”, Diskr. Mat., 27:4 (2015), 120–132 ; Discrete Math. Appl., 26:3 (2016), 165–174 |
1
|
| 7. |
Pavel V. Roldugin, Alexey V. Tarasov, “Functions without short implicents.Part I: lower estimates of weights”, Diskr. Mat., 27:2 (2015), 94–105 ; Discrete Math. Appl., 26:1 (2016), 41–50 |
2
|
|
2014 |
| 8. |
V. N. Goloshchapov, P. V. Roldugin, “Properties of Boolean functions without three-argument implicents”, Diskr. Mat., 26:2 (2014), 25–41 ; Discrete Math. Appl., 24:6 (2014), 345–358 |
|
2013 |
| 9. |
I. A. Badekha, P. V. Roldugin, “Density of graphs in which each edge is contained in at least two maximal cliques”, Diskr. Mat., 25:3 (2013), 7–21 ; Discrete Math. Appl., 24:1 (2014), 1–12 |
1
|
| 10. |
V. N. Goloshchapov, P. V. Roldugin, “Estimation of the number of variables of Boolean functions of moderate weight containing no implicent of smaller length”, Diskr. Mat., 25:1 (2013), 45–62 ; Discrete Math. Appl., 23:1 (2013), 53–73 |
2
|
| 11. |
P. V. Roldugin, A. V. Tarasov, “On the Boolean functions without upper bijunctive analogues”, Mat. Vopr. Kriptogr., 4:1 (2013), 111–128 |
3
|
|
2012 |
| 12. |
P. V. Roldugin, “Graph reduction in the construction of minimal clique cover”, Mat. Vopr. Kriptogr., 3:3 (2012), 105–128 |
2
|
|
2010 |
| 13. |
I. A. Badeha, P. V. Roldugin, “About relationship between parameters of certain graphs”, Prikl. Diskr. Mat., 2010, no. supplement № 3, 94–95 |
|
2009 |
| 14. |
I. A. Badeha, P. V. Roldugin, “Some properties of graph edge clique coverings”, Prikl. Diskr. Mat., 2009, no. supplement № 1, 95–96 |
|
2006 |
| 15. |
P. V. Roldugin, A. S. Ryzhov, “Представление графов в виде объединения максимальных клик”, Matem. Mod. Kraev. Zadachi, 4 (2006), 95–98 |
|
2004 |
| 16. |
P. V. Roldugin, “On the Number of Non-Hamiltonian Graphs”, Mat. Zametki, 75:5 (2004), 702–710  ; Math. Notes, 75:5 (2004), 652–659 |
|
2003 |
| 17. |
P. V. Roldugin, “Construction of maximally non-Hamiltonian graphs”, Diskr. Mat., 15:2 (2003), 89–102 ; Discrete Math. Appl., 13:3 (2003), 277–289 |
2
|
|
2002 |
| 18. |
P. V. Roldugin, A. V. Tarasov, “On the number of bijunctive functions that are invariant under a given permutation”, Diskr. Mat., 14:3 (2002), 23–41 ; Discrete Math. Appl., 12:4 (2002), 337–356 |
1
|
|
| Organisations |
|
| |
|
|
Contact us: