| Complexity of computation in finite fields SB Gashkov, IS Sergeev Journal of Mathematical Sciences 191 (5), 661-685, 2013 | 43 | 2013 |
| Complexity of Linear Boolean Operators S Jukna, I Sergeev Foundations and TrendsŪ in Theoretical Computer Science 9 (1), 1-123, 2013 | 34 | 2013 |
| A method for deriving lower bounds for the complexity of monotone arithmetic circuits computing real polynomials SB Gashkov, IS Sergeev Sbornik: Mathematics 203 (10), 1411-1447, 2012 | 19 | 2012 |
| Thin circulant matrixes and lower bounds on complexity of some Boolean operators MI Grinchuk, IS Sergeev Diskretnyi Analiz i Issledovanie Operatsii 18 (5), 38-53, 2011 | 15 | 2011 |
| An application of the method of additive chains to inversion in finite fields. SB Gashkov, IS Sergeev Discrete Mathematics & Applications 16 (6), 2006 | 14 | 2006 |
| Complexity and depth of formulas for symmetric Boolean functions IS Sergeev Moscow University Mathematics Bulletin 71 (3), 127-130, 2016 | 9 | 2016 |
| Upper bounds for the formula size of symmetric boolean functions IS Sergeev Russian Mathematics 58, 30-42, 2014 | 9 | 2014 |
| A relation between additive and multiplicative complexity of Boolean functions IS Sergeev arXiv preprint arXiv:1303.4177, 2013 | 7 | 2013 |
| On the complexity of linear Boolean operators with thin matrices SB Gashkov, IS Sergeev Journal of Applied and Industrial Mathematics 5 (2), 202-211, 2011 | 6 | 2011 |
| On the complexity of parallel prefix circuits IS Sergeev Electronic Colloquium on Computational Complexity, 1-47, 2013 | 5 | 2013 |
| The complexity and depth of Boolean circuits for multiplication and inversion in some fields GF(2 n ) SB Gashkov, IS Sergeev Moscow University Mathematics Bulletin 64, 139-143, 2009 | 5 | 2009 |
| On the asymptotic complexity of sorting IS Sergeev Electronic Colloquium on Computational Complexity, 1-31, 2020 | 4 | 2020 |
| On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates IS Sergeev Discrete Mathematics and Applications 29 (4), 241-254, 2019 | 4 | 2019 |
| On the complexity of Fibonacci coding IS Sergeev Problems of Information Transmission 54, 343-350, 2018 | 4 | 2018 |
| On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2 SB Gashkov, IS Sergeev Discrete Mathematics and Applications 23 (1), 1-37, 2013 | 4 | 2013 |
| On the Complexity of the Gradient of a Rational Function IS Sergeev Journal of Applied and Industrial Mathematics 2 (3), 385-396, 2008 | 4 | 2008 |
| Fast monotone summation over disjoint sets P Kaski, M Koivisto, JH Korhonen, IS Sergeev Information Processing Letters 114 (5), 264–267, 2014 | 3 | 2014 |
| Upper bounds on the depth of symmetric Boolean functions IS Sergeev Moscow University Computational Mathematics and Cybernetics 37, 195-201, 2013 | 3 | 2013 |
| Upper bounds for the formula size of the majority function IS Sergeev arXiv preprint arXiv:1208.3874, 2012 | 3 | 2012 |
| Regular estimates for the complexity of polynomial multiplication and truncated Fourier transform IS Sergeev Prikladnaya Diskretnaya Matematika, 72-88, 2011 | 3 | 2011 |
Janne H. KorhonenIST AustriaVerified email at ist.ac.at
