Jean Marcel Pallo

Discret. Math., 2015

2014

Motzkin subposets and Motzkin geodesics in Tamari lattices.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2014

2010

Root-restricted Kleenean rotations.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

2009

Weak associativity and restricted rotation.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

2008

The pruning-grafting lattice of binary trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Kleene revisited by Suschkewitsch.

[BibT_eX]

Proceedings of the Automata and Formal Languages, 12th International Conference, 2008

2007

Nonassociativity à la Kleene.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Informatics, Second International Conference, 2007

2006

The Phagocyte Lattice of Dyck Words.

[BibT_eX]

[DOI]

Order, 2006

Efficient lower and upper bounds of the diagonal-flip distance between triangulations.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

Rotational tree structures on binary trees and triangulations.

[BibT_eX]

[DOI]

Acta Cybern., 2006

2003

Right-arm rotation distance between binary trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Generating binary trees by Glivenko classes on Tamari lattices.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Matchings in Three Catalan Lattices.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2003

2002

Linear Languages with a Nonassociative Concatenation.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2002

2001

The Rotation chi-Lattice of Ternary Trees.

[BibT_eX]

[DOI]

Computing, 2001

2000

Langages rationnels définis avec une concaténation non-associative.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

An efficient upper bound of the rotation distance of binary trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

1998

Parallel Algorithms for Listing Well-Formed Parentheses Strings.

[BibT_eX]

[DOI]

Vincent Vajnovszki

Parallel Process. Lett., 1998

1996

Two Shortest Path Metrics on Well-Formed Parentheses Strings.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1996

The number of coverings in four catalan lattices.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 1996

1993

An Algorithm to Compute the Möbius Function of the Rotation Lattice of Binary Trees.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1993

1992

A shortest path metric on unlabeled binary trees.

[BibT_eX]

[DOI]

André Bonnin

Pattern Recognit. Lett., 1992

Une bijection entre arbres binaires et certaines matrices de Jacobi.

[BibT_eX]

[DOI]

Discret. Math., 1992

1990

A Distance Metric on Binary Trees Using Lattice-Theoretic Measures.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1990

1989

Lexicographic generation of binary unordered trees.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 1989

1988

Some Properties of the Rotation Lattice of Binary Trees.

[BibT_eX]

[DOI]

Comput. J., 1988

1987

On the Rotation Distance in the Lattice of Binary Trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1987

1986

Enumerating, Ranking and Unranking Binary Trees.

[BibT_eX]

[DOI]

Comput. J., 1986

1984

Sur la generation des arbres binaires par les B-suites.

[BibT_eX]

[DOI]

André Bonnin

Discret. Math., 1984

1983

A-transformation dans les arbres n-aires.

[BibT_eX]

[DOI]

André Bonnin

Discret. Math., 1983

1981

Word problem in distributed magmas.

[BibT_eX]