Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Pallo, Jean"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Root-restricted Kleenean rotations
Jean Marcel Pallo
Information Processing Letters
111
(1), 2010, pp. 46-50
Weak associativity and restricted rotation
Jean Marcel Pallo
Information Processing Letters
109
(10), 2009, pp. 514-517
Efficient lower and upper bounds of the diagonal-flip distance between triangulations
Jean-Luc Baril
,
Jean-Marcel Pallo
Information Processing Letters
100
(4), 2006, pp. 131-136
Generating binary trees by Glivenko classes on Tamari lattices
Jean Pallo
Information Processing Letters
85
(5), 2003, pp. 235-238
Right-arm rotation distance between binary trees
Jean Marcel Pallo
Information Processing Letters
87
(4), 2003, pp. 173-177
Langages rationnels définis avec une concaténation non-associative
Christian Germain
,
Jean Pallo
Theoretical Computer Science
233
(1-2), 2000, pp. 217-231
An efficient upper bound of the rotation distance of binary trees
Jean Pallo
Information Processing Letters
73
(3-4), 2000, pp. 87-92
Parallel algorithms for listing well-formed parentheses strings
Vincent Vajnovszki
,
Jean Pallo
Parallel Processing Letters
8
(1), 1998, pp. 19-28
Two shortest path metrics on well-formed parentheses strings
Christian Germain
,
Jean Pallo
Information Processing Letters
60
(6), 1996, pp. 283-287