An Algorithmic Approach to the Semantics of Programming Languages. - Gianni Aguzzi; Renzo Pinzani; Renzo Sprugnoli (ICALP, 1972)

Towards an Automatic Generation of Interpreters. - Gianni Aguzzi; Francesca Cesarini; Renzo Pinzani; Giovanni Soda; Renzo Sprugnoli (GI Jahrestagung, 1973)

Tree structures handling by APS. - Gianni Aguzzi; Francesca Cesarini; Renzo Pinzani; Giovanni Soda; Renzo Sprugnoli (Symposium on Programming, 1974)

The Separability of Formal Languages. - Renzo Pinzani; Renzo Sprugnoli (RAIRO Theor. Informatics Appl., 1982)

Index Selection in a Distributed Data Base. - Elena Barcucci; Elisabetta Grazzini; Renzo Pinzani (DDSS, 1984)

A Physical Structure for Efficient Processing of Relational Queries. - Elisabetta Grazzini; Renzo Pinzani; Fabio Pippolini (FODO, 1985)

Index Selection in Relational Databases. - Elena Barcucci; Alessandra Chiuderi; Renzo Pinzani; M. Cecilia Verri (MFDBS, 1989)

On Some Properties of (a, b)-Trees. - Renzo Sprugnoli; Elena Barcucci; Alessandra Chiuderi; Renzo Pinzani (Optimal Algorithms, 1989)

Optimal Selection of Secondary Indexes. - Elena Barcucci; Renzo Pinzani; Renzo Sprugnoli (IEEE Trans. Software Eng., 1990)

A Characterization of Binary Search Networks. - Elena Barcucci; Renzo Pinzani; E. Rodella; Renzo Sprugnoli (FCT, 1991)

Directed Column-Convex Polyominoes by Recurrence Relations. - Elena Barcucci; Renzo Pinzani; Renzo Sprugnoli (TAPSOFT, 1993)

The Random Generation of Directed Animals. - Elena Barcucci; Renzo Pinzani; Renzo Sprugnoli (Theor. Comput. Sci., 1994)

A Construction for Enumerating k-coloured Motzkin Paths. - Elena Barcucci; Alberto Del Lungo; Elisa Pergola; Renzo Pinzani (COCOON, 1995)

The random generation of underdiagonal walks. - Elena Barcucci; Renzo Pinzani; Renzo Sprugnoli (Discret. Math., 1995)

Reconstruction convex polyominoes from horizontal and vertical projections II. - Elena Barcucci; Alberto Del Lungo; Maurice Nivat; Renzo Pinzani (DGCI, 1996)

Foreword/Avant-Propos. - M. Delest; Renzo Pinzani (Discret. Math., 1996)

The number of convex polyominoes reconstructible from their orthogonal projections. - Alberto Del Lungo; Maurice Nivat; Renzo Pinzani (Discret. Math., 1996)

Reconstructing Convex Polyominoes from Horizontal and Vertical Projections. - Elena Barcucci; Alberto Del Lungo; Maurice Nivat; Renzo Pinzani (Theor. Comput. Sci., 1996)

"Deco" Polyominoes, Permutations and Random Generation. - Elena Barcucci; Alberto Del Lungo; Renzo Pinzani (Theor. Comput. Sci., 1996)

Polyominoes Defined by Their Vertical and Horizontal Projections. - Elena Barcucci; Alberto Del Lungo; Renzo Pinzani; Renzo Sprugnoli (Theor. Comput. Sci., 1996)

Reconstructing Digital Sets from X-Rays. - Elena Barcucci; Alberto Del Lungo; Maurice Nivat; Renzo Pinzani; A. Zurli (ICIAP (1), 1997)

Nondecreasing Dyck paths and q-Fibonacci numbers. - Elena Barcucci; Alberto Del Lungo; S. Fezzi; Renzo Pinzani (Discret. Math., 1997)

Steep polyominoes, q-Motzkin numbers and q-Bessel functions. - Elena Barcucci; Alberto Del Lungo; Jean-Marc Fedou; Renzo Pinzani (Discret. Math., 1998)

A methodology for plane tree enumeration. - Elena Barcucci; Alberto Del Lungo; Elisa Pergola; Renzo Pinzani (Discret. Math., 1998)

Medians of polyominoes: A property for reconstruction. - Elena Barcucci; Alberto Del Lungo; Maurice Nivat; Renzo Pinzani (Int. J. Imaging Syst. Technol., 1998)

The Medians of Discrete Sets. - Alberto Del Lungo; Maurice Nivat; Renzo Pinzani; L. Sorri (Inf. Process. Lett., 1998)

