Guillaume Chèze

Publication Activity (10 Years)

Years Active: 2004-2020
Publications (10 Years): 14

Top Topics

Efficient Algorithms For Computing

Top Venues

Math. Soc. Sci.

Soc. Choice Welf.

Publications

Guillaume Chèze, Thierry Combot
Symbolic Computations of First Integrals for Polynomial Vector Fields. Found. Comput. Math. 20 (4) (2020)
Guillaume Chèze
Envy-free cake cutting: A polynomial number of queries with high probability. CoRR (2020)
Guillaume Chèze
Cake cutting: Explicit examples for impossibility results. CoRR (2019)
Guillaume Chèze
Cake cutting: Explicit examples for impossibility results. Math. Soc. Sci. 102 (2019)
Guillaume Chèze
How to share a cake with a secret agent. Math. Soc. Sci. 100 (2019)
Guillaume Chèze
Don't cry to be the first! Symmetric fair division algorithms exist. CoRR (2018)
Guillaume Chèze
How to share a cake with a secret agent. CoRR (2018)
Guillaume Chèze
Topological aggregation, the twin paradox and the No Show paradox. Soc. Choice Welf. 48 (4) (2017)
Guillaume Chèze
Existence of a simple and equitable fair division: A short proof. Math. Soc. Sci. 87 (2017)
Guillaume Chèze
Existence of a simple and equitable fair division: a short proof. CoRR (2017)
Guillaume Chèze, Thierry Combot
Symbolic Computations of First Integrals for Polynomial Vector Fields. CoRR (2017)
Guillaume Chèze, Luca Amodei
How to cut a cake with a gram matrix. CoRR (2017)
Alin Bostan, Guillaume Chèze, Thomas Cluzeau, Jacques-Arthur Weil
Efficient algorithms for computing rational first integrals and Darboux polynomials of planar polynomial vector fields. Math. Comput. 85 (299) (2016)
Guillaume Chèze
Topological aggregation, the twin paradox and the no show paradox. CoRR (2016)
Guillaume Chèze
A recombination algorithm for the decomposition of multivariate rational functions. Math. Comput. 82 (283) (2013)
Alin Bostan, Guillaume Chèze, Thomas Cluzeau, Jacques-Arthur Weil
Efficient Algorithms for Computing Rational First Integrals and Darboux Polynomials of Planar Polynomial Vector Fields. CoRR (2013)
Guillaume Chèze
Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time. J. Complex. 27 (2) (2011)
Guillaume Chèze, André Galligo, Bernard Mourrain, Jean-Claude Yakoubsohn
A subdivision method for computing nearest gcd with certification. Theor. Comput. Sci. 412 (35) (2011)
Guillaume Chèze
Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth Theorem. J. Complex. 26 (4) (2010)
Guillaume Chèze
A recombination algorithm for the decomposition of multivariate rational functions CoRR (2010)
Cristina Bertone, Guillaume Chèze, André Galligo
Modular Las Vegas algorithms for polynomial absolute factorization. J. Symb. Comput. 45 (12) (2010)
Guillaume Chèze
Nearly Optimal Algorithms for the Decomposition of Multivariate Rational Functions and the Extended Lüroth's Theorem CoRR (2010)
Guillaume Chèze
Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time CoRR (2010)
Cristina Bertone, Guillaume Chèze, André Galligo
Probabilistic algorithms for polynomial absolute factorization. ACM Commun. Comput. Algebra 43 (3/4) (2009)
Guillaume Chèze, Jean-Claude Yakoubsohn, André Galligo, Bernard Mourrain
Computing nearest Gcd with certification. SNC (2009)
Laurent Busé, Guillaume Chèze, Salah Najib
Noether's forms for the study of non-composite rational functions and their spectrum CoRR (2009)
Guillaume Chèze, Mohamed Elkadi, André Galligo, Martin Weimann
Absolute factoring of bidegree bivariate polynomials. ACM Commun. Comput. Algebra 42 (3) (2008)
Laurent Busé, Guillaume Chèze
On the total order of reducibility of a pencil of algebraic plane curves. CoRR (2008)
Guillaume Chèze, Grégoire Lecerf
Lifting and recombination techniques for absolute factorization. J. Complex. 23 (3) (2007)
Guillaume Chèze, André Galligo
From an approximate to an exact absolute polynomial factorization. J. Symb. Comput. 41 (6) (2006)
Guillaume Chèze
Absolute polynomial factorization in two variables and the knapsack problem. ISSAC (2004)