Jean Marcel Pallo

According to our database1, Jean Marcel Pallo authored at least 31 papers between 1981 and 2015.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2015
A Motzkin filter in the Tamari lattice.
Discret. Math., 2015

2014
Motzkin subposets and Motzkin geodesics in Tamari lattices.
Inf. Process. Lett., 2014

2010
Root-restricted Kleenean rotations.
Inf. Process. Lett., 2010

2009
Weak associativity and restricted rotation.
Inf. Process. Lett., 2009

Kleene Revisited by Suschkewitsch.
Acta Cybern., 2009

2008
The pruning-grafting lattice of binary trees.
Theor. Comput. Sci., 2008

2007
Nonassociativity à la Kleene.
Proceedings of the Algebraic Informatics, Second International Conference, 2007

2006
The Phagocyte Lattice of Dyck Words.
Order, 2006

Efficient lower and upper bounds of the diagonal-flip distance between triangulations.
Inf. Process. Lett., 2006

Rotational tree structures on binary trees and triangulations.
Acta Cybern., 2006

2003
Right-arm rotation distance between binary trees.
Inf. Process. Lett., 2003

Generating binary trees by Glivenko classes on Tamari lattices.
Inf. Process. Lett., 2003

Matchings in Three Catalan Lattices.
Int. J. Comput. Math., 2003

2002
Linear Languages with a Nonassociative Concatenation.
J. Autom. Lang. Comb., 2002

2001
The Rotation chi-Lattice of Ternary Trees.
Computing, 2001

2000
Langages rationnels définis avec une concaténation non-associative.
Theor. Comput. Sci., 2000

An efficient upper bound of the rotation distance of binary trees.
Inf. Process. Lett., 2000

1998
Parallel Algorithms for Listing Well-Formed Parentheses Strings.
Parallel Process. Lett., 1998

1996
Two Shortest Path Metrics on Well-Formed Parentheses Strings.
Inf. Process. Lett., 1996

The number of coverings in four catalan lattices.
Int. J. Comput. Math., 1996

1993
An Algorithm to Compute the Möbius Function of the Rotation Lattice of Binary Trees.
RAIRO Theor. Informatics Appl., 1993

1992
A shortest path metric on unlabeled binary trees.
Pattern Recognit. Lett., 1992

Une bijection entre arbres binaires et certaines matrices de Jacobi.
Discret. Math., 1992

1990
A Distance Metric on Binary Trees Using Lattice-Theoretic Measures.
Inf. Process. Lett., 1990

1989
Lexicographic generation of binary unordered trees.
Pattern Recognit. Lett., 1989

1988
Some Properties of the Rotation Lattice of Binary Trees.
Comput. J., 1988

1987
On the Rotation Distance in the Lattice of Binary Trees.
Inf. Process. Lett., 1987

1986
Enumerating, Ranking and Unranking Binary Trees.
Comput. J., 1986

1984
Sur la generation des arbres binaires par les B-suites.
Discret. Math., 1984

1983
A-transformation dans les arbres n-aires.
Discret. Math., 1983

1981
Word problem in distributed magmas.
Fundam. Informaticae, 1981


  Loading...