[SDU Logo]   Dept. of Mathematics and Computer Science
University of Southern Denmark Phone/Email Directory | Maps | På dansk  På dansk  

IMADA > Employees > Magnus Gausdal Find
[Portrait] Magnus Gausdal Find
PhD Student

Address information

magnusgf, imada, sdu (insert funny A sign, dots and .dk)
Dept. of Mathematics & Computer Science
University of Southern Denmark
Campusvej 55
DK-5230 Odense M
I am now at NIST. Please see my new web page instead of this

About me

As of February 2011 I have been a PhD student under the advisory of Joan Boyar. The topic of my project is "Linearity and Nonlinearity: Complexity and Measures".
I have a bachelor's degree in computer science (minor in mathematics) and a master's degree in computer science. My bachelor's thesis was within the area of quantum computing, the report can be found here. In the fall 2012, I visited Toniann Pitassi at the University of Toronto.


My office is located at IMADA, more precisely Ø-18-511b-2, for a map see here, here , or here

Current Teaching

I currently teach MM541: "Combinatorial Mathematics", see here for more information (in Danish).


My research interests include cryptology and computational complexity (in particular their intersection). Specifically most of my research time has been spent within the following questions, (see also my CV and DBLP)
  • Measures of nonlinearity (or cryptographic measures), and how these relate to each other, with particular emphasis on multiplicative complexity. For more information see
    Four measures of nonlinearity
    J. Boyar, M. Find, R. Peralta
    8th International Conference on Algorithms and Complexity (CIAC 2013), Lecture Notes in Computer Science 7878: 61-72, Springer, 2013. (see also ePrint)
    On the complexity of computing two nonlinearity measures
    M. G. Find
    The 9th International Computer Science Symposium in Russia (CSR 2014), Lecture Notes in Computer Science 8476: 167-175, Springer, 2014 (see also arXiv)
    The Relationship Between Multiplicative Complexity and Nonlinearity
    J. Boyar, M. G. Find
    (to appear in the proceedings of) 39th International Symposium on Mathematical Foundations of Computer Science (MFCS 2014), Springer, 2014. (See also arXiv)
  • Computation of linear operators, with focus of showing separation results. I.e. showing that some matrices are significantly harder to compute in one (semi)-ring than in another. For more information see
    Cancellation-free circuits in unbounded and bounded depth
    J. Boyar, M. Find.
    Fundamentals of Computation Theory - 19th International Symposium (FCT 2013), Lecture Notes in Computer Science 8070: 159-170, Springer, 2013. (see also arXiv)
    Separating OR, SUM and XOR circuits
    Magnus Find, Mika Göös, Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen.
    In submission. (see also arXiv)

Current teaching activities

Currently I am TA in the course "Introduction to Computer Science". See more here.

Past teaching Activities

Disclaimer: Some of the following links might well be out of date or broken.
Over the last couple of years I have been a teaching assistant in the courses

LaTeX tips

I have collected a few tips on how to use LaTeX properly (in Danish) here

Misc. links

More links (mostly relevant for IMADA people)

(Frequently) "Asked" (Questions)

  1. Q: Your web page is ugly.
    A: Yes, but that was not a question
  2. Q: It seems that you are inconsistent whether to use your middle name?
    A: I started to use my middle name, Gausdal, somewhat consistently after I realized how many false positives google has for "Magnus Find", see e.g. here, here, or, here -
  3. Q: Do you consider the Ubuntu default calculator to be the best program of all times?
    A: no