default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean Françon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j17]Cedric Loi, Paul-Henry Cournède
, Jean Françon:
A Symbolic Method to Analyse Patterns in Plant Structure. Comb. Probab. Comput. 23(5): 842-860 (2014)
2000 – 2009
- 2000
- [j16]Jean Françon, Yves Bertrand:
Topological 3D-manifolds: a statistical study of the cells. Theor. Comput. Sci. 234(1-2): 233-254 (2000)
1990 – 1999
- 1999
- [c14]Jean Françon, Laurent Papier:
Polyhedrization of the Boundary of a Voxel Object. DGCI 1999: 425-434 - 1997
- [j15]Eric Andres, Philippe Nehlig, Jean Françon:
Tunnel-Free Supercover 3D Polygons and Polyhedra. Comput. Graph. Forum 16(3): 3-14 (1997) - [c13]Eric Andres, Philippe Nehlig, Jean Françon:
Supercover of Straight Lines, Planes and Triangles. DGCI 1997: 243-254 - 1996
- [j14]Jean Françon:
Sur la topologie d'un plan arithmétique. Theor. Comput. Sci. 156(1&2): 159-176 (1996) - [c12]Jean Françon:
On recent trends in discrete geometry in computer science. DGCI 1996: 3-16 - [c11]Jean Françon, Jean-Maurice Schramm, Mohamed Tajine:
Recognizing arithmetic straight lines and planes. DGCI 1996: 141-150 - 1995
- [j13]Jean Françon:
Discrete Combinatorial Surfaces. CVGIP Graph. Model. Image Process. 57(1): 20-26 (1995) - 1993
- [c10]Yves Bertrand, Jean-François Dufourd, Jean Françon, Pascal Lienhardt:
Algebraic Specification and Development in Geometric Modeling. TAPSOFT 1993: 75-89 - 1990
- [j12]Jean Françon, B. Randrianarimanana, René Schott:
Analysis of Dynamic Algorithms in Knuth's Model. Theor. Comput. Sci. 72(2&3): 147-167 (1990)
1980 – 1989
- 1989
- [j11]Philippe Flajolet, Jean Françon:
Elliptic Functions, Continued Fractions and Doubled Permutations. Eur. J. Comb. 10(3): 235-241 (1989) - [c9]Jean Françon, B. Randrianarimanana, René Schott:
Dynamic Data Structures with Finite Population: A Combinatorial Analysis. FCT 1989: 162-174 - 1988
- [j10]Didier Arquès, Jean Françon, M. T. Guichet, P. Guichet:
Comparison of Algorithms Controlling Concurrent Access to a Database: A Combinatorial Approach. Theor. Comput. Sci. 58: 3-16 (1988) - [c8]Jean Françon, B. Randrianarimanana, René Schott:
Analysis of Dynamic Algorithms in D. E. Knuth's Model. CAAP 1988: 72-88 - [c7]Philippe de Reffye, Claude Edelin, Jean Françon, Marc Jaeger, Claude Puech:
Plant models faithful to botanical structure and developmentr. SIGGRAPH 1988: 151-158 - 1986
- [j9]Jean Françon:
Une Approche Quantitative de L'Exclusion Mutuelle. RAIRO Theor. Informatics Appl. 20(3): 275-289 (1986) - [c6]Didier Arquès, Jean Françon, M. T. Guichet, P. Guichet:
Comparison of Algorithms Controlling Concurrent Access to a Database: A Combinatorial Approach. ICALP 1986: 11-20 - 1984
- [j8]Jean Françon:
Sur Le Nombre de Registres Nécessaires a L'évaluation D'une Expression Arithmétique. RAIRO Theor. Informatics Appl. 18(4): 355-364 (1984) - [c5]Didier Arquès, Jean Françon:
Arbres Bien Etiquetes et Fractions Multicontinues. CAAP 1984: 51-62 - [c4]Jean Françon, Claude Puech:
Histoires de Files de Priorite avec Fusions. CAAP 1984: 119-138 - 1980
- [j7]Philippe Flajolet, Jean Françon, Jean Vuillemin:
Sequence of Operations Analysis for Dynamic Data Structures. J. Algorithms 1(2): 111-141 (1980)
1970 – 1979
- 1979
- [j6]Jean Françon, Gérard Viennot:
Permutations selon leurs pics, creux, doubles montées et double descentes, nombres d'euler et nombres de Genocchi. Discret. Math. 28(1): 21-35 (1979) - [c3]Philippe Flajolet, Jean Françon, Jean Vuillemin:
Towards Analysing Sequences of Operations for Dynamic Data Structures (Preliminary Version). FOCS 1979: 183-195 - [c2]Philippe Flajolet, Jean Françon, Jean Vuillemin:
Computing Integrated Costs of Sequences of Operations with Application to Dictionaries. STOC 1979: 49-61 - 1978
- [j5]Jean Françon:
Histoire de fichiers. RAIRO Theor. Informatics Appl. 12(1): 49-62 (1978) - [c1]Jean Françon, Gérard Viennot, Jean Vuillemin:
Description and Analysis of an Efficient Priority Queue Representation. FOCS 1978: 1-7 - 1977
- [j4]Jean Françon:
On the Analysis of Algorithms for Trees. Theor. Comput. Sci. 4(2): 155-169 (1977) - 1976
- [j3]Jean Françon:
Arbres Binaires de Recherche: Propriétés Combinatioires et Applications. RAIRO Theor. Informatics Appl. 10(3): 35-50 (1976) - 1975
- [j2]Jean Françon:
Acyclic and Parking Functions. J. Comb. Theory A 18(1): 27-35 (1975) - 1974
- [j1]Jean Françon:
Preuves combinatoires des identites d'Abel. Discret. Math. 8(4): 331-343 (1974)
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-06-10 20:32 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:
