Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Guillaume Malod" ( http://dblp.L3S.de/Authors/Guillaume_Malod )

  Author page on DBLP  Author page in RDF  Community of Guillaume Malod in ASPL-2

Publication years (Num. hits)
2006 (2) 2007 (1) 2008 (2) 2011 (3) 2012 (2)
Publication types (Num. hits)
article(4) inproceedings(6)
Venues (Conferences, Journals, ...)
CIAC(1) CoRR(1) Electronic Colloquium on Compu...(1) FCT(1) IEEE Conference on Computation...(1) J. Complexity(1) MFCS(1) STACS(1) STOC(1) Theor. Comput. Sci.(1)
Authors
Guillaume Malod(10) Hervé Fournier(4) Amir Yehudayoff(2) Natacha Portier(2) Stefan Mengel(2) Sylvain Perifel(2) Zeev Dvir(2)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 5 occurrences of 5 keywords
Results
Found 10 publication records. Showing 10 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Hervé Fournier, Guillaume Malod, Stefan Mengel Monomials in arithmetic circuits: Complete problems in the counting hierarchy. Search on Bibsonomy STACS The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Zeev Dvir, Guillaume Malod, Sylvain Perifel, Amir Yehudayoff Separating multilinear branching programs and formulas. Search on Bibsonomy STOC The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Zeev Dvir, Guillaume Malod, Sylvain Perifel, Amir Yehudayoff Separating multilinear branching programs and formulas. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2011 DBLP  BibTeX  RDF
1Hervé Fournier, Guillaume Malod, Stefan Mengel Monomials in arithmetic circuits: Complete problems in the counting hierarchy Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Guillaume Malod Succinct Algebraic Branching Programs Characterizing Non-uniform Complexity Classes. Search on Bibsonomy FCT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Hervé Fournier, Guillaume Malod Universal relations and #P-completeness. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Guillaume Malod, Natacha Portier Characterizing Valiant's algebraic complexity classes. Search on Bibsonomy J. Complexity The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Guillaume Malod The Complexity of Polynomials and Their Coefficient Functions. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Guillaume Malod, Natacha Portier Characterizing Valiant's Algebraic Complexity Classes. Search on Bibsonomy MFCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Valiant’s theory, skew circuits, polynomials, Determinant, arithmetic circuits, Permanent, Algebraic complexity
1Hervé Fournier, Guillaume Malod Universal Relations and #P-Completeness. Search on Bibsonomy CIAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #10 of 10 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.