Conference Publications

  1. Joan Boyar, MGF. Constructive Relationships Between Algebraic Thickness and Normality. FCT 2015, arXiv version)
  2. Joan Boyar, MGF. The Relationship Between Multiplicative Complexity and Nonlinearity. MFCS 2014. arXiv version
  3. MGF. On the Complexity of Computing Two Nonlinearity Measures. CSR 2014. arXiv version
  4. Joan Boyar, MGF, René Peralta. Four Measures of Nonlinearity CIAC 2013. ePrint version
  5. Joan Boyar,  MGF. Cancellation-free Circuits in Unbounded and Bounded Depth. FCT 2013. arXiv version

Journal publications

  1. Joan Boyar, MGF, René Peralta. On various measures of nonlinearity. To appear in To appear in Cryptography and Communications – Discrete Structures, Boolean Functions and Sequences. 2015. Almost final version here
  2. Joan Boyar, MGF. Cancellation-free circuits in unbounded and bounded depth. Theor. Comput. Sci. 590: 17-26 (2015). Almost final version on arXiv 


  1. MGF, Meltem Sonmez Turan, Daniel C. Smith-Tone. The Number of Boolean Functions with Multiplicative Complexity 2.
    ePrint version
  2. MGF, Alexander Golovnev, Edward Hirsch, Alexander Kulikov. A better-than-3n lower bound for the circuit complexity of an explicit function. ECCC version
  3. MGF, Joan Boyar. Multiplicative Complexity of Vector Valued Boolean Functions. arXiv version
  4. MGF, Mika Göös, Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen. Separating OR, SUM, and XOR Circuits. arXiv version


  1. My Ph.D. dissertation
  2. Many years ago I wrote my bachelor’s thesis on quantum computation.