Cancellation-free circuits: An approach for proving superlinear lower bounds for linear Boolean operators - Joan Boyar; Magnus Find (CoRR, 2012)

Four Measures of Nonlinearity. - Joan Boyar; Magnus Find; René Peralta 001 (IACR Cryptol. ePrint Arch., 2013)

On the Complexity of Computing Two Nonlinearity Measures. - Magnus Gausdal Find (CSR, 2014)

The Relationship between Multiplicative Complexity and Nonlinearity. - Joan Boyar; Magnus Gausdal Find (MFCS (2), 2014)

Constructive Relationships Between Algebraic Thickness and Normality. - Joan Boyar; Magnus Gausdal Find (FCT, 2015)

A better-than-3n lower bound for the circuit complexity of an explicit function. - Magnus Gausdal Find; Alexander Golovnev; Edward A. Hirsch; Alexander S. Kulikov (Electron. Colloquium Comput. Complex., 2015)

Cancellation-free circuits in unbounded and bounded depth. - Joan Boyar; Magnus Gausdal Find (Theor. Comput. Sci., 2015)

On various nonlinearity measures for boolean functions. - Joan Boyar; Magnus Gausdal Find; René Peralta 001 (Cryptogr. Commun., 2016)

Separating OR, SUM, and XOR circuits. - Magnus Find; Mika Göös; Matti Järvisalo; Petteri Kaski; Mikko Koivisto; Janne H. Korhonen (J. Comput. Syst. Sci., 2016)

The number of boolean functions with multiplicative complexity 2. - Magnus Gausdal Find; Daniel Smith-Tone; Meltem Sönmez Turan (Int. J. Inf. Coding Theory, 2017)

Multiplicative complexity of vector valued Boolean functions. - Joan Boyar; Magnus Gausdal Find (Theor. Comput. Sci., 2018)

Small low-depth circuits for cryptographic applications. - Joan Boyar; Magnus Gausdal Find; René Peralta 001 (Cryptogr. Commun., 2019)

Better Circuits for Binary Polynomial Multiplication. - Magnus Gausdal Find; René Peralta 001 (IEEE Trans. Computers, 2019)

Improving 3N Circuit Complexity Lower Bounds. - Magnus Gausdal Find; Alexander Golovnev; Edward A. Hirsch; Alexander S. Kulikov (Comput. Complex., 2023)