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="Rinaldi, S."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Catalan structures and Catalan pairs
S. Bilotta
,
F. Disanto
,
R. Pinzani
,
S. Rinaldi
Theoretical Computer Science
502
, 2013, pp. 239-248
A tiling system for the class of
L
-convex polyominoes
S. Brocchi
,
A. Frosini
,
R. Pinzani
,
S. Rinaldi
Theoretical Computer Science
475
, 2013, pp. 73-81
Enumeration of 4-stack polyominoes
J.M. Fedou
,
A. Frosini
,
S. Rinaldi
Theoretical Computer Science
502
, 2013, pp. 88-97
A reconstruction algorithm for a subclass of instances of the 2-color problem
S. Brocchi
,
A. Frosini
,
S. Rinaldi
Theoretical Computer Science
412
(36), 2011, pp. 4795-4804
Lattices of local two-dimensional languages
F. De Carli
,
A. Frosini
,
S. Rinaldi
,
A. Sorbi
Theoretical Computer Science
410
(27-29), 2009, pp. 2701-2713
Enumeration of
L
-convex polyominoes by rows and columns
G. Castiglione
,
A. Frosini
,
A. Restivo
,
S. Rinaldi
Theoretical Computer Science
347
(1-2), 2005, pp. 336-352
Some bijective results about the area of Schröder paths
L. Ferrari
,
E. Grazzini
,
E. Pergola
,
S. Rinaldi
Theoretical Computer Science
307
(2), 2003, pp. 327-335
Approximating algebraic functions by means of rational ones
E. Pergola
,
R. Pinzani
,
S. Rinaldi
Theoretical Computer Science
270
(1-2), 2002, pp. 643-657
Some linear recurrences and their combinatorial interpretation by means of regular languages
E. Barcucci
,
S. Rinaldi
Theoretical Computer Science
255
(1-2), 2001, pp. 679-686