A Combinatorial Interpretation of the Area of Schröder Paths. - Elisa Pergola; Renzo Pinzani (Electron. J. Comb., 1999)

Directed animals, forests and permutations. - Elena Barcucci; Alberto Del Lungo; Elisa Pergola; Renzo Pinzani (Discret. Math., 1999)

Avant Propos. - Jacques Mazoyer; Renzo Pinzani; Jean-Guy Penaud (Theor. Comput. Sci., 1999)

From Motzkin to Catalan permutations. - Elena Barcucci; Alberto Del Lungo; Elisa Pergola; Renzo Pinzani (Discret. Math., 2000)

Permutations avoiding an increasing number of length-increasing forbidden subsequences. - Elena Barcucci; Alberto Del Lungo; Elisa Pergola; Renzo Pinzani (Discret. Math. Theor. Comput. Sci., 2000)

A Bijection for Directed-Convex Polyominoes. - Alberto Del Lungo; Massimo Mirolli; Renzo Pinzani; Simone Rinaldi (DM-CCG, 2001)

A Bijection for Some Paths on the Slit Plane. - Elena Barcucci; Elisa Pergola; Renzo Pinzani; Simone Rinaldi (Adv. Appl. Math., 2001)

Some permutations with forbidden subsequences and their inversion number. - Elena Barcucci; Alberto Del Lungo; Elisa Pergola; Renzo Pinzani (Discret. Math., 2001)

Chemins de Schröder et hiérarchies aléatoires. - Jean-Guy Penaud; Elisa Pergola; Renzo Pinzani; Olivier Roques (Theor. Comput. Sci., 2001)

A Bijective Approach to the Area of Generalized Motzkin Paths. - Elisa Pergola; Renzo Pinzani; Simone Rinaldi; Robert A. Sulanke (Adv. Appl. Math., 2002)

Stirling numbers interpolation using permutations with forbidden subsequences. - Gilbert Labelle; Pierre Leroux; Elisa Pergola; Renzo Pinzani (Discret. Math., 2002)

An algebraic characterization of the set of succession rules. - Luca Ferrari 001; Elisa Pergola; Renzo Pinzani; Simone Rinaldi (Theor. Comput. Sci., 2002)

Approximating algebraic functions by means of rational ones. - Elisa Pergola; Renzo Pinzani; Simone Rinaldi (Theor. Comput. Sci., 2002)

Lattice path moments by cut and paste. - Elisa Pergola; Renzo Pinzani; Simone Rinaldi; Robert A. Sulanke (Adv. Appl. Math., 2003)

Jumping succession rules and their generating functions. - Luca Ferrari 001; Elisa Pergola; Renzo Pinzani; Simone Rinaldi (Discret. Math., 2003)

A bijection for the total area of parallelogram polyominoes. - Alberto Del Lungo; Maurice Nivat; Renzo Pinzani; Simone Rinaldi (Discret. Appl. Math., 2004)

A general exhaustive generation algorithm for Gray structures. - Antonio Bernini; Elisabetta Grazzini; Elisa Pergola; Renzo Pinzani (Acta Informatica, 2007)

A Closed Formula for the Number of Convex Permutominoes. - Filippo Disanto; Andrea Frosini; Renzo Pinzani; Simone Rinaldi (Electron. J. Comb., 2007)

Combinatorial properties of Catalan pairs. - Filippo Disanto; Simone Rinaldi; Luca Ferrari 001; Renzo Pinzani (Electron. Notes Discret. Math., 2009)

Enumeration of Some Classes of Words Avoiding Two Generalized Patterns of Length Three. - Antonio Bernini; Luca Ferrari 001; Renzo Pinzani (J. Autom. Lang. Comb., 2009)

Catalan pairs: A relational-theoretic approach to Catalan numbers. - Filippo Disanto; Luca Ferrari 001; Renzo Pinzani; Simone Rinaldi (Adv. Appl. Math., 2010)

Mixed succession rules: The commutative case. - Silvia Bacchelli; Luca Ferrari 001; Renzo Pinzani; Renzo Sprugnoli (J. Comb. Theory A, 2010)

Some applications arising from the interactions between the theory of Catalan-like numbers and the ECO method. - Luca Ferrari 001; Elisa Pergola; Renzo Pinzani; Simone Rinaldi (Ars Comb., 2011)

Binary words avoiding a pattern and marked succession rule - Stefano Bilotta; Donatella Merlini; Elisa Pergola; Renzo Pinzani (CoRR, 2011)

Pattern 1^j0^i avoiding binary words - Stefano Bilotta; Elisa Pergola; Renzo Pinzani (WORDS, 2011)

