Jean Françon

Comb. Probab. Comput., 2014

2000

Topological 3D-manifolds: a statistical study of the cells.

[BibT_eX]

[DOI]

Yves Bertrand

Theor. Comput. Sci., 2000

1999

Polyhedrization of the Boundary of a Voxel Object.

[BibT_eX]

[DOI]

Laurent Papier

Proceedings of the Discrete Geometry for Computer Imagery, 1999

1997

Tunnel-Free Supercover 3D Polygons and Polyhedra.

[BibT_eX]

[DOI]

Eric Andres

Philippe Nehlig

Comput. Graph. Forum, 1997

Supercover of Straight Lines, Planes and Triangles.

[BibT_eX]

[DOI]

Eric Andres

Philippe Nehlig

Proceedings of the Discrete Geometry for Computer Imagery, 1997

1996

Sur la topologie d'un plan arithmétique.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Recognizing arithmetic straight lines and planes.

[BibT_eX]

[DOI]

Jean-Maurice Schramm

Mohamed Tajine

Proceedings of the Discrete Geometry for Computer Imagery, 1996

On recent trends in discrete geometry in computer science.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 1996

1995

Discrete Combinatorial Surfaces.

[BibT_eX]

[DOI]

CVGIP Graph. Model. Image Process., 1995

1993

Algebraic Specification and Development in Geometric Modeling.

[BibT_eX]

[DOI]

Yves Bertrand

Jean-François Dufourd

Pascal Lienhardt

Proceedings of the TAPSOFT'93: Theory and Practice of Software Development, 1993

1990

Analysis of Dynamic Algorithms in Knuth's Model.

[BibT_eX]

[DOI]

B. Randrianarimanana

René Schott

Theor. Comput. Sci., 1990

1989

Elliptic Functions, Continued Fractions and Doubled Permutations.

[BibT_eX]

[DOI]

Eur. J. Comb., 1989

Dynamic Data Structures with Finite Population: A Combinatorial Analysis.

[BibT_eX]

[DOI]

B. Randrianarimanana

René Schott

Proceedings of the Fundamentals of Computation Theory, 1989

1988

Comparison of Algorithms Controlling Concurrent Access to a Database: A Combinatorial Approach.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1988

Plant models faithful to botanical structure and developmentr.

[BibT_eX]

[DOI]

Proceedings of the 15th Annual Conference on Computer Graphics and Interactive Techniques, 1988

Analysis of Dynamic Algorithms in D. E. Knuth's Model.

[BibT_eX]

[DOI]

B. Randrianarimanana

René Schott

Proceedings of the CAAP '88, 1988

1986

Une Approche Quantitative de L'Exclusion Mutuelle.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1986

1984

Sur Le Nombre de Registres Nécessaires a L'évaluation D'une Expression Arithmétique.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1984

Histoires de Files de Priorite avec Fusions.

[BibT_eX]

Claude Puech

Proceedings of the CAAP'84, 1984

Arbres Bien Etiquetes et Fractions Multicontinues.

[BibT_eX]

Didier Arquès

Proceedings of the CAAP'84, 1984

1980

Sequence of Operations Analysis for Dynamic Data Structures.

[BibT_eX]

[DOI]

J. Algorithms, 1980

1979

Permutations selon leurs pics, creux, doubles montées et double descentes, nombres d'euler et nombres de Genocchi.

[BibT_eX]

[DOI]

Gérard Viennot

Discret. Math., 1979

Computing Integrated Costs of Sequences of Operations with Application to Dictionaries

[BibT_eX]

[DOI]

Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30, 1979

Towards Analysing Sequences of Operations for Dynamic Data Structures (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

1978

Histoire de fichiers.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1978

Description and Analysis of an Efficient Priority Queue Representation

[BibT_eX]

[DOI]

Gérard Viennot

Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978

1977

On the Analysis of Algorithms for Trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1977

1976

Arbres Binaires de Recherche: Propriétés Combinatioires et Applications.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1976

1975

Acyclic and Parking Functions.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1975

1974

Preuves combinatoires des identites d'Abel.

[BibT_eX]

[DOI]