default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFlorent Hivert
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j11]Florent Hivert
, Nicolas M. Thiéry:
Controlling the C3 Super Class Linearization Algorithm for Large Hierarchies of Classes. Order 41(1): 83-98 (2024)- 2021
- [j10]Jean-Christophe Aval, Adrien Boussicault, Bérénice Delcroix-Oger, Florent Hivert, Patxi Laborde-Zubieta:
Non-ambiguous trees: New results and generalisation. Eur. J. Comb. 95: 103331 (2021) - 2016
- [j9]Jean Fromentin, Florent Hivert:
Exploring the tree of numerical semigroups. Math. Comput. 85(301): 2553-2568 (2016) - 2010
- [j8]Florent Hivert, Jean-Christophe Novelli, Jean-Yves Thibon:
Inversion of some series of free quasi-symmetric functions. Eur. J. Comb. 31(1): 29-33 (2010) - 2009
- [j7]Florent Hivert, Anne Schilling, Nicolas M. Thiéry:
Hecke group algebras as quotients of affine Hecke algebras at level 0. J. Comb. Theory A 116(4): 844-863 (2009) - 2008
- [j6]Florent Hivert, Jean-Christophe Novelli, Jean-Yves Thibon:
Trees, functional equations, and combinatorial Hopf algebras. Eur. J. Comb. 29(7): 1682-1695 (2008) - 2005
- [j5]Florent Hivert, Jean-Christophe Novelli, Jean-Yves Thibon:
The algebra of binary search trees. Theor. Comput. Sci. 339(1): 129-165 (2005) - 2004
- [j4]Nantel Bergeron, Florent Hivert, Jean-Yves Thibon:
The peak algebra and the Hecke-Clifford algebras at q=0. J. Comb. Theory A 107(1): 1-19 (2004) - 2002
- [j3]Gérard Duchamp, Florent Hivert, Jean-Yves Thibon:
Noncommutative Symmetric Functions Vi: Free Quasi-Symmetric Functions and Related Algebras. Int. J. Algebra Comput. 12(5): 671-717 (2002) - 2001
- [j2]Julien Cassaigne, Marc Espie, Daniel Krob, Jean-Christophe Novelli, Florent Hivert:
The Chinese Monoid. Int. J. Algebra Comput. 11(3): 301-334 (2001) - [j1]Jean-Christophe Novelli, Gilles Schaeffer, Florent Hivert:
Approximation of a Direction of Nd in Bounded Coordinates. Mob. Networks Appl. 6(6): 547-550 (2001)
Conference and Workshop Papers
- 2024
- [c4]Antoine Abram, Florent Hivert, James D. Mitchell, Jean-Christophe Novelli, Maria Tsalakou:
Power Quotients of Plactic-like Monoids. GASCom 2024: 12-17 - 2017
- [c3]Florent Hivert:
High Performance Computing Experiments in Enumerative and Algebraic Combinatorics. PASCO@ISSAC 2017: 2:1-2:4 - 2010
- [c2]Franck Butelle, Florent Hivert, Micaela Mayero, Frédéric Toumazet:
Formal Proof of SCHUR Conjugate Function. AISC/MKM/Calculemus 2010: 158-171 - 2001
- [c1]François Boulier, Florent Hivert, Daniel Krob, Jean-Christophe Novelli:
Pseudo-Permutations II: Geometry and Representation Theory. DM-CCG 2001: 123-132
Informal and Other Publications
- 2021
- [i2]Bérénice Delcroix-Oger, Florent Hivert, Patxi Laborde-Zubieta, Jean-Christophe Aval, Adrien Boussicault:
Non-ambiguous trees: new results and generalisation (Full version). CoRR abs/2103.07294 (2021) - 2010
- [i1]Franck Butelle, Florent Hivert, Micaela Mayero, Frédéric Toumazet:
Formal Proof of SCHUR Conjugate Function. CoRR abs/1004.5034 (2010)
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-09-06 00:40 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:
