 | 2000 |
| 27 |  | Jean Françon,
Yves Bertrand:
Topological 3D-manifolds: a statistical study of the cells.
Theor. Comput. Sci. 234(1-2): 233-254 (2000) |
| 1999 |
| 26 |  | Jean Françon,
Laurent Papier:
Polyhedrization of the Boundary of a Voxel Object.
DGCI 1999: 425-434 |
| 1997 |
| 25 |  | Eric Andres,
Philippe Nehlig,
Jean Françon:
Supercover of Straight Lines, Planes and Triangles.
DGCI 1997: 243-254 |
| 24 |  | Eric Andres,
Philippe Nehlig,
Jean Françon:
Tunnel-Free Supercover 3D Polygons and Polyhedra.
Comput. Graph. Forum 16(3): 3-14 (1997) |
| 1996 |
| 23 |  | Jean Françon,
Jean-Maurice Schramm,
Mohamed Tajine:
Recognizing arithmetic straight lines and planes.
DGCI 1996: 141-150 |
| 22 |  | Jean Françon:
On recent trends in discrete geometry in computer science.
DGCI 1996: 3-16 |
| 21 |  | Jean Françon:
Sur la topologie d'un plan arithmétique.
Theor. Comput. Sci. 156(1&2): 159-176 (1996) |
| 1995 |
| 20 |  | Jean Françon:
Discrete Combinatorial Surfaces.
CVGIP: Graphical Model and Image Processing 57(1): 20-26 (1995) |
| 1993 |
| 19 |  | Yves Bertrand,
Jean-François Dufourd,
Jean Françon,
Pascal Lienhardt:
Algebraic Specification and Development in Geometric Modeling.
TAPSOFT 1993: 75-89 |
| 1990 |
| 18 |  | Jean Françon,
B. Randrianarimanana,
René Schott:
Analysis of Dynamic Algorithms in Knuth's Model.
Theor. Comput. Sci. 72(2&3): 147-167 (1990) |
| 1989 |
| 17 |  | Jean Françon,
B. Randrianarimanana,
René Schott:
Dynamic Data Structures with Finite Population: A Combinatorial Analysis.
FCT 1989: 162-174 |
| 1988 |
| 16 |  | Jean Françon,
B. Randrianarimanana,
René Schott:
Analysis of Dynamic Algorithms in D. E. Knuth's Model.
CAAP 1988: 72-88 |
| 15 |  | Philippe de Reffye,
Claude Edelin,
Jean Françon,
Marc Jaeger,
Claude Puech:
Plant models faithful to botanical structure and developmentr.
SIGGRAPH 1988: 151-158 |
| 14 |  | 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) |
| 1986 |
| 13 |  | 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 |
| 12 |  | Jean Françon:
Une Approche Quantitative de L'Exclusion Mutuelle.
ITA 20(3): 275-289 (1986) |
| 1984 |
| 11 |  | Jean Françon,
Claude Puech:
Histoires de Files de Priorite avec Fusions.
CAAP 1984: 119-138 |
| 10 |  | Didier Arquès,
Jean Françon:
Arbres Bien Etiquetes et Fractions Multicontinues.
CAAP 1984: 51-62 |
| 9 |  | Jean Françon:
Sur Le Nombre de Registres Nécessaires a L'évaluation D'une Expression Arithmétique.
ITA 18(4): 355-364 (1984) |
| 1980 |
| 8 |  | Philippe Flajolet,
Jean Françon,
Jean Vuillemin:
Sequence of Operations Analysis for Dynamic Data Structures.
J. Algorithms 1(2): 111-141 (1980) |
| 1979 |
| 7 |  | Philippe Flajolet,
Jean Françon,
Jean Vuillemin:
Towards Analysing Sequences of Operations for Dynamic Data Structures (Preliminary Version)
FOCS 1979: 183-195 |
| 6 |  | Philippe Flajolet,
Jean Françon,
Jean Vuillemin:
Computing Integrated Costs of Sequences of Operations with Application to Dictionaries
STOC 1979: 49-61 |
| 1978 |
| 5 |  | Jean Françon,
G. Viennot,
Jean Vuillemin:
Description and Analysis of an Efficient Priority Queue Representation
FOCS 1978: 1-7 |
| 4 |  | Jean Françon:
Histoire de fichiers.
ITA 12(1): (1978) |
| 1977 |
| 3 |  | Jean Françon:
On the Analysis of Algorithms for Trees.
Theor. Comput. Sci. 4(2): 155-169 (1977) |
| 1976 |
| 2 |  | Jean Françon:
Arbres Binaires de Recherche: Propriétés Combinatioires et Applications.
ITA 10(3): 35-50 (1976) |
| 1975 |
| 1 |  | Jean Françon:
Acyclic and Parking Functions.
J. Comb. Theory, Ser. A 18(1): 27-35 (1975) |