| Publication | Date of Publication | Type |
|---|
| An explicit finite $B_k$-sequence | 2023-04-08 | Paper |
| On a relation between the depth and complexity of monotone Boolean formulas | 2022-07-15 | Paper |
| On the complexity of monotone circuits for threshold symmetric Boolean functions | 2022-01-05 | Paper |
| Formula complexity of a linear function in a \(k\)-ary basis | 2021-07-08 | Paper |
| Multilevel representation and complexity of circuits of unbounded fan-in gates | 2021-05-28 | Paper |
| On the upper bound of the complexity of sorting | 2021-04-15 | Paper |
| ON THE MEANING OF WORKS BY V. M. KHRAPCHENKO | 2021-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5150372 | 2021-02-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5150442 | 2021-02-15 | Paper |
| ON THE COMPLEXITY OF COMPUTING PRIME TABLES ON THE TURING MACHINE | 2021-02-15 | Paper |
| On the complexity of Fibonacci coding | 2019-12-10 | Paper |
| On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates | 2019-11-05 | Paper |
| Rectifier Circuits of Bounded Depth | 2018-10-30 | Paper |
| On the real complexity of a complex DFT | 2018-05-24 | Paper |
| Upper bounds for the size and the depth of formulae for MOD-functions | 2017-11-02 | Paper |
| On the additive complexity of GCD and LCM matrices | 2017-02-08 | Paper |
| Complexity and depth of formulas for symmetric Boolean functions | 2016-11-01 | Paper |
| Upper bounds on the depth of symmetric Boolean functions | 2016-04-05 | Paper |
| The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\) | 2015-02-02 | Paper |
| Minimal parallel prefix circuits | 2015-02-02 | Paper |
| Upper bounds for the formula size of symmetric Boolean functions | 2014-10-31 | Paper |
| Fast monotone summation over disjoint sets | 2014-04-15 | Paper |
| Complexity of computation in finite fields | 2013-11-20 | Paper |
| On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2 | 2013-10-08 | Paper |
| A method for deriving lower bounds for the complexity of monotone arithmetic circuits computing real polynomials | 2013-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115217 | 2012-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115280 | 2012-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115628 | 2012-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115654 | 2012-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115701 | 2012-02-10 | Paper |
| Fast algorithms for elementary operations on complex power series | 2010-09-06 | Paper |
| On design of circuits of logarithmic depth for inversion in finite fields | 2009-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3597518 | 2009-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3541480 | 2008-11-25 | Paper |
| On constructing circuits for transforming the polynomial and normal bases of finite fields from one to the other | 2008-02-08 | Paper |
| An application of the method of additive chains to inversion in finite fields | 2007-11-02 | Paper |
