Jean Françon

31 papers A* 5B 1Journal 17Unranked 8
YearRankTypeTitle / Venue / Authors
2014 J jnl
A Symbolic Method to Analyse Patterns in Plant Structure.
Comb. Probab. Comput.
Cedric Loi, Paul-Henry Cournède, Jean Françon
2000 J jnl
Topological 3D-manifolds: a statistical study of the cells.
Theor. Comput. Sci.
Jean Françon, Yves Bertrand
1999 — conf
Polyhedrization of the Boundary of a Voxel Object.
DGCI
Jean Françon, Laurent Papier
1997 — conf
Supercover of Straight Lines, Planes and Triangles.
DGCI
Eric Andres, Philippe Nehlig, Jean Françon
1997 J jnl
Tunnel-Free Supercover 3D Polygons and Polyhedra.
Comput. Graph. Forum
Eric Andres, Philippe Nehlig, Jean Françon
1996 — conf
On recent trends in discrete geometry in computer science.
DGCI
Jean Françon
1996 — conf
Recognizing arithmetic straight lines and planes.
DGCI
Jean Françon, Jean-Maurice Schramm, Mohamed Tajine
1996 J jnl
Sur la topologie d'un plan arithmétique.
Theor. Comput. Sci.
Jean Françon
1995 J jnl
Discrete Combinatorial Surfaces.
CVGIP Graph. Model. Image Process.
Jean Françon
1993 — conf
Algebraic Specification and Development in Geometric Modeling.
TAPSOFT
Yves Bertrand, Jean-François Dufourd, Jean Françon, Pascal Lienhardt
1990 J jnl
Analysis of Dynamic Algorithms in Knuth's Model.
Theor. Comput. Sci.
Jean Françon, B. Randrianarimanana, René Schott
1989 B conf
Dynamic Data Structures with Finite Population: A Combinatorial Analysis.
FCT
Jean Françon, B. Randrianarimanana, René Schott
1989 J jnl
Elliptic Functions, Continued Fractions and Doubled Permutations.
Eur. J. Comb.
Philippe Flajolet, Jean Françon
1988 — conf
Analysis of Dynamic Algorithms in D. E. Knuth's Model.
CAAP
Jean Françon, B. Randrianarimanana, René Schott
1988 J jnl
Comparison of Algorithms Controlling Concurrent Access to a Database: A Combinatorial Approach.
Theor. Comput. Sci.
Didier Arquès, Jean Françon, M. T. Guichet, P. Guichet
1988 A* conf
Plant models faithful to botanical structure and developmentr.
SIGGRAPH
Philippe de Reffye, Claude Edelin, Jean Françon, Marc Jaeger, Claude Puech
1986 A* conf
Comparison of Algorithms Controlling Concurrent Access to a Database: A Combinatorial Approach.
ICALP
Didier Arquès, Jean Françon, M. T. Guichet, P. Guichet
1986 J jnl
Une Approche Quantitative de L'Exclusion Mutuelle.
RAIRO Theor. Informatics Appl.
Jean Françon
1984 — conf
Arbres Bien Etiquetes et Fractions Multicontinues.
CAAP
Didier Arquès, Jean Françon
1984 — conf
Histoires de Files de Priorite avec Fusions.
CAAP
Jean Françon, Claude Puech
1984 J jnl
Sur Le Nombre de Registres Nécessaires a L'évaluation D'une Expression Arithmétique.
RAIRO Theor. Informatics Appl.
Jean Françon
1980 J jnl
Sequence of Operations Analysis for Dynamic Data Structures.
J. Algorithms
Philippe Flajolet, Jean Françon, Jean Vuillemin
1979 A* conf
Computing Integrated Costs of Sequences of Operations with Application to Dictionaries
STOC
Philippe Flajolet, Jean Françon, Jean Vuillemin
1979 J jnl
Permutations selon leurs pics, creux, doubles montées et double descentes, nombres d'euler et nombres de Genocchi.
Discret. Math.
Jean Françon, Gérard Viennot
1979 A* conf
Towards Analysing Sequences of Operations for Dynamic Data Structures (Preliminary Version)
FOCS
Philippe Flajolet, Jean Françon, Jean Vuillemin
1978 A* conf
Description and Analysis of an Efficient Priority Queue Representation
FOCS
Jean Françon, Gérard Viennot, Jean Vuillemin
1978 J jnl
Histoire de fichiers.
RAIRO Theor. Informatics Appl.
Jean Françon
1977 J jnl
On the Analysis of Algorithms for Trees.
Theor. Comput. Sci.
Jean Françon
1976 J jnl
Arbres Binaires de Recherche: Propriétés Combinatioires et Applications.
RAIRO Theor. Informatics Appl.
Jean Françon
1975 J jnl
Acyclic and Parking Functions.
J. Comb. Theory A
Jean Françon
1974 J jnl
Preuves combinatoires des identites d'Abel.
Discret. Math.
Jean Françon