Jean Marcel Pallo

Publication Activity (10 Years)

Years Active: 1981-2015
Publications (10 Years): 0

Top Topics

Concept Lattice

Filtering Scheme

Top Venues

Inf. Process. Lett.

Publications

Jean-Luc Baril, Jean Marcel Pallo
A Motzkin filter in the Tamari lattice. Discret. Math. 338 (8) (2015)
Jean-Luc Baril, Jean Marcel Pallo
Motzkin subposets and Motzkin geodesics in Tamari lattices. Inf. Process. Lett. 114 (1-2) (2014)
Jean Marcel Pallo
Root-restricted Kleenean rotations. Inf. Process. Lett. 111 (1) (2010)
Jean Marcel Pallo
Kleene Revisited by Suschkewitsch. Acta Cybern. 19 (2) (2009)
Jean Marcel Pallo
Weak associativity and restricted rotation. Inf. Process. Lett. 109 (10) (2009)
Jean-Luc Baril, Jean Marcel Pallo
The pruning-grafting lattice of binary trees. Theor. Comput. Sci. 409 (3) (2008)
Jean Marcel Pallo
Kleene revisited by Suschkewitsch. AFL (2008)
Jean Marcel Pallo
Nonassociativity à la Kleene. CAI (2007)
Jean-Luc Baril, Jean Marcel Pallo
The Phagocyte Lattice of Dyck Words. Order 23 (2-3) (2006)
Jean Marcel Pallo
Rotational tree structures on binary trees and triangulations. Acta Cybern. 17 (4) (2006)
Jean-Luc Baril, Jean Marcel Pallo
Efficient lower and upper bounds of the diagonal-flip distance between triangulations. Inf. Process. Lett. 100 (4) (2006)
Jean Marcel Pallo
Generating binary trees by Glivenko classes on Tamari lattices. Inf. Process. Lett. 85 (5) (2003)
Jean Marcel Pallo
Right-arm rotation distance between binary trees. Inf. Process. Lett. 87 (4) (2003)
Jean-Luc Baril, Jean Marcel Pallo
Matchings in Three Catalan Lattices. Int. J. Comput. Math. 80 (2) (2003)
Christian Germain, Jean Marcel Pallo
Linear Languages with a Nonassociative Concatenation. J. Autom. Lang. Comb. 7 (3) (2002)
Jean Marcel Pallo
The Rotation chi-Lattice of Ternary Trees. Computing 66 (3) (2001)
Jean Marcel Pallo
An efficient upper bound of the rotation distance of binary trees. Inf. Process. Lett. 73 (3-4) (2000)
Christian Germain, Jean Marcel Pallo
Langages rationnels définis avec une concaténation non-associative. Theor. Comput. Sci. 233 (1-2) (2000)
Vincent Vajnovszki, Jean Marcel Pallo
Parallel Algorithms for Listing Well-Formed Parentheses Strings. Parallel Process. Lett. 8 (1) (1998)
Christian Germain, Jean Marcel Pallo
Two Shortest Path Metrics on Well-Formed Parentheses Strings. Inf. Process. Lett. 60 (6) (1996)
Christian Germain, Jean Marcel Pallo
The number of coverings in four catalan lattices. Int. J. Comput. Math. 61 (1-2) (1996)
Jean Marcel Pallo
An Algorithm to Compute the Möbius Function of the Rotation Lattice of Binary Trees. RAIRO Theor. Informatics Appl. 27 (4) (1993)
Jean Marcel Pallo
Une bijection entre arbres binaires et certaines matrices de Jacobi. Discret. Math. 103 (1) (1992)
André Bonnin, Jean Marcel Pallo
A shortest path metric on unlabeled binary trees. Pattern Recognit. Lett. 13 (6) (1992)
Jean Marcel Pallo
A Distance Metric on Binary Trees Using Lattice-Theoretic Measures. Inf. Process. Lett. 34 (3) (1990)
Jean Marcel Pallo
Lexicographic generation of binary unordered trees. Pattern Recognit. Lett. 10 (4) (1989)
Jean Marcel Pallo
Some Properties of the Rotation Lattice of Binary Trees. Comput. J. 31 (6) (1988)
Jean Marcel Pallo
On the Rotation Distance in the Lattice of Binary Trees. Inf. Process. Lett. 25 (6) (1987)
Jean Marcel Pallo
Enumerating, Ranking and Unranking Binary Trees. Comput. J. 29 (2) (1986)
André Bonnin, Jean Marcel Pallo
Sur la generation des arbres binaires par les B-suites. Discret. Math. 51 (2) (1984)
André Bonnin, Jean Marcel Pallo
A-transformation dans les arbres n-aires. Discret. Math. 45 (2-3) (1983)
Jean Marcel Pallo
Word problem in distributed magmas. Fundam. Informaticae 4 (4) (1981)