Merekin Yurii Vladimirovich

Publications in Math-Net.Ru

1. The Shannon function for calculating the Arnold complexity of length $2^n$ binary words for arbitrary $n$
   
   Diskretn. Anal. Issled. Oper., 21:2 (2014),  59–75
2. The Shannon function of computation of the Arnold complexity of length $2^n$ binary words
   
   Diskretn. Anal. Issled. Oper., 19:6 (2012),  49–55
3. On the additive complexity of partially commutative words
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 12:4 (2005),  40–50
4. On the generation of words using the composition operation
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 10:4 (2003),  70–78
5. Estimates for the multiplicative complexity of binary words defined by concatenated Boolean functions
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 9:2 (2002),  36–47
6. Lower bounds for the complexity of symbol sequences defined by symmetric Boolean functions
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 7:2 (2000),  54–64
7. Lower bounds for the multiplicative complexity of symbol sequences defined by monotone symmetric Boolean functions
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 6:3 (1999),  3–9
8. Upper bounds for the complexity of symbol sequences generated by symmetric Boolean functions
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 5:3 (1998),  38–43
9. On the complexity of symbol sequences defined by linear Boolean functions
   
   Sib. Zh. Ind. Mat., 1:1 (1998),  145–147
10. A lower bound on complexity for schemes of the concatenation of words
    
    Diskretn. Anal. Issled. Oper., 3:1 (1996),  52–56