default search action
Renzo Pinzani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j54]Elena Barcucci, Antonio Bernini
, Renzo Pinzani:
Sequences from Fibonacci to Catalan: A combinatorial interpretation via Dyck paths. RAIRO Theor. Informatics Appl. 58: 8 (2024) - [c21]Elena Barcucci, Antonio Bernini, Stefano Bilotta, Renzo Pinzani:
Dyck Paths Enumerated by the Q-bonacci Numbers. GASCom 2024: 49-53 - 2023
- [c20]Elena Barcucci, Antonio Bernini, Stefano Bilotta, Renzo Pinzani:
A Construction for Variable Dimension Strong Non-Overlapping Matrices. AFL 2023: 25-34 - 2022
- [j53]Elena Barcucci, Antonio Bernini
Strings from linear recurrences and permutations: A Gray code. Theor. Comput. Sci. 938: 112-120 (2022) - 2021
- [j52]Elena Barcucci, Antonio Bernini, Renzo Pinzani:
Exhaustive generation of some lattice paths and their prefixes. Theor. Comput. Sci. 878-879: 47-52 (2021) - [c19]Elena Barcucci
Strings from Linear Recurrences: A Gray Code. WORDS 2021: 40-49 - [c18]Elena Barcucci
A Strong Non-overlapping Dyck Code. DLT 2021: 43-53
2010 – 2019
- 2019
- [j51]Stefano Bilotta, Elisa Pergola, Renzo Pinzani, Simone Rinaldi
Recurrence relations, succession rules and the positivity problem. J. Comput. Syst. Sci. 104: 102-118 (2019) - 2018
- [j50]Elena Barcucci, Antonio Bernini
A 2D non-overlapping code over a q-ary alphabet. Cryptogr. Commun. 10(4): 667-683 (2018) - [c17]Elena Barcucci, Antonio Bernini, Renzo Pinzani:
Exhaustive generation of positive lattice paths. GASCom 2018: 79-86 - [c16]Elena Barcucci, Antonio Bernini, Renzo Pinzani:
A Gray code for a regular language. GASCom 2018: 87-93 - 2017
- [j49]Antonio Bernini
A Gray code for cross-bifix-free sets. Math. Struct. Comput. Sci. 27(2): 184-196 (2017) - [j48]Elena Barcucci
Non-overlapping matrices. Theor. Comput. Sci. 658: 36-45 (2017) - [j47]Elena Barcucci, Antonio Bernini
Cross-bifix-free sets in two dimensions. Theor. Comput. Sci. 664: 29-38 (2017) - 2016
- [j46]Elena Barcucci, Stefano Bilotta, Elisa Pergola, Renzo Pinzani, Jonathan Succi:
Cross-bifix-free sets generation via Motzkin paths. RAIRO Theor. Informatics Appl. 50(1): 81-91 (2016) - [i9]Elena Barcucci, Antonio Bernini, Stefano Bilotta, Renzo Pinzani:
Non-overlapping matrices. CoRR abs/1601.07723 (2016) - 2015
- [j45]Antonio Bernini
Gray code orders for q-ary words avoiding a given factor. Acta Informatica 52(7-8): 573-592 (2015) - [c15]Stefano Bilotta
Recurrence Relations, Succession Rules, and the Positivity Problem. LATA 2015: 499-510 - [i8]Elena Barcucci, Antonio Bernini, Stefano Bilotta, Renzo Pinzani:
Cross-bifix-free sets in two dimensions. CoRR abs/1502.05275 (2015) - 2014
- [j44]Antonio Bernini
Prefix partitioned gray codes for particular cross-bifix-free sets. Cryptogr. Commun. 6(4): 359-369 (2014) - [j43]Axel Bacher, Antonio Bernini
The Dyck pattern poset. Discret. Math. 321: 12-23 (2014) - [i7]Antonio Bernini, Stefano Bilotta, Renzo Pinzani, Vincent Vajnovszki:
A Gray Code for cross-bifix-free sets. CoRR abs/1401.4650 (2014) - [i6]Antonio Bernini, Stefano Bilotta, Renzo Pinzani, Ahmad Sabri, Vincent Vajnovszki:
Gray code orders for $q$-ary words avoiding a given factor. CoRR abs/1404.0823 (2014) - 2013
- [j42]Stefano Bilotta
Avoiding cross-bifix-free binary words. Acta Informatica 50(3): 157-173 (2013) - [j41]Filippo Disanto, Elisa Pergola, Renzo Pinzani, Simone Rinaldi
Generation and Enumeration of Some Classes of Interval Orders. Order 30(2): 663-676 (2013) - [j40]Stefano Brocchi, Andrea Frosini, Renzo Pinzani, Simone Rinaldi
A tiling system for the class of L-convex polyominoes. Theor. Comput. Sci. 475: 73-81 (2013) - [j39]Stefano Bilotta
Catalan structures and Catalan pairs. Theor. Comput. Sci. 502: 239-248 (2013) - [i5]Stefano Bilotta, Elisa Pergola, Renzo Pinzani, Simone Rinaldi:
Recurrence relations versus succession rules. CoRR abs/1301.2967 (2013) - 2012
- [j38]Stefano Bilotta
Pattern 1j+10j Avoiding Binary Words. Fundam. Informaticae 117(1-4): 35-55 (2012) - [j37]Stefano Bilotta
A New Approach to Cross-Bifix-Free Sets. IEEE Trans. Inf. Theory 58(6): 4058-4063 (2012) - [i4]Stefano Bilotta, Elisabetta Grazzini, Elisa Pergola, Renzo Pinzani:
Generation of binary words avoiding alternating patterns. CoRR abs/1210.7620 (2012) - 2011
- [j36]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: 109-128 (2011) - [c14]Stefano Bilotta, Elisa Pergola, Renzo Pinzani:
Pattern 1^j0^i avoiding binary words. WORDS 2011: 53-64 - [i3]Stefano Bilotta, Donatella Merlini, Elisa Pergola, Renzo Pinzani:
Binary words avoiding a pattern and marked succession rule. CoRR abs/1103.5689 (2011) - [i2]Stefano Bilotta, Elisa Pergola, Renzo Pinzani:
A new approach to cross-bifix-free sets. CoRR abs/1112.3168 (2011) - 2010
- [j35]Filippo Disanto, Luca Ferrari
Catalan pairs: A relational-theoretic approach to Catalan numbers. Adv. Appl. Math. 45(4): 505-517 (2010) - [j34]Silvia Bacchelli, Luca Ferrari
Mixed succession rules: The commutative case. J. Comb. Theory A 117(5): 568-582 (2010) - [i1]Stefano Bilotta, Filippo Disanto, Renzo Pinzani, Simone Rinaldi:
Catalan structures and Catalan pairs. CoRR abs/1011.3708 (2010)
2000 – 2009
- 2009
- [j33]Filippo Disanto, Simone Rinaldi
Combinatorial properties of Catalan pairs. Electron. Notes Discret. Math. 34: 429-433 (2009) - [j32]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): 129-147 (2009) - 2007
- [j31]Antonio Bernini
A general exhaustive generation algorithm for Gray structures. Acta Informatica 44(5): 361-376 (2007) - [j30]Filippo Disanto, Andrea Frosini, Renzo Pinzani, Simone Rinaldi:
A Closed Formula for the Number of Convex Permutominoes. Electron. J. Comb. 14(1) (2007) - 2004
- [j29]Alberto Del Lungo, Maurice Nivat, Renzo Pinzani, Simone Rinaldi
A bijection for the total area of parallelogram polyominoes. Discret. Appl. Math. 144(3): 291-302 (2004) - 2003
- [j28]Elisa Pergola, Renzo Pinzani, Simone Rinaldi, Robert A. Sulanke:
Lattice path moments by cut and paste. Adv. Appl. Math. 30(1-2): 208-218 (2003) - [j27]Luca Ferrari
Jumping succession rules and their generating functions. Discret. Math. 271(1-3): 29-50 (2003) - 2002
- [j26]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): 580-591 (2002) - [j25]Gilbert Labelle, Pierre Leroux, Elisa Pergola, Renzo Pinzani:
Stirling numbers interpolation using permutations with forbidden subsequences. Discret. Math. 246(1-3): 177-195 (2002) - [j24]Elisa Pergola, Renzo Pinzani, Simone Rinaldi:
Approximating algebraic functions by means of rational ones. Theor. Comput. Sci. 270(1-2): 643-657 (2002) - [j23]Luca Ferrari
An algebraic characterization of the set of succession rules. Theor. Comput. Sci. 281(1-2): 351-367 (2002) - 2001
- [j22]Elena Barcucci, Elisa Pergola, Renzo Pinzani, Simone Rinaldi:
A Bijection for Some Paths on the Slit Plane. Adv. Appl. Math. 26(2): 89-96 (2001) - [j21]Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani:
Some permutations with forbidden subsequences and their inversion number. Discret. Math. 234(1-3): 1-15 (2001) - [j20]Jean-Guy Penaud, Elisa Pergola, Renzo Pinzani, Olivier Roques:
Chemins de Schröder et hiérarchies aléatoires. Theor. Comput. Sci. 255(1-2): 345-361 (2001) - [c13]Alberto Del Lungo, Massimo Mirolli, Renzo Pinzani, Simone Rinaldi:
A Bijection for Directed-Convex Polyominoes. DM-CCG 2001: 133-144 - 2000
- [j19]Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani:
From Motzkin to Catalan permutations. Discret. Math. 217(1-3): 33-49 (2000) - [j18]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): 31-44 (2000)
1990 – 1999
- 1999
- [j17]Elisa Pergola, Renzo Pinzani:
A Combinatorial Interpretation of the Area of Schröder Paths. Electron. J. Comb. 6 (1999) - [j16]Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani:
Directed animals, forests and permutations. Discret. Math. 204(1-3): 41-71 (1999) - [j15]Jacques Mazoyer, Renzo Pinzani, Jean-Guy Penaud:
Avant Propos. Theor. Comput. Sci. 218(2): 217-218 (1999) - 1998
- [j14]Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani:
A methodology for plane tree enumeration. Discret. Math. 180(1-3): 45-64 (1998) - [j13]Elena Barcucci, Alberto Del Lungo, Jean-Marc Fedou, Renzo Pinzani:
Steep polyominoes, q-Motzkin numbers and q-Bessel functions. Discret. Math. 189(1-3): 21-42 (1998) - [j12]Elena Barcucci, Alberto Del Lungo, Maurice Nivat, Renzo Pinzani:
Medians of polyominoes: A property for reconstruction. Int. J. Imaging Syst. Technol. 9(2-3): 69-77 (1998) - [j11]Alberto Del Lungo, Maurice Nivat, Renzo Pinzani, L. Sorri:
The Medians of Discrete Sets. Inf. Process. Lett. 65(6): 293-299 (1998) - 1997
- [j10]Elena Barcucci, Alberto Del Lungo, S. Fezzi, Renzo Pinzani:
Nondecreasing Dyck paths and q-Fibonacci numbers. Discret. Math. 170(1-3): 211-217 (1997) - [c12]Elena Barcucci, Alberto Del Lungo, Maurice Nivat, Renzo Pinzani, A. Zurli:
Reconstructing Digital Sets from X-Rays. ICIAP (1) 1997: 166-173 - 1996
- [j9]M. Delest, Renzo Pinzani:
Foreword/Avant-Propos. Discret. Math. 153(1-3): 1 (1996) - [j8]Alberto Del Lungo, Maurice Nivat, Renzo Pinzani:
The number of convex polyominoes reconstructible from their orthogonal projections. Discret. Math. 157(1-3): 65-78 (1996) - [j7]Elena Barcucci, Alberto Del Lungo, Maurice Nivat, Renzo Pinzani:
Reconstructing Convex Polyominoes from Horizontal and Vertical Projections. Theor. Comput. Sci. 155(2): 321-347 (1996) - [j6]Elena Barcucci, Alberto Del Lungo, Renzo Pinzani:
"Deco" Polyominoes, Permutations and Random Generation. Theor. Comput. Sci. 159(1): 29-42 (1996) - [j5]Elena Barcucci, Alberto Del Lungo, Renzo Pinzani, Renzo Sprugnoli:
Polyominoes Defined by Their Vertical and Horizontal Projections. Theor. Comput. Sci. 159(1): 129-136 (1996) - [c11]Elena Barcucci, Alberto Del Lungo, Maurice Nivat, Renzo Pinzani:
Reconstruction convex polyominoes from horizontal and vertical projections II. DGCI 1996: 295-306 - 1995
- [j4]Elena Barcucci, Renzo Pinzani, Renzo Sprugnoli:
The random generation of underdiagonal walks. Discret. Math. 139(1-3): 3-18 (1995) - [c10]Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani:
A Construction for Enumerating k-coloured Motzkin Paths. COCOON 1995: 254-263 - 1994
- [j3]Elena Barcucci, Renzo Pinzani, Renzo Sprugnoli:
The Random Generation of Directed Animals. Theor. Comput. Sci. 127(2): 333-350 (1994) - 1993
- [c9]Elena Barcucci, Renzo Pinzani, Renzo Sprugnoli:
Directed Column-Convex Polyominoes by Recurrence Relations. TAPSOFT 1993: 282-298 - 1991
- [c8]Elena Barcucci, Renzo Pinzani, E. Rodella, Renzo Sprugnoli:
A Characterization of Binary Search Networks. FCT 1991: 126-135 - 1990
- [j2]Elena Barcucci, Renzo Pinzani, Renzo Sprugnoli:
Optimal Selection of Secondary Indexes. IEEE Trans. Software Eng. 16(1): 32-38 (1990)
1980 – 1989
- 1989
- [c7]Elena Barcucci, Alessandra Chiuderi, Renzo Pinzani, M. Cecilia Verri
Index Selection in Relational Databases. MFDBS 1989: 24-36 - [c6]Renzo Sprugnoli, Elena Barcucci, Alessandra Chiuderi, Renzo Pinzani:
On Some Properties of (a, b)-Trees. Optimal Algorithms 1989: 139-152 - 1985
- [c5]Elisabetta Grazzini, Renzo Pinzani, Fabio Pippolini:
A Physical Structure for Efficient Processing of Relational Queries. FODO 1985: 501-514 - 1984
- [c4]Elena Barcucci, Elisabetta Grazzini, Renzo Pinzani:
Index Selection in a Distributed Data Base. DDSS 1984: 179-187 - 1982
- [j1]Renzo Pinzani, Renzo Sprugnoli:
The Separability of Formal Languages. RAIRO Theor. Informatics Appl. 16(1): 13-31 (1982)
1970 – 1979
- 1974
- [c3]Gianni Aguzzi, Francesca Cesarini, Renzo Pinzani, Giovanni Soda, Renzo Sprugnoli:
Tree structures handling by APS. Symposium on Programming 1974: 120-129 - 1973
- [c2]Gianni Aguzzi, Francesca Cesarini, Renzo Pinzani, Giovanni Soda, Renzo Sprugnoli:
Towards an Automatic Generation of Interpreters. GI Jahrestagung 1973: 94-103 - 1972
- [c1]Gianni Aguzzi, Renzo Pinzani, Renzo Sprugnoli:
An Algorithmic Approach to the Semantics of Programming Languages. ICALP 1972: 147-166
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-06 00:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: