default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuillaume Chèze
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j15]Guillaume Chèze, Thierry Combot:
Symbolic Computations of First Integrals for Polynomial Vector Fields. Found. Comput. Math. 20(4): 681-752 (2020)- [i14]Guillaume Chèze:
Envy-free cake cutting: A polynomial number of queries with high probability. CoRR abs/2005.01982 (2020)
2010 – 2019
- 2019
- [j14]Guillaume Chèze
:
How to share a cake with a secret agent. Math. Soc. Sci. 100: 13-15 (2019) - [j13]Guillaume Chèze:
Cake cutting: Explicit examples for impossibility results. Math. Soc. Sci. 102: 68-72 (2019) - [i13]Guillaume Chèze:
Cake cutting: Explicit examples for impossibility results. CoRR abs/1907.04810 (2019) - 2018
- [i12]Guillaume Chèze:
Don't cry to be the first! Symmetric fair division algorithms exist. CoRR abs/1804.03833 (2018) - [i11]Guillaume Chèze:
How to share a cake with a secret agent. CoRR abs/1810.06913 (2018) - 2017
- [j12]Guillaume Chèze:
Existence of a simple and equitable fair division: A short proof. Math. Soc. Sci. 87: 92-93 (2017) - [j11]Guillaume Chèze:
Topological aggregation, the twin paradox and the No Show paradox. Soc. Choice Welf. 48(4): 707-715 (2017) - [i10]Guillaume Chèze:
Existence of a simple and equitable fair division: a short proof. CoRR abs/1703.09804 (2017) - [i9]Guillaume Chèze, Luca Amodei:
How to cut a cake with a gram matrix. CoRR abs/1707.02871 (2017) - [i8]Guillaume Chèze, Thierry Combot:
Symbolic Computations of First Integrals for Polynomial Vector Fields. CoRR abs/1710.08225 (2017) - 2016
- [j10]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): 1393-1425 (2016) - [i7]Guillaume Chèze:
Topological aggregation, the twin paradox and the no show paradox. CoRR abs/1608.07410 (2016) - 2013
- [j9]Guillaume Chèze:
A recombination algorithm for the decomposition of multivariate rational functions. Math. Comput. 82(283): 1793-1812 (2013) - [i6]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 abs/1310.2778 (2013) - 2011
- [j8]Guillaume Chèze:
Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time. J. Complex. 27(2): 246-262 (2011) - [j7]Guillaume Chèze, André Galligo, Bernard Mourrain, Jean-Claude Yakoubsohn:
A subdivision method for computing nearest gcd with certification. Theor. Comput. Sci. 412(35): 4493-4503 (2011) - 2010
- [j6]Guillaume Chèze:
Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth Theorem. J. Complex. 26(4): 344-363 (2010) - [j5]Cristina Bertone, Guillaume Chèze, André Galligo:
Modular Las Vegas algorithms for polynomial absolute factorization. J. Symb. Comput. 45(12): 1280-1295 (2010) - [i5]Guillaume Chèze:
Nearly Optimal Algorithms for the Decomposition of Multivariate Rational Functions and the Extended Lüroth's Theorem. CoRR abs/1004.5285 (2010) - [i4]Guillaume Chèze:
Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time. CoRR abs/1009.2876 (2010) - [i3]Guillaume Chèze:
A recombination algorithm for the decomposition of multivariate rational functions. CoRR abs/1011.0972 (2010)
2000 – 2009
- 2009
- [j4]Cristina Bertone, Guillaume Chèze, André Galligo:
Probabilistic algorithms for polynomial absolute factorization. ACM Commun. Comput. Algebra 43(3/4): 77-78 (2009) - [c2]Guillaume Chèze, Jean-Claude Yakoubsohn, André Galligo, Bernard Mourrain:
Computing nearest Gcd with certification. SNC 2009: 29-34 - [i2]Laurent Busé, Guillaume Chèze, Salah Najib:
Noether's forms for the study of non-composite rational functions and their spectrum. CoRR abs/0906.2925 (2009) - 2008
- [j3]Guillaume Chèze, Mohamed Elkadi, André Galligo, Martin Weimann:
Absolute factoring of bidegree bivariate polynomials. ACM Commun. Comput. Algebra 42(3): 151-153 (2008) - [i1]Laurent Busé, Guillaume Chèze:
On the total order of reducibility of a pencil of algebraic plane curves. CoRR abs/0812.4706 (2008) - 2007
- [j2]Guillaume Chèze, Grégoire Lecerf:
Lifting and recombination techniques for absolute factorization. J. Complex. 23(3): 380-420 (2007) - 2006
- [j1]Guillaume Chèze, André Galligo:
From an approximate to an exact absolute polynomial factorization. J. Symb. Comput. 41(6): 682-696 (2006) - 2004
- [c1]Guillaume Chèze:
Absolute polynomial factorization in two variables and the knapsack problem. ISSAC 2004: 87-94
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:47 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:
