2008 |
24 | EE | Jean-Luc Baril,
Jean Marcel Pallo:
The pruning-grafting lattice of binary trees.
Theor. Comput. Sci. 409(3): 382-393 (2008) |
2007 |
23 | EE | Jean Marcel Pallo:
Nonassociativity à la Kleene.
CAI 2007: 260-274 |
2006 |
22 | EE | Jean-Luc Baril,
Jean Marcel Pallo:
Efficient lower and upper bounds of the diagonal-flip distance between triangulations.
Inf. Process. Lett. 100(4): 131-136 (2006) |
21 | EE | Jean-Luc Baril,
Jean Marcel Pallo:
The Phagocyte Lattice of Dyck Words.
Order 23(2-3): 97-107 (2006) |
2003 |
20 | EE | Jean Marcel Pallo:
Generating binary trees by Glivenko classes on Tamari lattices.
Inf. Process. Lett. 85(5): 235-238 (2003) |
19 | EE | Jean Marcel Pallo:
Right-arm rotation distance between binary trees.
Inf. Process. Lett. 87(4): 173-177 (2003) |
18 | EE | Jean-Luc Baril,
Jean Marcel Pallo:
Matchings in Three Catalan Lattices.
Int. J. Comput. Math. 80(2): 193-200 (2003) |
2002 |
17 | | Christian Germain,
Jean Marcel Pallo:
Linear Languages with a Nonassociative Concatenation.
Journal of Automata, Languages and Combinatorics 7(3): 311-320 (2002) |
2001 |
16 | EE | Jean Marcel Pallo:
The Rotation chi-Lattice of Ternary Trees.
Computing 66(3): 297-308 (2001) |
2000 |
15 | EE | Jean Marcel Pallo:
An efficient upper bound of the rotation distance of binary trees.
Inf. Process. Lett. 73(3-4): 87-92 (2000) |
14 | EE | Christian Germain,
Jean Marcel Pallo:
Langages rationnels définis avec une concaténation non-associative.
Theor. Comput. Sci. 233(1-2): 217-231 (2000) |
1998 |
13 | | Vincent Vajnovszki,
Jean Marcel Pallo:
Parallel Algorithms for Listing Well-Formed Parentheses Strings.
Parallel Processing Letters 8(1): 19-28 (1998) |
1996 |
12 | EE | Christian Germain,
Jean Marcel Pallo:
Two Shortest Path Metrics on Well-Formed Parentheses Strings.
Inf. Process. Lett. 60(6): 283-287 (1996) |
1993 |
11 | | Jean Marcel Pallo:
An Algorithm to Compute the Möbius Function of the Rotation Lattice of Binary Trees.
ITA 27(4): 341-348 (1993) |
1992 |
10 | EE | Jean Marcel Pallo:
Une bijection entre arbres binaires et certaines matrices de Jacobi.
Discrete Mathematics 103(1): 99-101 (1992) |
9 | EE | André Bonnin,
Jean Marcel Pallo:
A shortest path metric on unlabeled binary trees.
Pattern Recognition Letters 13(6): 411-415 (1992) |
1990 |
8 | | Jean Marcel Pallo:
A Distance Metric on Binary Trees Using Lattice-Theoretic Measures.
Inf. Process. Lett. 34(3): 113-116 (1990) |
1989 |
7 | EE | Jean Marcel Pallo:
Lexicographic generation of binary unordered trees.
Pattern Recognition Letters 10(4): 217-221 (1989) |
1988 |
6 | | Jean Marcel Pallo:
Some Properties of the Rotation Lattice of Binary Trees.
Comput. J. 31(6): 564-565 (1988) |
1987 |
5 | | Jean Marcel Pallo:
On the Rotation Distance in the Lattice of Binary Trees.
Inf. Process. Lett. 25(6): 369-374 (1987) |
1986 |
4 | | Jean Marcel Pallo:
Enumerating, Ranking and Unranking Binary Trees.
Comput. J. 29(2): 171-175 (1986) |
1984 |
3 | EE | André Bonnin,
Jean Marcel Pallo:
Sur la generation des arbres binaires par les B-suites.
Discrete Mathematics 51(2): 111-117 (1984) |
1983 |
2 | EE | André Bonnin,
Jean Marcel Pallo:
A-transformation dans les arbres n-aires.
Discrete Mathematics 45(2-3): 153-163 (1983) |
1981 |
1 | | Jean Marcel Pallo:
Word problem in distributed magmas.
Fundam. Inform. 4(4): 957-974 (1981) |