default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuillaume Malod
Person information
- affiliation: Université Paris Diderot, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c10]Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan
, Sébastien Tavenas:
Towards Optimal Depth-Reductions for Algebraic Formulas. CCC 2023: 28:1-28:19- [i10]Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas:
Towards Optimal Depth-Reductions for Algebraic Formulas. CoRR abs/2302.06984 (2023) - [i9]Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas:
Towards Optimal Depth-Reductions for Algebraic Formulas. Electron. Colloquium Comput. Complex. TR23 (2023) - 2021
- [j9]Aleksandrs Belovs, Arturo Castellanos, Francois Le Gall, Guillaume Malod, Alexander A. Sherstov:
Quantum communication complexity of distribution testing. Quantum Inf. Comput. 21(15&16): 1261-1273 (2021) - 2020
- [i8]Aleksandrs Belovs, Arturo Castellanos, François Le Gall, Guillaume Malod, Alexander A. Sherstov:
Quantum Communication Complexity of Distribution Testing. CoRR abs/2006.14870 (2020)
2010 – 2019
- 2019
- [j8]Guillaume Lagarde, Guillaume Malod, Sylvain Perifel:
Non-commutative computations: lower bounds and polynomial identity testing. Chic. J. Theor. Comput. Sci. 2019 (2019) - [c9]Hervé Fournier, Guillaume Malod, Maud Szusterman, Sébastien Tavenas:
Nonnegative Rank Measures and Monotone Algebraic Branching Programs. FSTTCS 2019: 15:1-15:14 - [i7]Hervé Fournier, Guillaume Malod, Maud Szusterman, Sébastien Tavenas:
Nonnegative rank measures and monotone algebraic branching programs. Electron. Colloquium Comput. Complex. TR19 (2019) - 2016
- [j7]Arnaud Durand, Meena Mahajan, Guillaume Malod, Nicolas de Rugy-Altherre, Nitin Saurabh:
Homomorphism Polynomials Complete for VP. Chic. J. Theor. Comput. Sci. 2016 (2016) - [j6]Nutan Limaye, Guillaume Malod, Srikanth Srinivasan:
Lower Bounds for Non-Commutative Skew Circuits. Theory Comput. 12(1): 1-38 (2016) - [i6]Guillaume Lagarde, Guillaume Malod, Sylvain Perifel:
Non-commutative computations: lower bounds and polynomial identity testing. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j5]Hervé Fournier, Guillaume Malod, Stefan Mengel:
Monomials in Arithmetic Circuits: Complete Problems in the Counting Hierarchy. Comput. Complex. 24(1): 1-30 (2015) - [j4]Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan:
Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication. SIAM J. Comput. 44(5): 1173-1201 (2015) - [i5]Nutan Limaye, Guillaume Malod, Srikanth Srinivasan:
Lower bounds for non-commutative skew circuits. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c8]Arnaud Durand, Meena Mahajan, Guillaume Malod, Nicolas de Rugy-Altherre, Nitin Saurabh:
Homomorphism Polynomials Complete for VP. FSTTCS 2014: 493-504 - [c7]Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan:
Lower bounds for depth 4 formulas computing iterated matrix multiplication. STOC 2014: 128-135 - [i4]Arnaud Durand, Meena Mahajan, Guillaume Malod, Nicolas de Rugy-Altherre, Nitin Saurabh:
Homomorphism polynomials complete for VP. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [i3]Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan:
Lower bounds for depth 4 formulas computing iterated matrix multiplication. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [c6]Hervé Fournier, Guillaume Malod, Stefan Mengel:
Monomials in arithmetic circuits: Complete problems in the counting hierarchy. STACS 2012: 362-373 - [c5]Zeev Dvir, Guillaume Malod, Sylvain Perifel, Amir Yehudayoff:
Separating multilinear branching programs and formulas. STOC 2012: 615-624 - 2011
- [c4]Guillaume Malod:
Succinct Algebraic Branching Programs Characterizing Non-uniform Complexity Classes. FCT 2011: 205-216 - [i2]Hervé Fournier, Guillaume Malod, Stefan Mengel:
Monomials in arithmetic circuits: Complete problems in the counting hierarchy. CoRR abs/1110.6271 (2011) - [i1]Zeev Dvir, Guillaume Malod, Sylvain Perifel, Amir Yehudayoff:
Separating multilinear branching programs and formulas. Electron. Colloquium Comput. Complex. TR11 (2011)
2000 – 2009
- 2008
- [j3]Guillaume Malod, Natacha Portier:
Characterizing Valiant's algebraic complexity classes. J. Complex. 24(1): 16-38 (2008) - [j2]Hervé Fournier, Guillaume Malod:
Universal relations and #P-completeness. Theor. Comput. Sci. 407(1-3): 97-109 (2008) - 2007
- [c3]Guillaume Malod:
The Complexity of Polynomials and Their Coefficient Functions. CCC 2007: 193-204 - 2006
- [c2]Hervé Fournier, Guillaume Malod:
Universal Relations and #P-Completeness. CIAC 2006: 368-379 - [c1]Guillaume Malod, Natacha Portier:
Characterizing Valiant's Algebraic Complexity Classes. MFCS 2006: 704-716 - 2003
- [b1]Guillaume Malod:
Polynômes et coefficients. (Polynomials and coefficients). Claude Bernard University Lyon 1, France, 2003 - 2002
- [j1]Dov M. Gabbay, Guillaume Malod:
Naming Worlds in Modal and Temporal Logic. J. Log. Lang. Inf. 11(1): 29-65 (2002)
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:49 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:
