"Resistant" Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas. - Maurice J. Jansen; Kenneth W. Regan (COCOON, 2007)

Lower Bounds for Syntactically Multilinear Algebraic Branching Programs. - Maurice J. Jansen (MFCS, 2008)

A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle. - Maurice J. Jansen; Kenneth W. Regan (Theor. Comput. Sci., 2008)

Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity. - Maurice J. Jansen; B. V. Raghavendra Rao (CSR, 2009)

Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion. - Maurice J. Jansen (STACS, 2010)

Extracting Roots of Arithmetic Circuits by Adapting Numerical Methods. - Maurice J. Jansen (Electron. Colloquium Comput. Complex., 2010)

Deterministic Black-Box Identity Testing pi-Ordered Algebraic Branching Programs. - Maurice J. Jansen; Youming Qiao; Jayalal Sarma (Electron. Colloquium Comput. Complex., 2010)

Deterministic Identity Testing of Read-Once Algebraic Branching Programs. - Maurice J. Jansen; Youming Qiao; Jayalal Sarma (Electron. Colloquium Comput. Complex., 2010)

Marginal Hitting Sets Imply Super-Polynomial Lower Bounds for Permanent. - Maurice J. Jansen; Rahul Santhanam (Electron. Colloquium Comput. Complex., 2011)

Stronger Lower Bounds and Randomness-Hardness Tradeoffs using Associated Algebraic Complexity Classes. - Maurice J. Jansen; Rahul Santhanam (Electron. Colloquium Comput. Complex., 2011)

Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials. - Maurice J. Jansen (Theory Comput. Syst., 2011)

Stronger Lower Bounds and Randomness-Hardness Trade-Offs Using Associated Algebraic Complexity Classes. - Maurice J. Jansen; Rahul Santhanam (STACS, 2012)

Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits. - Maurice J. Jansen; Meena Mahajan; B. V. Raghavendra Rao (Comput. Complex., 2013)

Permanent does not have succinct polynomial size arithmetic circuits of constant depth. - Maurice J. Jansen; Rahul Santhanam (Inf. Comput., 2013)

Balancing Bounded Treewidth Circuits. - Maurice J. Jansen; Jayalal Sarma (Theory Comput. Syst., 2014)