Generation of binary words avoiding alternating patterns - Stefano Bilotta; Elisabetta Grazzini; Elisa Pergola; Renzo Pinzani (CoRR, 2012)

Pattern 1j+10j Avoiding Binary Words. - Stefano Bilotta; Donatella Merlini; Elisa Pergola; Renzo Pinzani (Fundam. Informaticae, 2012)

A New Approach to Cross-Bifix-Free Sets. - Stefano Bilotta; Elisa Pergola; Renzo Pinzani (IEEE Trans. Inf. Theory, 2012)

Avoiding cross-bifix-free binary words. - Stefano Bilotta; Elisabetta Grazzini; Elisa Pergola; Renzo Pinzani (Acta Informatica, 2013)

Recurrence relations versus succession rules - Stefano Bilotta; Elisa Pergola; Renzo Pinzani; Simone Rinaldi (CoRR, 2013)

Generation and Enumeration of Some Classes of Interval Orders. - Filippo Disanto; Elisa Pergola; Renzo Pinzani; Simone Rinaldi (Order, 2013)

Catalan structures and Catalan pairs. - Stefano Bilotta; Filippo Disanto; Renzo Pinzani; Simone Rinaldi (Theor. Comput. Sci., 2013)

A tiling system for the class of L-convex polyominoes. - Stefano Brocchi; Andrea Frosini; Renzo Pinzani; Simone Rinaldi (Theor. Comput. Sci., 2013)

Prefix partitioned gray codes for particular cross-bifix-free sets. - Antonio Bernini; Stefano Bilotta; Renzo Pinzani; Ahmad Sabri; Vincent Vajnovszki (Cryptogr. Commun., 2014)

The Dyck pattern poset. - Axel Bacher; Antonio Bernini; Luca Ferrari 001; Benjamin Gunby; Renzo Pinzani; Julian West (Discret. Math., 2014)

Gray code orders for q-ary words avoiding a given factor. - Antonio Bernini; Stefano Bilotta; Renzo Pinzani; Ahmad Sabri; Vincent Vajnovszki (Acta Informatica, 2015)

Cross-bifix-free sets generation via Motzkin paths. - Elena Barcucci; Stefano Bilotta; Elisa Pergola; Renzo Pinzani; Jonathan Succi (RAIRO Theor. Informatics Appl., 2016)

A Gray code for cross-bifix-free sets. - Antonio Bernini; Stefano Bilotta; Renzo Pinzani; Vincent Vajnovszki (Math. Struct. Comput. Sci., 2017)

Non-overlapping matrices. - Elena Barcucci; Antonio Bernini; Stefano Bilotta; Renzo Pinzani (Theor. Comput. Sci., 2017)

Cross-bifix-free sets in two dimensions. - Elena Barcucci; Antonio Bernini; Stefano Bilotta; Renzo Pinzani (Theor. Comput. Sci., 2017)

Exhaustive generation of positive lattice paths. - Elena Barcucci; Antonio Bernini; Renzo Pinzani (GASCom, 2018)

A Gray code for a regular language. - Elena Barcucci; Antonio Bernini; Renzo Pinzani (GASCom, 2018)

A 2D non-overlapping code over a q-ary alphabet. - Elena Barcucci; Antonio Bernini; Stefano Bilotta; Renzo Pinzani (Cryptogr. Commun., 2018)

Recurrence relations, succession rules and the positivity problem. - Stefano Bilotta; Elisa Pergola; Renzo Pinzani; Simone Rinaldi (J. Comput. Syst. Sci., 2019)

Strings from Linear Recurrences: A Gray Code. - Elena Barcucci; Antonio Bernini; Renzo Pinzani (WORDS, 2021)

A Strong Non-overlapping Dyck Code. - Elena Barcucci; Antonio Bernini; Renzo Pinzani (DLT, 2021)

Exhaustive generation of some lattice paths and their prefixes. - Elena Barcucci; Antonio Bernini; Renzo Pinzani (Theor. Comput. Sci., 2021)

Strings from linear recurrences and permutations: A Gray code. - Elena Barcucci; Antonio Bernini; Renzo Pinzani (Theor. Comput. Sci., 2022)

A Construction for Variable Dimension Strong Non-Overlapping Matrices. - Elena Barcucci; Antonio Bernini; Stefano Bilotta; Renzo Pinzani (AFL, 2023)

Dyck Paths Enumerated by the Q-bonacci Numbers. - Elena Barcucci; Antonio Bernini; Stefano Bilotta; Renzo Pinzani (GASCom, 2024)

Sequences from Fibonacci to Catalan: A combinatorial interpretation via Dyck paths. - Elena Barcucci; Antonio Bernini; Renzo Pinzani (RAIRO Theor. Informatics Appl., 2024)