Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaurice J. Jansen
Person information
- affiliation: School of Informatics, University of Edinburgh
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j5]Maurice J. Jansen, Jayalal Sarma:
Balancing Bounded Treewidth Circuits. Theory Comput. Syst. 54(2): 318-336 (2014)- 2013
- [j4]Maurice J. Jansen, Meena Mahajan
, B. V. Raghavendra Rao:
Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits. Comput. Complex. 22(3): 517-564 (2013) - [j3]Maurice J. Jansen, Rahul Santhanam:
Permanent does not have succinct polynomial size arithmetic circuits of constant depth. Inf. Comput. 222: 195-207 (2013) - 2012
- [c11]Maurice J. Jansen, Rahul Santhanam:
Marginal hitting sets imply super-polynomial lower bounds for permanent. ITCS 2012: 496-506 - [c10]Maurice J. Jansen, Rahul Santhanam:
Stronger Lower Bounds and Randomness-Hardness Trade-Offs Using Associated Algebraic Complexity Classes. STACS 2012: 519-530 - 2011
- [j2]Maurice J. Jansen:
Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials. Theory Comput. Syst. 49(2): 343-354 (2011) - [c9]Maurice J. Jansen, Rahul Santhanam:
Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth. ICALP (1) 2011: 724-735 - [c8]Maurice J. Jansen:
Extracting Roots of Arithmetic Circuits by Adapting Numerical Methods. ICS 2011: 87-100 - [i9]Maurice J. Jansen, Rahul Santhanam:
Marginal Hitting Sets Imply Super-Polynomial Lower Bounds for Permanent. Electron. Colloquium Comput. Complex. TR11 (2011) - [i8]Maurice J. Jansen, Rahul Santhanam:
Stronger Lower Bounds and Randomness-Hardness Tradeoffs using Associated Algebraic Complexity Classes. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [c7]Maurice J. Jansen, Jayalal Sarma:
Balancing Bounded Treewidth Circuits. CSR 2010: 228-239 - [c6]Maurice J. Jansen, Youming Qiao, Jayalal Sarma:
Deterministic Black-Box Identity Testing $pi$-Ordered Algebraic Branching Programs. FSTTCS 2010: 296-307 - [c5]Maurice J. Jansen:
Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion. STACS 2010: 465-476 - [i7]Maurice J. Jansen, Youming Qiao, Jayalal Sarma:
Deterministic Black-Box Identity Testing $\pi$-Ordered Algebraic Branching Programs. CoRR abs/1002.1496 (2010) - [i6]Maurice J. Jansen:
Extracting Roots of Arithmetic Circuits by Adapting Numerical Methods. Electron. Colloquium Comput. Complex. TR10 (2010) - [i5]Maurice J. Jansen, Youming Qiao, Jayalal Sarma:
Deterministic Black-Box Identity Testing pi-Ordered Algebraic Branching Programs. Electron. Colloquium Comput. Complex. TR10 (2010) - [i4]Maurice J. Jansen, Youming Qiao, Jayalal Sarma:
Deterministic Identity Testing of Read-Once Algebraic Branching Programs. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [c4]Maurice J. Jansen:
Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials. CSR 2009: 167-178 - [c3]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 - [i3]Maurice J. Jansen, Jayalal Sarma:
Balancing Bounded Treewidth Circuits. CoRR abs/0910.1427 (2009) - [i2]Maurice J. Jansen:
Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion. CoRR abs/0910.1443 (2009) - [i1]Maurice J. Jansen, Youming Qiao, Jayalal Sarma:
Deterministic Identity Testing of Read-Once Algebraic Branching Programs. CoRR abs/0912.2565 (2009) - 2008
- [j1]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) - [c2]Maurice J. Jansen:
Lower Bounds for Syntactically Multilinear Algebraic Branching Programs. MFCS 2008: 407-418 - 2007
- [c1]Maurice J. Jansen, Kenneth W. Regan:
"Resistant" Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas. COCOON 2007: 470-481
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
