## Maurice Jansen

 Research Fellow, PhD (State University of New York at Buffalo, 2006). Laboratory for Foundations of Computer Science School of Informatics, The University of Edinburgh Room: 5.38, Informatics Forum 10 Crichton Street Edinburgh, EH8 9AB Phone : +44 (0)131 650 5138 maurice.julien.jansen AT gmail DOT com

### New Manuscripts

• Stronger Lower Bounds and Randomness-Hardness Tradeoffs using Associated Algebraic Complexity Classes
• With Rahul Santhanam
• To appear, the 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012).
• Marginal Hitting Sets Imply Super-Polynomial Lower Bounds for Permanent
• With Rahul Santhanam
• The 3rd Innovations in Theoretical Computer Science (ITCS 2012) conference.
• Towards a Tight Hardness-Randomness Connection Between Permanent and Arithmetic Circuit Identity Testing

### 2011

• Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth
• With Rahul Santhanam
• In the proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP 2011), pages 724-735.
• Extracting Roots of Arithmetic Circuits by Adapting Numerical Methods
• In the proceedings of the 2nd Symposium on Innovations in Computer Science (ICS 2011), Tsinghua University Press.
• ### 2010

• Deterministic Black-Box Identity Testing $\pi$-Ordered Algebraic Branching Programs
• With Youming Qiao and Jayalal Sarma M.N.
• In the proceedings of The IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010), LIPIcs volume 8, 2010, pages 296-307.
• Balancing Bounded Treewidth Circuits
• With Jayalal Sarma M.N.
• In the proceedings of the Fifth International Computer Science Symposium in Russia (CSR 2010), Springer LNCS 6072, 2010, pages 228-239.
• Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion
• In the proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), LIPIcs volume 5, 2010, pages 465-476.
• ### 2009

• Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials
• In the proceedings of the Fourth International Computer Science Symposium in Russia (CSR 2009) Springer LNCS 5675, 2009, pages 167--178.
• Journal Version, Theory of Computing Systems, Volume 49, Issue 2 (2011), Page 343-354.
• Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity
• With B.V. Raghavendra Rao.
• In the proceedings of the Fourth International Computer Science Symposium in Russia (CSR 2009) Springer LNCS 5675, 2009, pages 179--190.
• ### 2008

• 'Lower Bounds for Syntactically Multilinear Algebraic Branching Programs'
• In the proceedings of the 33rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2008), Springer LNCS 5261, pp. 407--418.
• 'A Non-Linear Lower Bound for Constant Depth Circuits via the Discrete Uncertainty Principle'
• With Kenneth W. Regan.
• In Theoretical Computer Science, 2008, vol 409(3), pp. 617--622.
• ### 2007

• 'Resistant Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas'
• With Kenneth W. Regan.
• In the proceedings of the 13th Annual International Computing and Combinatorics Conference (COCOON 2007), Springer LNCS 4598, 2007, pp 470--481.

• ### Manuscripts

• Deterministic Identity Testing of Read-Once Algebraic Branching Programs

• ### Dissertation

• Dissertation: 'Lower Bound Frontiers in Arithmetical Circuit Complexity'

• Slides from my dissertation defense

• ### Past Activities

• Postdoctoral Researcher at the Institute for Theoretical Computer Science (ITCS), Tsinghua University
• Aarhus University Workshop on Algebraic Complexity Theory
• Algebra and Computation Seminar (ACS) at Aarhus University