Jean Marcel Pallo

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