> Magnus Gausdal Find
||Magnus Gausdal Find|
I am now at NIST. Please see my
new web page instead of this
- magnusgf, imada, sdu (insert funny A sign, dots and .dk)
- Dept. of Mathematics & Computer Science
University of Southern Denmark
DK-5230 Odense M
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
at the University of Toronto.
My office is located at IMADA, more precisely
Ø-18-511b-2, for a map see
I currently teach MM541: "Combinatorial Mathematics",
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
- 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
Lecture Notes in Computer Science 7878: 61-72, Springer, 2013.
- On the complexity of computing two nonlinearity measures
- M. G. Find
The 9th International Computer Science Symposium in Russia
Lecture Notes in Computer Science 8476: 167-175, Springer, 2014
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.
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
- J. Boyar, M. Find.
Fundamentals of Computation Theory - 19th International Symposium (FCT 2013),
Lecture Notes in Computer Science 8070: 159-170, Springer, 2013.
- Separating OR, SUM and XOR circuits
- Magnus Find, Mika Göös, Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen.
Current teaching activities
Currently I am TA in the course "Introduction to Computer Science".
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
I have collected a few tips on how to use LaTeX properly
(in Danish) here
More links (mostly relevant for IMADA people)
(Frequently) "Asked" (Questions)
Your web page is ugly.
Yes, but that was not a question
Q: It seems that you are
inconsistent whether to use your middle name?
I started to use my middle name, Gausdal,
somewhat consistently after I realized how many
false positives google has for "Magnus Find", see
Q: Do you consider the Ubuntu default calculator
to be the best program of all times?