Maurice J. Jansen

Maurice Julien Jansen

School of Informatics, University of Edinburgh

	2012
22		Maurice J. Jansen, Rahul Santhanam: Marginal hitting sets imply super-polynomial lower bounds for permanent. ITCS 2012: 496-506
21		Maurice J. Jansen, Rahul Santhanam: Stronger Lower Bounds and Randomness-Hardness Trade-Offs Using Associated Algebraic Complexity Classes. STACS 2012: 519-530
	2011
20		Maurice J. Jansen, Rahul Santhanam: Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth. ICALP (1) 2011: 724-735
19		Maurice J. Jansen: Extracting Roots of Arithmetic Circuits by Adapting Numerical Methods. ICS 2011: 87-100
18		Maurice J. Jansen, Rahul Santhanam: Marginal Hitting Sets Imply Super-Polynomial Lower Bounds for Permanent. Electronic Colloquium on Computational Complexity (ECCC) 18: 133 (2011)
17		Maurice J. Jansen, Rahul Santhanam: Stronger Lower Bounds and Randomness-Hardness Tradeoffs using Associated Algebraic Complexity Classes. Electronic Colloquium on Computational Complexity (ECCC) 18: 135 (2011)
16		Maurice J. Jansen: Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials. Theory Comput. Syst. 49(2): 343-354 (2011)
	2010
15		Maurice J. Jansen, Jayalal M. N. Sarma: Balancing Bounded Treewidth Circuits. CSR 2010: 228-239
14		Maurice J. Jansen, Youming Qiao, Jayalal M. N. Sarma: Deterministic Black-Box Identity Testing $pi$-Ordered Algebraic Branching Programs. FSTTCS 2010: 296-307
13		Maurice J. Jansen: Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion. STACS 2010: 465-476
12		Maurice J. Jansen, Youming Qiao, Jayalal M. N. Sarma: Deterministic Black-Box Identity Testing $\pi$-Ordered Algebraic Branching Programs CoRR abs/1002.1496: (2010)
11		Maurice J. Jansen: Extracting Roots of Arithmetic Circuits by Adapting Numerical Methods. Electronic Colloquium on Computational Complexity (ECCC) 17: 118 (2010)
10		Maurice J. Jansen, Youming Qiao, Jayalal M. N. Sarma: Deterministic Black-Box Identity Testing pi-Ordered Algebraic Branching Programs. Electronic Colloquium on Computational Complexity (ECCC) 17: 15 (2010)
9		Maurice J. Jansen, Youming Qiao, Jayalal M. N. Sarma: Deterministic Identity Testing of Read-Once Algebraic Branching Programs. Electronic Colloquium on Computational Complexity (ECCC) 17: 84 (2010)
	2009
8		Maurice J. Jansen: Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials. CSR 2009: 167-178
7		Maurice J. Jansen, B. V. Raghavendra Rao: Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity. CSR 2009: 179-190
6		Maurice J. Jansen, Jayalal M. N. Sarma: Balancing Bounded Treewidth Circuits CoRR abs/0910.1427: (2009)
5		Maurice J. Jansen: Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion CoRR abs/0910.1443: (2009)
4		Maurice J. Jansen, Youming Qiao, Jayalal M. N. Sarma: Deterministic Identity Testing of Read-Once Algebraic Branching Programs CoRR abs/0912.2565: (2009)
	2008
3		Maurice J. Jansen: Lower Bounds for Syntactically Multilinear Algebraic Branching Programs. MFCS 2008: 407-418
2		Maurice J. Jansen, Kenneth W. Regan: A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle. Theor. Comput. Sci. 409(3): 617-622 (2008)
	2007
1		Maurice J. Jansen, Kenneth W. Regan: "Resistant" Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas. COCOON 2007: 470-481

Coauthor Index

1	Youming Qiao	[4] [9] [10] [12] [14]
2	B. V. Raghavendra Rao	[7]
3	Kenneth W. Regan	[1] [2]
4	Rahul Santhanam	[17] [18] [20] [21] [22]
5	Jayalal M. N. Sarma	[4] [6] [9] [10] [12] [14] [15]

Colors in the list of coauthors

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page