Word problem in distributed magmas. - Jean Marcel Pallo (Fundam. Informaticae, 1981)

A-transformation dans les arbres n-aires. - André Bonnin; Jean Marcel Pallo (Discret. Math., 1983)

Sur la generation des arbres binaires par les B-suites. - André Bonnin; Jean Marcel Pallo (Discret. Math., 1984)

Enumerating, Ranking and Unranking Binary Trees. - Jean Marcel Pallo (Comput. J., 1986)

On the Rotation Distance in the Lattice of Binary Trees. - Jean Marcel Pallo (Inf. Process. Lett., 1987)

Some Properties of the Rotation Lattice of Binary Trees. - Jean Marcel Pallo (Comput. J., 1988)

Lexicographic generation of binary unordered trees. - Jean Marcel Pallo (Pattern Recognit. Lett., 1989)

A Distance Metric on Binary Trees Using Lattice-Theoretic Measures. - Jean Marcel Pallo (Inf. Process. Lett., 1990)

Une bijection entre arbres binaires et certaines matrices de Jacobi. - Jean Marcel Pallo (Discret. Math., 1992)

A shortest path metric on unlabeled binary trees. - André Bonnin; Jean Marcel Pallo (Pattern Recognit. Lett., 1992)

An Algorithm to Compute the Möbius Function of the Rotation Lattice of Binary Trees. - Jean Marcel Pallo (RAIRO Theor. Informatics Appl., 1993)

The number of coverings in four catalan lattices. - Christian Germain; Jean Marcel Pallo (Int. J. Comput. Math., 1996)

Two Shortest Path Metrics on Well-Formed Parentheses Strings. - Christian Germain; Jean Marcel Pallo (Inf. Process. Lett., 1996)

Parallel Algorithms for Listing Well-Formed Parentheses Strings. - Vincent Vajnovszki; Jean Marcel Pallo (Parallel Process. Lett., 1998)

An efficient upper bound of the rotation distance of binary trees. - Jean Marcel Pallo (Inf. Process. Lett., 2000)

Langages rationnels définis avec une concaténation non-associative. - Christian Germain; Jean Marcel Pallo (Theor. Comput. Sci., 2000)

The Rotation chi-Lattice of Ternary Trees. - Jean Marcel Pallo (Computing, 2001)

Linear Languages with a Nonassociative Concatenation. - Christian Germain; Jean Marcel Pallo (J. Autom. Lang. Comb., 2002)

Matchings in Three Catalan Lattices. - Jean-Luc Baril; Jean Marcel Pallo (Int. J. Comput. Math., 2003)

Generating binary trees by Glivenko classes on Tamari lattices. - Jean Marcel Pallo (Inf. Process. Lett., 2003)

Right-arm rotation distance between binary trees. - Jean Marcel Pallo (Inf. Process. Lett., 2003)

Rotational tree structures on binary trees and triangulations. - Jean Marcel Pallo (Acta Cybern., 2006)

Efficient lower and upper bounds of the diagonal-flip distance between triangulations. - Jean-Luc Baril; Jean Marcel Pallo (Inf. Process. Lett., 2006)

The Phagocyte Lattice of Dyck Words. - Jean-Luc Baril; Jean Marcel Pallo (Order, 2006)

Nonassociativity à la Kleene. - Jean Marcel Pallo (CAI, 2007)

The pruning-grafting lattice of binary trees. - Jean-Luc Baril; Jean Marcel Pallo (Theor. Comput. Sci., 2008)

Kleene Revisited by Suschkewitsch. - Jean Marcel Pallo (Acta Cybern., 2009)

Weak associativity and restricted rotation. - Jean Marcel Pallo (Inf. Process. Lett., 2009)

Root-restricted Kleenean rotations. - Jean Marcel Pallo (Inf. Process. Lett., 2010)

Motzkin subposets and Motzkin geodesics in Tamari lattices. - Jean-Luc Baril; Jean Marcel Pallo (Inf. Process. Lett., 2014)

A Motzkin filter in the Tamari lattice. - Jean-Luc Baril; Jean Marcel Pallo (Discret. Math., 2015)