Roldugin Pavel Vladimirovich

Publications in Math-Net.Ru

1. Letter to the Editors
   
   Diskr. Mat., 31:4 (2019),  128
2. Верхняя оценка одной комбинаторной суммы
   
   Diskr. Mat., 29:1 (2017),  80–94
3. 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
4. Cardinality of subsets of the residue group with nonunit differences of elements
   
   Diskr. Mat., 28:3 (2016),  111–125
5. 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
6. Functions without short implicents. Part II: Construction
   
   Diskr. Mat., 27:4 (2015),  120–132
7. Functions without short implicents.Part I: lower estimates of weights
   
   Diskr. Mat., 27:2 (2015),  94–105
8. Properties of Boolean functions without three-argument implicents
   
   Diskr. Mat., 26:2 (2014),  25–41
9. Density of graphs in which each edge is contained in at least two maximal cliques
   
   Diskr. Mat., 25:3 (2013),  7–21
10. 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
11. On the Boolean functions without upper bijunctive analogues
    
    Mat. Vopr. Kriptogr., 4:1 (2013),  111–128
12. Graph reduction in the construction of minimal clique cover
    
    Mat. Vopr. Kriptogr., 3:3 (2012),  105–128
13. About relationship between parameters of certain graphs
    
    Prikl. Diskr. Mat., 2010, no. supplement № 3,  94–95
14. Some properties of graph edge clique coverings
    
    Prikl. Diskr. Mat., 2009, no. supplement № 1,  95–96
15. Представление графов в виде объединения максимальных клик
    
    Matem. Mod. Kraev. Zadachi, 4 (2006),  95–98
16. On the Number of Non-Hamiltonian Graphs
    
    Mat. Zametki, 75:5 (2004),  702–710
17. Construction of maximally non-Hamiltonian graphs
    
    Diskr. Mat., 15:2 (2003),  89–102
18. On the number of bijunctive functions that are invariant under a given permutation
    
    Diskr. Mat., 14:3 (2002),  23–41