Sergeev I.S., “Circuits of logarithmic depth for inversion in finite fields of characteristic 2”, Matematicheskie voprosy kibernetiki. Issue 15 (in Russian), Nauka, Moscow, 2006, 35–64
Sergeev I.S., “On the complexity of parallel prefix circuits”, Electronic Colloquium on Computational Complexity, 2013, TR13-041
Sergeev I.S., “Upper bounds on the depth of symmetric Boolean functions”, Moscow University Computational Mathematics and Cybernetics, 37:4 (2013), 195–201
Jukna Stasys, Sergeev Igor, “Complexity of linear Boolean operators”, Foundations and Trends in Theoretical Computer Science, 9:1 (2013), 1–123
Sergeev I.S., “On the asymptotic complexity of sorting”, Electronic Colloquium on Computational Complexity, 2020, TR20-096
I. S. Sergeev, “A lower complexity bound for boolean operators”, Diskr. Mat., 38:1 (2026), 95–106
2.
I. S. Sergeev, “Complexity of basic Boolean operators for digital circuit design”, Intelligent systems. Theory and applications, 30:1 (2026), 164–186
2025
3.
I. S. Sergeev, “Lower Bounds for Additive Complexity of Linear Operators and Bilinear Algorithms for Matrix and Polynomial Multiplication over $GF(2)$”, Mat. Zametki, 118:4 (2025), 607–624; Math. Notes, 118:4 (2025), 848–862
I. S. Sergeev, “On the complexity of fanout-bounded parallel prefix circuits”, Diskretn. Anal. Issled. Oper., 31:4 (2024), 151–167; J. Appl. Industr. Math., 18:4 (2024), 851–860
5.
I. S. Sergeev, “On the Additive Complexity
of Some Numerical Sequences”, Mat. Zametki, 115:3 (2024), 408–421; Math. Notes, 115:3 (2024), 378–389
I. S. Sergeev, “A lower bound on the monotone switching complexity of the threshold function $T_n^{n-1}$”, Diskr. Mat., 35:4 (2023), 126–131; Discrete Math. Appl., 35:5 (2025), 327–330
2022
7.
I. S. Sergeev, “On the multiplicative complexity of polynomials”, Diskr. Mat., 34:3 (2022), 85–89; Discrete Math. Appl., 34:1 (2024), 29–32
2021
8.
I. S. Sergeev, “Formula Complexity of a Linear Function in a $k$-ary Basis”, Mat. Zametki, 109:3 (2021), 419–435; Math. Notes, 109:3 (2021), 445–458
I. S. Sergeev, “On the upper bound of the complexity of sorting”, Zh. Vychisl. Mat. Mat. Fiz., 61:2 (2021), 345–362; Comput. Math. Math. Phys., 61:2 (2021), 329–346
2020
10.
S. B. Gashkov, I. S. Sergeev, “Multiplication”, Chebyshevskii Sb., 21:1 (2020), 101–134
I. S. Sergeev, “On the complexity of monotone circuits for threshold symmetric Boolean functions”, Diskr. Mat., 32:1 (2020), 81–109; Discrete Math. Appl., 31:5 (2021), 345–366
I. S. Sergeev, “On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates”, Diskr. Mat., 30:2 (2018), 120–137; Discrete Math. Appl., 29:4 (2019), 241–254
I. S. Sergeev, “On the real complexity of a complex DFT”, Probl. Peredachi Inf., 53:3 (2017), 90–99; Problems Inform. Transmission, 53:3 (2017), 284–293
I. S. Sergeev, “Upper bounds for the size and the depth of formulae for MOD-functions”, Diskr. Mat., 28:2 (2016), 108–116; Discrete Math. Appl., 27:1 (2017), 15–22
S. B. Gashkov, I. S. Sergeev, “On the Additive Complexity of GCD and LCM Matrices”, Mat. Zametki, 100:2 (2016), 196–211; Math. Notes, 100:2 (2016), 199–212
I. S. Sergeev, “On the complexity of computing prime tables on the Turing machine”, Prikl. Diskr. Mat., 2016, no. 1(31), 86–91
21.
I. S. Sergeev, “Complexity and depth of formulas for symmetric Boolean functions”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2016, no. 3, 53–57; Moscow University Mathematics Bulletin, 71:3 (2016), 127–130
I. S. Sergeev, “Upper bounds on the formula size of symmetric Boolean functions”, Izv. Vyssh. Uchebn. Zaved. Mat., 2014, no. 5, 38–52; Russian Math. (Iz. VUZ), 58:5 (2014), 30–42
S. B. Gashkov, I. S. Sergeev, “On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2”, Diskr. Mat., 25:1 (2013), 3–32; Discrete Math. Appl., 23:1 (2013), 1–37
S. B. Gashkov, I. S. Sergeev, “Complexity of computation in finite fields”, Fundam. Prikl. Mat., 17:4 (2012), 95–131; J. Math. Sci., 191:5 (2013), 661–685
S. B. Gashkov, I. S. Sergeev, “A method for deriving lower bounds for the complexity of monotone arithmetic circuits computing real polynomials”, Mat. Sb., 203:10 (2012), 33–70; Sb. Math., 203:10 (2012), 1411–1447
M. I. Grinchuk, I. S. Sergeev, “Thin circulant matrixes and lower bounds on complexity of some Boolean operators”, Diskretn. Anal. Issled. Oper., 18:5 (2011), 38–53
I. S. Sergeev, “Regular estimates for the complexity of polynomial multiplication and truncated Fourier transform”, Prikl. Diskr. Mat., 2011, no. 4(14), 72–88
I. S. Sergeev, “Fast algorithms for elementary operations on complex power series”, Diskr. Mat., 22:1 (2010), 17–49; Discrete Math. Appl., 20:1 (2010), 25–60
S. B. Gashkov, I. S. Sergeev, “The complexity and depth of Boolean circuits for multiplication and inversion in some fields $GF(2^n)$”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2009, no. 4, 3–7
S. B. Gashkov, I. S. Sergeev, “On design of circuits of logarithmic depth for inversion in finite fields”, Diskr. Mat., 20:4 (2008), 8–28; Discrete Math. Appl., 18:5 (2008), 483–504
S. B. Gashkov, M. I. Grinchuk, I. S. Sergeev, “On the construction of schemes for adders of small depth”, Diskretn. Anal. Issled. Oper., Ser. 1, 14:1 (2007), 27–44; J. Appl. Industr. Math., 2:2 (2008), 167–178
I. S. Sergeev, “On constructing circuits for transforming the polynomial and normal bases of finite fields from one to the other”, Diskr. Mat., 19:3 (2007), 89–101; Discrete Math. Appl., 17:4 (2007), 361–373
I. S. Sergeev, “Inversion in finite fields of characteristic $2$ using logarithmic depth”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2007, no. 1, 28–33
S. B. Gashkov, I. S. Sergeev, “An application of the method of additive chains to inversion in finite fields”, Diskr. Mat., 18:4 (2006), 56–72; Discrete Math. Appl., 16:6 (2006), 601–618
Contact us: