A note on the fast power series' exponential - Igor S. Sergeev (CoRR, 2012)

Upper bounds for the formula size of the majority function - Igor S. Sergeev (CoRR, 2012)

A relation between additive and multiplicative complexity of Boolean functions - Igor S. Sergeev (CoRR, 2013)

Implementation of linear maps with circulant matrices via modulo 2 rectifier circuits of bounded depth - Igor S. Sergeev (CoRR, 2013)

On relative OR-complexity of Boolean matrices and their complements. - Igor S. Sergeev (CoRR, 2014)

Fast monotone summation over disjoint sets. - Petteri Kaski; Mikko Koivisto; Janne H. Korhonen; Igor S. Sergeev (Inf. Process. Lett., 2014)

On the circuit complexity of the standard and the Karatsuba methods of multiplying integers. - Igor S. Sergeev (CoRR, 2016)

On the complexity of computing prime tables on a Turing machine. - Igor S. Sergeev (CoRR, 2016)

Thin circulant matrices and lower bounds on the complexity of some Boolean operators. - M. I. Grinchuk; Igor S. Sergeev (CoRR, 2017)

Some comments on the structure of the best known networks sorting 16 elements. - Igor S. Sergeev (CoRR, 2018)

On the monotone complexity of the shift operator. - Igor S. Sergeev (CoRR, 2019)

Notes on the complexity of coverings for Kronecker powers of symmetric matrices. - Igor S. Sergeev (CoRR, 2022)