Maurice J. Jansen

25 papers A 4B 1Misc 4Journal 14Unranked 2
YearRankTypeTitle / Venue / Authors
2014 J jnl
Balancing Bounded Treewidth Circuits.
Theory Comput. Syst.
Maurice J. Jansen, Jayalal Sarma
2013 J jnl
Permanent does not have succinct polynomial size arithmetic circuits of constant depth.
Inf. Comput.
Maurice J. Jansen, Rahul Santhanam
2013 J jnl
Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits.
Comput. Complex.
Maurice J. Jansen, Meena Mahajan, B. V. Raghavendra Rao
2012 A conf
Marginal hitting sets imply super-polynomial lower bounds for permanent.
ITCS
Maurice J. Jansen, Rahul Santhanam
2012 A conf
Stronger Lower Bounds and Randomness-Hardness Trade-Offs Using Associated Algebraic Complexity Classes.
STACS
Maurice J. Jansen, Rahul Santhanam
2011 A conf
Extracting Roots of Arithmetic Circuits by Adapting Numerical Methods.
ICS
Maurice J. Jansen
2011 J jnl
Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials.
Theory Comput. Syst.
Maurice J. Jansen
2011 J jnl
Marginal Hitting Sets Imply Super-Polynomial Lower Bounds for Permanent.
Electron. Colloquium Comput. Complex.
Maurice J. Jansen, Rahul Santhanam
2011 — conf
Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth.
ICALP (1)
Maurice J. Jansen, Rahul Santhanam
2011 J jnl
Stronger Lower Bounds and Randomness-Hardness Tradeoffs using Associated Algebraic Complexity Classes.
Electron. Colloquium Comput. Complex.
Maurice J. Jansen, Rahul Santhanam
2010 Misc conf
Balancing Bounded Treewidth Circuits.
CSR
Maurice J. Jansen, Jayalal Sarma
2010 J jnl
Deterministic Black-Box Identity Testing $\pi$-Ordered Algebraic Branching Programs
CoRR
Maurice J. Jansen, Youming Qiao, Jayalal Sarma
2010 — conf
Deterministic Black-Box Identity Testing $pi$-Ordered Algebraic Branching Programs.
FSTTCS
Maurice J. Jansen, Youming Qiao, Jayalal Sarma
2010 J jnl
Deterministic Black-Box Identity Testing pi-Ordered Algebraic Branching Programs.
Electron. Colloquium Comput. Complex.
Maurice J. Jansen, Youming Qiao, Jayalal Sarma
2010 J jnl
Deterministic Identity Testing of Read-Once Algebraic Branching Programs.
Electron. Colloquium Comput. Complex.
Maurice J. Jansen, Youming Qiao, Jayalal Sarma
2010 J jnl
Extracting Roots of Arithmetic Circuits by Adapting Numerical Methods.
Electron. Colloquium Comput. Complex.
Maurice J. Jansen
2010 A conf
Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion.
STACS
Maurice J. Jansen
2009 J jnl
Balancing Bounded Treewidth Circuits
CoRR
Maurice J. Jansen, Jayalal Sarma
2009 J jnl
Deterministic Identity Testing of Read-Once Algebraic Branching Programs
CoRR
Maurice J. Jansen, Youming Qiao, Jayalal Sarma
2009 Misc conf
Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials.
CSR
Maurice J. Jansen
2009 Misc conf
Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity.
CSR
Maurice J. Jansen, B. V. Raghavendra Rao
2009 J jnl
Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion
CoRR
Maurice J. Jansen
2008 J jnl
A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle.
Theor. Comput. Sci.
Maurice J. Jansen, Kenneth W. Regan
2008 B conf
Lower Bounds for Syntactically Multilinear Algebraic Branching Programs.
MFCS
Maurice J. Jansen
2007 Misc conf
"Resistant" Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas.
COCOON
Maurice J. Jansen, Kenneth W. Regan