Jean Françon - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 31 from 31

2014

A Symbolic Method to Analyse Patterns in Plant StructureCedric Loi, Paul-Henry Cournède, Jean Françon. cpc, 23(5):842-860, 2014. [doi]

2000

Topological 3D-manifolds: a statistical study of the cellsJean Françon, Yves Bertrand. TCS, 234(1-2):233-254, 2000. [doi]

1999

Polyhedrization of the Boundary of a Voxel ObjectJean Françon, Laurent Papier. dgci 1999: 425-434 [doi]

1997

Supercover of Straight Lines, Planes and TrianglesEric Andres, Philippe Nehlig, Jean Françon. dgci 1997: 243-254

Tunnel-Free Supercover 3D Polygons and PolyhedraEric Andres, Philippe Nehlig, Jean Françon. cgf, 16(3):3-14, 1997.

1996

On recent trends in discrete geometry in computer scienceJean Françon. dgci 1996: 3-16

Recognizing arithmetic straight lines and planesJean Françon, Jean-Maurice Schramm, Mohamed Tajine. dgci 1996: 141-150

Sur la topologie d un plan arithmétiqueJean Françon. TCS, 156(1&2):159-176, 1996. [doi]

1995

Discrete Combinatorial SurfacesJean Françon. cvgip, 57(1):20-26, 1995.

1993

Algebraic Specification and Development in Geometric ModelingYves Bertrand, Jean-François Dufourd, Jean Françon, Pascal Lienhardt. tapsoft 1993: 75-89

1990

Analysis of Dynamic Algorithms in Knuth s ModelJean Françon, B. Randrianarimanana, René Schott. TCS, 72(2&3):147-167, 1990.

1989

Elliptic Functions, Continued Fractions and Doubled PermutationsPhilippe Flajolet, Jean Françon. ejc, 10(3):235-241, 1989. [doi]

Dynamic Data Structures with Finite Population: A Combinatorial AnalysisJean Françon, B. Randrianarimanana, René Schott. fct 1989: 162-174

1988

Comparison of Algorithms Controlling Concurrent Access to a Database: A Combinatorial ApproachDidier Arquès, Jean Françon, M. T. Guichet, P. Guichet. TCS, 58:3-16, 1988.

Plant models faithful to botanical structure and developmentrPhilippe de Reffye, Claude Edelin, Jean Françon, Marc Jaeger, Claude Puech. siggraph 1988: 151-158 [doi]

Analysis of Dynamic Algorithms in D. E. Knuth s ModelJean Françon, B. Randrianarimanana, René Schott. caap 1988: 72-88

1986

Comparison of Algorithms Controlling Concurrent Access to a Database: A Combinatorial ApproachDidier Arquès, Jean Françon, M. T. Guichet, P. Guichet. icalp 1986: 11-20

Une Approche Quantitative de L Exclusion MutuelleJean Françon. ita, 20(3):275-289, 1986.

1984

Arbres Bien Etiquetes et Fractions MulticontinuesDidier Arquès, Jean Françon. caap 1984: 51-62

Histoires de Files de Priorite avec FusionsJean Françon, Claude Puech. caap 1984: 119-138

Sur Le Nombre de Registres Nécessaires a L évaluation D une Expression ArithmétiqueJean Françon. ita, 18(4):355-364, 1984.

1980

Sequence of Operations Analysis for Dynamic Data StructuresPhilippe Flajolet, Jean Françon, Jean Vuillemin. jal, 1(2):111-141, 1980.

1979

Computing Integrated Costs of Sequences of Operations with Application to DictionariesPhilippe Flajolet, Jean Françon, Jean Vuillemin. stoc 1979: 49-61

Towards Analysing Sequences of Operations for Dynamic Data Structures (Preliminary Version)Philippe Flajolet, Jean Françon, Jean Vuillemin. focs 1979: 183-195

Permutations selon leurs pics, creux, doubles montées et double descentes, nombres d'euler et nombres de GenocchiJean Françon, Gérard Viennot. DM, 28(1):21-35, 1979. [doi]

1978

Description and Analysis of an Efficient Priority Queue RepresentationJean Françon, G. Viennot, Jean Vuillemin. focs 1978: 1-7

Histoire de fichiersJean Françon. ita, 12(1):49-62, 1978.

1977

On the Analysis of Algorithms for TreesJean Françon. TCS, 4(2):155-169, 1977.

1976

Arbres Binaires de Recherche: Propriétés Combinatioires et ApplicationsJean Françon. ita, 10(3):35-50, 1976.

1975

Acyclic and Parking FunctionsJean Françon. JCT, 18(1):27-35, 1975.

1974

Preuves combinatoires des identites d'AbelJean Françon. DM, 8(4):331-343, 1974. [doi]

Sign in or sign up to see more results.

runs on WebDSL