Renzo Pinzani

Publication Activity (10 Years)

Years Active: 1972-2024
Publications (10 Years): 16

Top Topics

Top Venues

Theor. Comput. Sci.

Cryptogr. Commun.

Publications

Elena Barcucci, Antonio Bernini, Stefano Bilotta, Renzo Pinzani
Dyck Paths Enumerated by the Q-bonacci Numbers. CoRR (2024)
Elena Barcucci, Antonio Bernini, Renzo Pinzani
Dyck paths. RAIRO Theor. Informatics Appl. 58 (2024)
Elena Barcucci, Antonio Bernini, Stefano Bilotta, Renzo Pinzani
A Construction for Variable Dimension Strong Non-Overlapping Matrices. AFL (2023)
Elena Barcucci, Antonio Bernini, Renzo Pinzani
Strings from linear recurrences and permutations: A Gray code. Theor. Comput. Sci. 938 (2022)
Elena Barcucci, Antonio Bernini, Renzo Pinzani
A Strong Non-overlapping Dyck Code. DLT (2021)
Elena Barcucci, Antonio Bernini, Renzo Pinzani
Exhaustive generation of some lattice paths and their prefixes. Theor. Comput. Sci. (2021)
Elena Barcucci, Antonio Bernini, Renzo Pinzani
Strings from Linear Recurrences: A Gray Code. WORDS (2021)
Stefano Bilotta, Elisa Pergola, Renzo Pinzani, Simone Rinaldi
Recurrence relations, succession rules and the positivity problem. J. Comput. Syst. Sci. 104 (2019)
Elena Barcucci, Antonio Bernini, Renzo Pinzani
A Gray code for a regular language. GASCom (2018)
Elena Barcucci, Antonio Bernini, Renzo Pinzani
Exhaustive generation of positive lattice paths. GASCom (2018)
Elena Barcucci, Antonio Bernini, Stefano Bilotta, Renzo Pinzani
A 2D non-overlapping code over a q-ary alphabet. Cryptogr. Commun. 10 (4) (2018)
Antonio Bernini, Stefano Bilotta, Renzo Pinzani, Vincent Vajnovszki
A Gray code for cross-bifix-free sets. Math. Struct. Comput. Sci. 27 (2) (2017)
Elena Barcucci, Antonio Bernini, Stefano Bilotta, Renzo Pinzani
Cross-bifix-free sets in two dimensions. Theor. Comput. Sci. 664 (2017)
Elena Barcucci, Antonio Bernini, Stefano Bilotta, Renzo Pinzani
Non-overlapping matrices. Theor. Comput. Sci. 658 (2017)
Elena Barcucci, Stefano Bilotta, Elisa Pergola, Renzo Pinzani, Jonathan Succi
Motzkin paths. RAIRO Theor. Informatics Appl. 50 (1) (2016)
Elena Barcucci, Antonio Bernini, Stefano Bilotta, Renzo Pinzani
Non-overlapping matrices. CoRR (2016)
Stefano Bilotta, Elisa Pergola, Renzo Pinzani, Simone Rinaldi
Recurrence Relations, Succession Rules, and the Positivity Problem. LATA (2015)
Antonio Bernini, Stefano Bilotta, Renzo Pinzani, Ahmad Sabri, Vincent Vajnovszki
Gray code orders for q-ary words avoiding a given factor. Acta Informatica 52 (7-8) (2015)
Elena Barcucci, Antonio Bernini, Stefano Bilotta, Renzo Pinzani
Cross-bifix-free sets in two dimensions. CoRR (2015)
Antonio Bernini, Stefano Bilotta, Renzo Pinzani, Vincent Vajnovszki
A Gray Code for cross-bifix-free sets. CoRR (2014)
Antonio Bernini, Stefano Bilotta, Renzo Pinzani, Ahmad Sabri, Vincent Vajnovszki
Gray code orders for $q$-ary words avoiding a given factor. CoRR (2014)
Axel Bacher, Antonio Bernini, Luca Ferrari, Benjamin Gunby, Renzo Pinzani, Julian West
The Dyck pattern poset. Discret. Math. 321 (2014)
Antonio Bernini, Stefano Bilotta, Renzo Pinzani, Ahmad Sabri, Vincent Vajnovszki
Prefix partitioned gray codes for particular cross-bifix-free sets. Cryptogr. Commun. 6 (4) (2014)
Filippo Disanto, Elisa Pergola, Renzo Pinzani, Simone Rinaldi
Generation and Enumeration of Some Classes of Interval Orders. Order 30 (2) (2013)
Stefano Bilotta, Elisabetta Grazzini, Elisa Pergola, Renzo Pinzani
Avoiding cross-bifix-free binary words. Acta Informatica 50 (3) (2013)
Stefano Bilotta, Filippo Disanto, Renzo Pinzani, Simone Rinaldi
Catalan structures and Catalan pairs. Theor. Comput. Sci. 502 (2013)
Stefano Brocchi, Andrea Frosini, Renzo Pinzani, Simone Rinaldi
-convex polyominoes. Theor. Comput. Sci. 475 (2013)
Stefano Bilotta, Elisa Pergola, Renzo Pinzani, Simone Rinaldi
Recurrence relations versus succession rules CoRR (2013)
Stefano Bilotta, Elisa Pergola, Renzo Pinzani
A New Approach to Cross-Bifix-Free Sets. IEEE Trans. Inf. Theory 58 (6) (2012)
Stefano Bilotta, Donatella Merlini, Elisa Pergola, Renzo Pinzani
Avoiding Binary Words. Fundam. Informaticae 117 (1-4) (2012)
Stefano Bilotta, Elisabetta Grazzini, Elisa Pergola, Renzo Pinzani
Generation of binary words avoiding alternating patterns CoRR (2012)
Stefano Bilotta, Donatella Merlini, Elisa Pergola, Renzo Pinzani
Binary words avoiding a pattern and marked succession rule CoRR (2011)
Stefano Bilotta, Elisa Pergola, Renzo Pinzani
A new approach to cross-bifix-free sets CoRR (2011)
Stefano Bilotta, Elisa Pergola, Renzo Pinzani
Pattern 1^j0^i avoiding binary words WORDS (2011)
Luca Ferrari, Elisa Pergola, Renzo Pinzani, Simone Rinaldi
Some applications arising from the interactions between the theory of Catalan-like numbers and the ECO method. Ars Comb. 99 (2011)
Filippo Disanto, Luca Ferrari, Renzo Pinzani, Simone Rinaldi
Catalan pairs: A relational-theoretic approach to Catalan numbers. Adv. Appl. Math. 45 (4) (2010)
Silvia Bacchelli, Luca Ferrari, Renzo Pinzani, Renzo Sprugnoli
Mixed succession rules: The commutative case. J. Comb. Theory, Ser. A 117 (5) (2010)
Stefano Bilotta, Filippo Disanto, Renzo Pinzani, Simone Rinaldi
Catalan structures and Catalan pairs CoRR (2010)
Antonio Bernini, Luca Ferrari, Renzo Pinzani
Enumeration of Some Classes of Words Avoiding Two Generalized Patterns of Length Three. J. Autom. Lang. Comb. 14 (2) (2009)
Filippo Disanto, Simone Rinaldi, Luca Ferrari, Renzo Pinzani
Combinatorial properties of Catalan pairs. Electron. Notes Discret. Math. 34 (2009)
Filippo Disanto, Andrea Frosini, Renzo Pinzani, Simone Rinaldi
A Closed Formula for the Number of Convex Permutominoes. Electron. J. Comb. 14 (1) (2007)
Antonio Bernini, Elisabetta Grazzini, Elisa Pergola, Renzo Pinzani
A general exhaustive generation algorithm for Gray structures. Acta Informatica 44 (5) (2007)
Alberto Del Lungo, Maurice Nivat, Renzo Pinzani, Simone Rinaldi
A bijection for the total area of parallelogram polyominoes. Discret. Appl. Math. 144 (3) (2004)
Luca Ferrari, Elisa Pergola, Renzo Pinzani, Simone Rinaldi
Jumping succession rules and their generating functions. Discret. Math. 271 (1-3) (2003)
Elisa Pergola, Renzo Pinzani, Simone Rinaldi, Robert A. Sulanke
Lattice path moments by cut and paste. Adv. Appl. Math. 30 (1-2) (2003)
Elisa Pergola, Renzo Pinzani, Simone Rinaldi, Robert A. Sulanke
A Bijective Approach to the Area of Generalized Motzkin Paths. Adv. Appl. Math. 28 (3-4) (2002)
Gilbert Labelle, Pierre Leroux, Elisa Pergola, Renzo Pinzani
Stirling numbers interpolation using permutations with forbidden subsequences. Discret. Math. 246 (1-3) (2002)
Luca Ferrari, Elisa Pergola, Renzo Pinzani, Simone Rinaldi
An algebraic characterization of the set of succession rules. Theor. Comput. Sci. 281 (1-2) (2002)
Elisa Pergola, Renzo Pinzani, Simone Rinaldi
Approximating algebraic functions by means of rational ones. Theor. Comput. Sci. 270 (1-2) (2002)
Jean-Guy Penaud, Elisa Pergola, Renzo Pinzani, Olivier Roques
Chemins de Schröder et hiérarchies aléatoires. Theor. Comput. Sci. 255 (1-2) (2001)
Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani
Some permutations with forbidden subsequences and their inversion number. Discret. Math. 234 (1-3) (2001)
Elena Barcucci, Elisa Pergola, Renzo Pinzani, Simone Rinaldi
A Bijection for Some Paths on the Slit Plane. Adv. Appl. Math. 26 (2) (2001)
Alberto Del Lungo, Massimo Mirolli, Renzo Pinzani, Simone Rinaldi
A Bijection for Directed-Convex Polyominoes. DM-CCG (2001)
Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani
From Motzkin to Catalan permutations. Discret. Math. 217 (1-3) (2000)
Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani
Permutations avoiding an increasing number of length-increasing forbidden subsequences. Discret. Math. Theor. Comput. Sci. 4 (1) (2000)
Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani
Directed animals, forests and permutations. Discret. Math. 204 (1-3) (1999)
Elisa Pergola, Renzo Pinzani
A Combinatorial Interpretation of the Area of Schröder Paths. Electron. J. Comb. 6 (1999)
Jacques Mazoyer, Renzo Pinzani, Jean-Guy Penaud
Avant Propos. Theor. Comput. Sci. 218 (2) (1999)
Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani
A methodology for plane tree enumeration. Discret. Math. 180 (1-3) (1998)
Alberto Del Lungo, Maurice Nivat, Renzo Pinzani, L. Sorri
The Medians of Discrete Sets. Inf. Process. Lett. 65 (6) (1998)
Elena Barcucci, Alberto Del Lungo, Maurice Nivat, Renzo Pinzani
Medians of polyominoes: A property for reconstruction. Int. J. Imaging Syst. Technol. 9 (2-3) (1998)
Elena Barcucci, Alberto Del Lungo, Jean-Marc Fedou, Renzo Pinzani
Steep polyominoes, q-Motzkin numbers and q-Bessel functions. Discret. Math. 189 (1-3) (1998)
Elena Barcucci, Alberto Del Lungo, Maurice Nivat, Renzo Pinzani, A. Zurli
Reconstructing Digital Sets from X-Rays. ICIAP (1) (1997)
Elena Barcucci, Alberto Del Lungo, S. Fezzi, Renzo Pinzani
Nondecreasing Dyck paths and q-Fibonacci numbers. Discret. Math. 170 (1-3) (1997)
Elena Barcucci, Alberto Del Lungo, Renzo Pinzani
"Deco" Polyominoes, Permutations and Random Generation. Theor. Comput. Sci. 159 (1) (1996)
M. Delest, Renzo Pinzani
Foreword/Avant-Propos. Discret. Math. 153 (1-3) (1996)
Elena Barcucci, Alberto Del Lungo, Maurice Nivat, Renzo Pinzani
Reconstruction convex polyominoes from horizontal and vertical projections II. DGCI (1996)
Elena Barcucci, Alberto Del Lungo, Renzo Pinzani, Renzo Sprugnoli
Polyominoes Defined by Their Vertical and Horizontal Projections. Theor. Comput. Sci. 159 (1) (1996)
Elena Barcucci, Alberto Del Lungo, Maurice Nivat, Renzo Pinzani
Reconstructing Convex Polyominoes from Horizontal and Vertical Projections. Theor. Comput. Sci. 155 (2) (1996)
Alberto Del Lungo, Maurice Nivat, Renzo Pinzani
The number of convex polyominoes reconstructible from their orthogonal projections. Discret. Math. 157 (1-3) (1996)
Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani
A Construction for Enumerating k-coloured Motzkin Paths. COCOON (1995)
Elena Barcucci, Renzo Pinzani, Renzo Sprugnoli
The random generation of underdiagonal walks. Discret. Math. 139 (1-3) (1995)
Elena Barcucci, Renzo Pinzani, Renzo Sprugnoli
The Random Generation of Directed Animals. Theor. Comput. Sci. 127 (2) (1994)
Elena Barcucci, Renzo Pinzani, Renzo Sprugnoli
Directed Column-Convex Polyominoes by Recurrence Relations. TAPSOFT (1993)
Elena Barcucci, Renzo Pinzani, E. Rodella, Renzo Sprugnoli
A Characterization of Binary Search Networks. FCT (1991)
Elena Barcucci, Renzo Pinzani, Renzo Sprugnoli
Optimal Selection of Secondary Indexes. IEEE Trans. Software Eng. 16 (1) (1990)
Renzo Sprugnoli, Elena Barcucci, Alessandra Chiuderi, Renzo Pinzani
On Some Properties of (a, b)-Trees. Optimal Algorithms (1989)
Elena Barcucci, Alessandra Chiuderi, Renzo Pinzani, M. Cecilia Verri
Index Selection in Relational Databases. MFDBS (1989)
Elisabetta Grazzini, Renzo Pinzani, Fabio Pippolini
A Physical Structure for Efficient Processing of Relational Queries. FODO (1985)
Elena Barcucci, Elisabetta Grazzini, Renzo Pinzani
Index Selection in a Distributed Data Base. DDSS (1984)
Renzo Pinzani, Renzo Sprugnoli
The Separability of Formal Languages. RAIRO Theor. Informatics Appl. 16 (1) (1982)
Gianni Aguzzi, Francesca Cesarini, Renzo Pinzani, Giovanni Soda, Renzo Sprugnoli
Tree structures handling by APS. Symposium on Programming (1974)
Gianni Aguzzi, Francesca Cesarini, Renzo Pinzani, Giovanni Soda, Renzo Sprugnoli
Towards an Automatic Generation of Interpreters. GI Jahrestagung (1973)
Gianni Aguzzi, Renzo Pinzani, Renzo Sprugnoli
An Algorithmic Approach to the Semantics of Programming Languages. ICALP (1972)