Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of Maurice J. Jansen Maurice Julien Jansen ( http://dblp.L3S.de/Authors/Maurice_J._Jansen )

URL (Homepage):  http://homepages.inf.ed.ac.uk/mjansen1/  Author page on DBLP  Author page in RDF  Community of Maurice J. Jansen in ASPL-2

Publication years (Num. hits)
2007-2010 (15) 2011-2012 (7)
Publication types (Num. hits)
article(11) inproceedings(11)
Venues (Conferences, Journals, ...)
Electronic Colloquium on Compu...(5) CoRR(4) CSR(3) STACS(2) COCOON(1) FSTTCS(1) ICALP(1) ICS(1) ITCS(1) MFCS(1) Theor. Comput. Sci.(1) Theory Comput. Syst.(1)
Authors
Maurice J. Jansen(22) Jayalal M. N. Sarma(7) Rahul Santhanam(5) Youming Qiao(5) Kenneth W. Regan(2) B. V. Raghavendra Rao(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 11 occurrences of 6 keywords
Results
Found 22 publication records. Showing 22 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Maurice J. Jansen, Rahul Santhanam Stronger Lower Bounds and Randomness-Hardness Trade-Offs Using Associated Algebraic Complexity Classes. Search on Bibsonomy STACS The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Maurice J. Jansen, Rahul Santhanam Marginal hitting sets imply super-polynomial lower bounds for permanent. Search on Bibsonomy ITCS The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Maurice J. Jansen, Rahul Santhanam Stronger Lower Bounds and Randomness-Hardness Tradeoffs using Associated Algebraic Complexity Classes. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2011 DBLP  BibTeX  RDF
1Maurice J. Jansen, Rahul Santhanam Marginal Hitting Sets Imply Super-Polynomial Lower Bounds for Permanent. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2011 DBLP  BibTeX  RDF
1Maurice J. Jansen Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Maurice J. Jansen, Rahul Santhanam Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth. Search on Bibsonomy ICALP The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Maurice J. Jansen Extracting Roots of Arithmetic Circuits by Adapting Numerical Methods. Search on Bibsonomy ICS The full citation details ... 2011 DBLP  BibTeX  RDF
1Maurice J. Jansen, Youming Qiao, Jayalal M. N. Sarma Deterministic Identity Testing of Read-Once Algebraic Branching Programs. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Maurice J. Jansen, Youming Qiao, Jayalal M. N. Sarma Deterministic Black-Box Identity Testing pi-Ordered Algebraic Branching Programs. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Maurice J. Jansen Extracting Roots of Arithmetic Circuits by Adapting Numerical Methods. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Maurice J. Jansen, Youming Qiao, Jayalal M. N. Sarma Deterministic Black-Box Identity Testing $\pi$-Ordered Algebraic Branching Programs Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Maurice J. Jansen, Jayalal M. N. Sarma Balancing Bounded Treewidth Circuits. Search on Bibsonomy CSR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Maurice J. Jansen Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion. Search on Bibsonomy STACS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Maurice J. Jansen, Youming Qiao, Jayalal M. N. Sarma Deterministic Black-Box Identity Testing $pi$-Ordered Algebraic Branching Programs. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Maurice J. Jansen, Youming Qiao, Jayalal M. N. Sarma Deterministic Identity Testing of Read-Once Algebraic Branching Programs Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Maurice J. Jansen, Jayalal M. N. Sarma Balancing Bounded Treewidth Circuits Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Maurice J. Jansen Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Maurice J. Jansen, B. V. Raghavendra Rao Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity. Search on Bibsonomy CSR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Maurice J. Jansen Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials. Search on Bibsonomy CSR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF elementary symmetric polynomial, Computational complexity, determinant, arithmetical circuits, permanent
1Maurice J. Jansen, Kenneth W. Regan A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Maurice J. Jansen Lower Bounds for Syntactically Multilinear Algebraic Branching Programs. Search on Bibsonomy MFCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF multilinear polynomials, algebraic branching programs, Computational complexity, lower bounds, arithmetical circuits
1Maurice J. Jansen, Kenneth W. Regan "Resistant" Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas. Search on Bibsonomy COCOON The full citation details ... 2007 DBLP  DOI  BibTeX  RDF constant depth formulas, Computational complexity, lower bounds, arithmetical circuits, partial derivatives
Displaying result #1 - #22 of 22 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.