default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Guillaume Malod
@inproceedings{DBLP:conf/coco/FournierLM0T23,
author = {Herv{\'{e}} Fournier and
Nutan Limaye and
Guillaume Malod and
Srikanth Srinivasan and
S{\'{e}}bastien Tavenas},
editor = {Amnon Ta{-}Shma},
title = {Towards Optimal Depth-Reductions for Algebraic Formulas},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {28:1--28:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.28},
doi = {10.4230/LIPICS.CCC.2023.28},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/FournierLM0T23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-06984,
author = {Herv{\'{e}} Fournier and
Nutan Limaye and
Guillaume Malod and
Srikanth Srinivasan and
S{\'{e}}bastien Tavenas},
title = {Towards Optimal Depth-Reductions for Algebraic Formulas},
journal = {CoRR},
volume = {abs/2302.06984},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.06984},
doi = {10.48550/ARXIV.2302.06984},
eprinttype = {arXiv},
eprint = {2302.06984},
timestamp = {Mon, 20 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-06984.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FournierLM0T23,
author = {Herv{\'{e}} Fournier and
Nutan Limaye and
Guillaume Malod and
Srikanth Srinivasan and
S{\'{e}}bastien Tavenas},
title = {Towards Optimal Depth-Reductions for Algebraic Formulas},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR23-009}},
year = {2023},
url = {https://eccc.weizmann.ac.il/report/2023/009},
eprinttype = {ECCC},
eprint = {TR23-009},
timestamp = {Mon, 06 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/FournierLM0T23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/qic/BelovsCGMS21,
author = {Aleksandrs Belovs and
Arturo Castellanos and
Francois Le Gall and
Guillaume Malod and
Alexander A. Sherstov},
title = {Quantum communication complexity of distribution testing},
journal = {Quantum Inf. Comput.},
volume = {21},
number = {15{\&}16},
pages = {1261--1273},
year = {2021},
url = {https://doi.org/10.26421/QIC21.15-16-1},
doi = {10.26421/QIC21.15-16-1},
timestamp = {Fri, 10 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/qic/BelovsCGMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-14870,
author = {Aleksandrs Belovs and
Arturo Castellanos and
Fran{\c{c}}ois Le Gall and
Guillaume Malod and
Alexander A. Sherstov},
title = {Quantum Communication Complexity of Distribution Testing},
journal = {CoRR},
volume = {abs/2006.14870},
year = {2020},
url = {https://arxiv.org/abs/2006.14870},
eprinttype = {arXiv},
eprint = {2006.14870},
timestamp = {Wed, 01 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-14870.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cjtcs/LagardeMP19,
author = {Guillaume Lagarde and
Guillaume Malod and
Sylvain Perifel},
title = {Non-commutative computations: lower bounds and polynomial identity
testing},
journal = {Chic. J. Theor. Comput. Sci.},
volume = {2019},
year = {2019},
url = {http://cjtcs.cs.uchicago.edu/articles/2019/2/contents.html},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cjtcs/LagardeMP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/FournierMST19,
author = {Herv{\'{e}} Fournier and
Guillaume Malod and
Maud Szusterman and
S{\'{e}}bastien Tavenas},
editor = {Arkadev Chattopadhyay and
Paul Gastin},
title = {Nonnegative Rank Measures and Monotone Algebraic Branching Programs},
booktitle = {39th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2019, December 11-13, 2019,
Bombay, India},
series = {LIPIcs},
volume = {150},
pages = {15:1--15:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2019.15},
doi = {10.4230/LIPICS.FSTTCS.2019.15},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/FournierMST19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FournierMST19,
author = {Herv{\'{e}} Fournier and
Guillaume Malod and
Maud Szusterman and
S{\'{e}}bastien Tavenas},
title = {Nonnegative rank measures and monotone algebraic branching programs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-100}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/100},
eprinttype = {ECCC},
eprint = {TR19-100},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FournierMST19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cjtcs/DurandMMRS16,
author = {Arnaud Durand and
Meena Mahajan and
Guillaume Malod and
Nicolas de Rugy{-}Altherre and
Nitin Saurabh},
title = {Homomorphism Polynomials Complete for {VP}},
journal = {Chic. J. Theor. Comput. Sci.},
volume = {2016},
year = {2016},
url = {http://cjtcs.cs.uchicago.edu/articles/2016/3/contents.html},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cjtcs/DurandMMRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/LimayeMS16,
author = {Nutan Limaye and
Guillaume Malod and
Srikanth Srinivasan},
title = {Lower Bounds for Non-Commutative Skew Circuits},
journal = {Theory Comput.},
volume = {12},
number = {1},
pages = {1--38},
year = {2016},
url = {https://doi.org/10.4086/toc.2016.v012a012},
doi = {10.4086/TOC.2016.V012A012},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/LimayeMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/LagardeMP16,
author = {Guillaume Lagarde and
Guillaume Malod and
Sylvain Perifel},
title = {Non-commutative computations: lower bounds and polynomial identity
testing},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-094}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/094},
eprinttype = {ECCC},
eprint = {TR16-094},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/LagardeMP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/FournierMM15,
author = {Herv{\'{e}} Fournier and
Guillaume Malod and
Stefan Mengel},
title = {Monomials in Arithmetic Circuits: Complete Problems in the Counting
Hierarchy},
journal = {Comput. Complex.},
volume = {24},
number = {1},
pages = {1--30},
year = {2015},
url = {https://doi.org/10.1007/s00037-013-0079-3},
doi = {10.1007/S00037-013-0079-3},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/FournierMM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FournierLMS15,
author = {Herv{\'{e}} Fournier and
Nutan Limaye and
Guillaume Malod and
Srikanth Srinivasan},
title = {Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication},
journal = {{SIAM} J. Comput.},
volume = {44},
number = {5},
pages = {1173--1201},
year = {2015},
url = {https://doi.org/10.1137/140990280},
doi = {10.1137/140990280},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FournierLMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/LimayeMS15,
author = {Nutan Limaye and
Guillaume Malod and
Srikanth Srinivasan},
title = {Lower bounds for non-commutative skew circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-022}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/022},
eprinttype = {ECCC},
eprint = {TR15-022},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/LimayeMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/DurandMMRS14,
author = {Arnaud Durand and
Meena Mahajan and
Guillaume Malod and
Nicolas de Rugy{-}Altherre and
Nitin Saurabh},
editor = {Venkatesh Raman and
S. P. Suresh},
title = {Homomorphism Polynomials Complete for {VP}},
booktitle = {34th International Conference on Foundation of Software Technology
and Theoretical Computer Science, {FSTTCS} 2014, December 15-17, 2014,
New Delhi, India},
series = {LIPIcs},
volume = {29},
pages = {493--504},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2014.493},
doi = {10.4230/LIPICS.FSTTCS.2014.493},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/DurandMMRS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FournierLMS14,
author = {Herv{\'{e}} Fournier and
Nutan Limaye and
Guillaume Malod and
Srikanth Srinivasan},
editor = {David B. Shmoys},
title = {Lower bounds for depth 4 formulas computing iterated matrix multiplication},
booktitle = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA,
May 31 - June 03, 2014},
pages = {128--135},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2591796.2591824},
doi = {10.1145/2591796.2591824},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/FournierLMS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DurandMMRS14,
author = {Arnaud Durand and
Meena Mahajan and
Guillaume Malod and
Nicolas de Rugy{-}Altherre and
Nitin Saurabh},
title = {Homomorphism polynomials complete for {VP}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-163}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/163},
eprinttype = {ECCC},
eprint = {TR14-163},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DurandMMRS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FournierLMS13,
author = {Herv{\'{e}} Fournier and
Nutan Limaye and
Guillaume Malod and
Srikanth Srinivasan},
title = {Lower bounds for depth 4 formulas computing iterated matrix multiplication},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-100}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/100},
eprinttype = {ECCC},
eprint = {TR13-100},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FournierLMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FournierMM12,
author = {Herv{\'{e}} Fournier and
Guillaume Malod and
Stefan Mengel},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Monomials in arithmetic circuits: Complete problems in the counting
hierarchy},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {362--373},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.362},
doi = {10.4230/LIPICS.STACS.2012.362},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/FournierMM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DvirMPY12,
author = {Zeev Dvir and
Guillaume Malod and
Sylvain Perifel and
Amir Yehudayoff},
editor = {Howard J. Karloff and
Toniann Pitassi},
title = {Separating multilinear branching programs and formulas},
booktitle = {Proceedings of the 44th Symposium on Theory of Computing Conference,
{STOC} 2012, New York, NY, USA, May 19 - 22, 2012},
pages = {615--624},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2213977.2214034},
doi = {10.1145/2213977.2214034},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DvirMPY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/Malod11,
author = {Guillaume Malod},
editor = {Olaf Owe and
Martin Steffen and
Jan Arne Telle},
title = {Succinct Algebraic Branching Programs Characterizing Non-uniform Complexity
Classes},
booktitle = {Fundamentals of Computation Theory - 18th International Symposium,
{FCT} 2011, Oslo, Norway, August 22-25, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6914},
pages = {205--216},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22953-4\_18},
doi = {10.1007/978-3-642-22953-4\_18},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/Malod11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1110-6271,
author = {Herv{\'{e}} Fournier and
Guillaume Malod and
Stefan Mengel},
title = {Monomials in arithmetic circuits: Complete problems in the counting
hierarchy},
journal = {CoRR},
volume = {abs/1110.6271},
year = {2011},
url = {http://arxiv.org/abs/1110.6271},
eprinttype = {arXiv},
eprint = {1110.6271},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1110-6271.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DvirMPY11,
author = {Zeev Dvir and
Guillaume Malod and
Sylvain Perifel and
Amir Yehudayoff},
title = {Separating multilinear branching programs and formulas},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-134}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/134},
eprinttype = {ECCC},
eprint = {TR11-134},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DvirMPY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/MalodP08,
author = {Guillaume Malod and
Natacha Portier},
title = {Characterizing Valiant's algebraic complexity classes},
journal = {J. Complex.},
volume = {24},
number = {1},
pages = {16--38},
year = {2008},
url = {https://doi.org/10.1016/j.jco.2006.09.006},
doi = {10.1016/J.JCO.2006.09.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/MalodP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FournierM08,
author = {Herv{\'{e}} Fournier and
Guillaume Malod},
title = {Universal relations and {\#}P-completeness},
journal = {Theor. Comput. Sci.},
volume = {407},
number = {1-3},
pages = {97--109},
year = {2008},
url = {https://doi.org/10.1016/j.tcs.2008.05.003},
doi = {10.1016/J.TCS.2008.05.003},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FournierM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Malod07,
author = {Guillaume Malod},
title = {The Complexity of Polynomials and Their Coefficient Functions},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {193--204},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.33},
doi = {10.1109/CCC.2007.33},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Malod07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/FournierM06,
author = {Herv{\'{e}} Fournier and
Guillaume Malod},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {Universal Relations and {\#}P-Completeness},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {368--379},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_35},
doi = {10.1007/11758471\_35},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/FournierM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/MalodP06,
author = {Guillaume Malod and
Natacha Portier},
editor = {Rastislav Kralovic and
Pawel Urzyczyn},
title = {Characterizing Valiant's Algebraic Complexity Classes},
booktitle = {Mathematical Foundations of Computer Science 2006, 31st International
Symposium, {MFCS} 2006, Star{\'{a}} Lesn{\'{a}}, Slovakia,
August 28-September 1, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4162},
pages = {704--716},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11821069\_61},
doi = {10.1007/11821069\_61},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/MalodP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/hal/Malod03,
author = {Guillaume Malod},
title = {Polyn{\^{o}}mes et coefficients. (Polynomials and coefficients)},
school = {Claude Bernard University Lyon 1, France},
year = {2003},
url = {https://tel.archives-ouvertes.fr/tel-00087399},
timestamp = {Tue, 21 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/hal/Malod03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jolli/GabbayM02,
author = {Dov M. Gabbay and
Guillaume Malod},
title = {Naming Worlds in Modal and Temporal Logic},
journal = {J. Log. Lang. Inf.},
volume = {11},
number = {1},
pages = {29--65},
year = {2002},
url = {https://doi.org/10.1023/A:1013063928696},
doi = {10.1023/A:1013063928696},
timestamp = {Thu, 17 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jolli/GabbayM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
last updated on 2024-04-24 23:01 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:
