_SKIPNAVIGATION
ITA |
ENG
Personale
Recapiti
Pagina Cercachi
Italiano
Pubblicazioni
Insegnamenti
Renzo PINZANI
Ruolo attuale:
Professore Ordinario Emerito
SSD:
INF/01 - Informatica
Afferenza organizzativa:
Dipartimento di SISTEMI E INFORMATICA
Recapiti
renzo.pinzani(AT)unifi.it
Renzo PINZANI
Pubblicazioni
Legenda
Contributo su rivista |
Articolo su libro |
Libro |
Contributo in atti di convegno (proceeding) |
Brevetto |
Curatela |
Altro |
Tesi di Dottorato
Barcucci E.; Bernini A.; Bilotta S.; Pinzani R. (2024). Dyck Paths Enumerated by the Q-bonacci Numbers. In: 13th Conference on Random Generation of Combinatorial Structures. Polyominoes and Tilings, GASCom 2024, fra, 2024, Open Publishing Association, vol. 403, pp. 49-53.
DOI
Accesso ONLINE all'editore
Barcucci E.; Bernini A.; Pinzani R. (2024). Sequences from Fibonacci to Catalan: A combinatorial interpretation via Dyck paths. RAIRO. INFORMATIQUE THEORIQUE ET APPLICATIONS, vol. 58, pp. 0-0, ISSN:0988-3754
DOI
Accesso ONLINE all'editore
Elena Barcucci, Antonio Bernini, Stefano Bilotta, Renzo Pinzani (2023). A Construction for Variable Dimension Strong Non-Overlapping Matrices. In: Automata and Formal Languages, Eger (Ungheria), 5 - 7 Settembre 2023, Zsolt Gazdag, Szabolcs Iván and Gergely Kovásznai, vol. 386, pp. 25-34.
DOI
Accesso ONLINE all'editore
Elena Barcucci, Antonio Bernini, Stefano Bilotta, Renzo Pinzani (2023). Restricting Dyck Paths and 312-Avoiding Permutations. JOURNAL OF INTEGER SEQUENCES, vol. 26, pp. 0-0, ISSN:1530-7638
Accesso ONLINE all'editore
Ferrari, Luca; Giannini, Agnese; Pinzani, Renzo (2022). Classes of Dyck paths associated with numerical semigroups. PURE MATHEMATICS AND APPLICATIONS, vol. 30, pp. 110-119, ISSN:1788-800X
DOI
Barcucci, Elena; Bernini, Antonio; Pinzani, Renzo (2022). Strings from linear recurrences and permutations: A Gray code. THEORETICAL COMPUTER SCIENCE, vol. 938, pp. 112-120, ISSN:0304-3975
DOI
Barcucci, Elena; Bernini, Antonio; Pinzani, Renzo (2022). From the Fibonacci to Pell numbers and beyond via Dyck paths. PURE MATHEMATICS AND APPLICATIONS, vol. 30, pp. 17-22, ISSN:1788-800X
DOI
Elena Barcucci, Antonio Bernini, Stefano Bilotta, Renzo Pinzani (2021). Non-Overlapping Matrices via Dyck Words. ENUMERATIVE COMBINATORICS AND APPLICATIONS., vol. 1, pp. 0-0, ISSN:2710-2335
Accesso ONLINE all'editore
Barcucci, Elena; Bernini, Antonio; Pinzani, Renzo (2021). Exhaustive generation of some lattice paths and their prefixes. THEORETICAL COMPUTER SCIENCE, vol. 878-879, pp. 47-52, ISSN:0304-3975
DOI
Accesso ONLINE all'editore
Barcucci E.; Bernini A.; Pinzani R. (2021). A Strong Non-overlapping Dyck Code. In: 25th International Conference on Developments in Language Theory, DLT 2021, Porto (Portogallo), 16 - 20 Agosto, 2021, Springer Science and Business Media Deutschland GmbH, vol. 12811, pp. 43-53, ISBN:978-3-030-81507-3
DOI
Accesso ONLINE all'editore
Barcucci E.; Bernini A.; Pinzani R. (2021). Strings from Linear Recurrences: A Gray Code. In: 13th International Conference on Combinatorics on Words, WORDS 2021, Rouen (Francia), 13- 17 Settembre 2021, Springer Science and Business Media Deutschland GmbH, vol. 12847, pp. 40-49, ISBN:978-3-030-85087-6
DOI
Bilotta, Stefano; Pergola, Elisa; Pinzani, Renzo; Rinaldi, Simone (2019). Recurrence relations, succession rules and the positivity problem. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, vol. 104, pp. 102-118, ISSN:0022-0000
DOI
Accesso ONLINE all'editore
Barcucci, Elena; Bernini, Antonio; Bilotta, Stefano; Pinzani, Renzo (2018). A 2D non-overlapping code over a q-ary alphabet. CRYPTOGRAPHY AND COMMUNICATIONS, vol. 10, pp. 667-683, ISSN:1936-2447
DOI
Accesso ONLINE all'editore
Elena barcucci, Antonio Bernini, Renzo Pinzani (2018). Exhaustive generation of positive lattice paths. In: GASCom 2018 Random Generation of Combinatorial Structures, Atene (Grecia), 18-20 Giugno 2018, Luca Ferrari, Malvina Vamvakari, vol. 2113, pp. 79-86.
Accesso ONLINE all'editore
Elena Barcucci, Antonio Bernini, Renzo Pinzani (2018). A gray code for a regular language. In: GASCom 2018 Random Generation of Combinatorial Structures, Luca Ferrari, Malvina Vamvakari, vol. 2113, pp. 87-93.
Accesso ONLINE all'editore
Barcucci, Elena; Bernini, Antonio; Bilotta, Stefano; Pinzani, Renzo (2017). Cross-bifix-free sets in two dimensions. THEORETICAL COMPUTER SCIENCE, vol. 664, pp. 29-38, ISSN:0304-3975
DOI
Accesso ONLINE all'editore
Bernini, Antonio; Bilotta, Stefano; Pinzani, Renzo; Vajnovszki, Vincent (2017). A Gray code for cross-bifix-free sets. MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, vol. 27, pp. 184-196, ISSN:0960-1295
DOI
Accesso ONLINE all'editore
Barcucci, Elena; Bernini, Antonio; Bilotta, Stefano; Pinzani, Renzo (2017). Non-overlapping matrices. THEORETICAL COMPUTER SCIENCE, vol. 658, pp. 36-45, ISSN:0304-3975
DOI
Accesso ONLINE all'editore
Barcucci, Elena; Bilotta, Stefano; Pergola, Elisa; Pinzani, Renzo; Succi, Jonathan (2016). Cross-bifix-free sets generation via Motzkin paths. RAIRO. INFORMATIQUE THEORIQUE ET APPLICATIONS, vol. 50, pp. 81-91, ISSN:0988-3754
DOI
Accesso ONLINE all'editore
Stefano Bilotta; Elisa Pergola; Renzo Pinzani; Simone Rinaldi (2015). Recurrence relations, succession rules, and the positivity problem. In: LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, Nizza, Francia, 2 - 6 Marzo 2015, Adrian-Horia Dediu, Enrico Formenti, Carlos Martin-Vide, Bianca Truthe, vol. 8977, pp. 499-510, ISBN:9783319155784
DOI
Accesso ONLINE all'editore
Bernini, Antonio; Bilotta, Stefano; Pergola, Elisa; Pinzani, Renzo (2015). A generating function for bit strings with no Grand Dyck pattern matching. PURE MATHEMATICS AND APPLICATIONS, vol. 25, pp. 30-44, ISSN:1788-800X
DOI
Bernini, A.; Bilotta, S.; Pinzani, R.; Vajnovszki, V. (2015). A trace partitioned Gray code forq-ary generalized Fibonacci strings. JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, vol. 18, pp. 751-761, ISSN:0972-0529
DOI
Bernini, A.; Bilotta, S.; Pinzani, R.; Sabri, A.; Vajnovszki, V. (2015). Gray code orders for q-ary words avoiding a given factor. ACTA INFORMATICA, vol. 52, pp. 573-592, ISSN:0001-5903
DOI
Accesso ONLINE all'editore
Antonio Bernini; Stefano Bilotta; Renzo Pinzani; Ahmad Sabri; Vincent Vajnovszki (2014). Prefix partitioned gray codes for particular cross-bifix-free sets. CRYPTOGRAPHY AND COMMUNICATIONS, vol. 6, pp. 359-369, ISSN:1936-2447
DOI
Accesso ONLINE all'editore
Axel Bacher; Antonio Bernini; Luca Ferrari; Benjamin Gunby; Renzo Pinzani; Julian West (2014). The Dyck pattern poset. DISCRETE MATHEMATICS, vol. 321, pp. 12-23, ISSN:0012-365X
DOI
Stefano Bilotta; Elisa Pergola; Renzo Pinzani; Simone Rinaldi (2014). A positivity condition for C-finite recurrences. In: GASCom 2014, Bertinoro (FC), 23/06/2014 - 25/06/2014, Università degli Studi di Bologna, pp. 1-8.
Antonio Bernini; Stefano Bilotta; Renzo Pinzani; Vincent Vajnovszki (2013). Two Gray codes for q-ary k-generalized Fibonacci strings. In: ICTCS 2013, Palermo, 09/09/2013 - 11/09/2013, Università degli Studi di Palermo, pp. 1-6.
Antonio Bernini; Stefano Bilotta; Elisa Pergola; Renzo Pinzani (2013). Grand Dyck consecutive patterns avoiding binary words. In: Permutation Patterns 2013, Parigi, 01/07/2013 - 05/07/2013, LIX, pp. 23-25.
Filippo Disanto; Elisa Pergola; Renzo Pinzani; Simone Rinaldi (2013). Generation and Enumeration of Some Classes of Interval Orders. ORDER, vol. 30, pp. 663-676, ISSN:0167-8094
DOI
S. Brocchi; A. Frosini; R. Pinzani; S. Rinaldi (2013). A tiling system for the class of L-convex polyominoes. THEORETICAL COMPUTER SCIENCE, pp. 73-81, ISSN:0304-3975
DOI
S. Bilotta; F. Disanto; R. Pinzani; S. Rinaldi (2013). Catalan structures and Catalan pairs. THEORETICAL COMPUTER SCIENCE, vol. 502, pp. 239-248, ISSN:0304-3975
DOI
Antonio Bernini; Luca Ferrari; Renzo Pinzani; Julian West (2013). Pattern-avoiding Dyck paths. In: Formal Power Series and Algebraic Combinatorics 2013, Paris, France, 24-28 giugno 2013, Assoc. Discrete Math. Theor. Comput. Sci., vol. AS, pp. 683-694.
Stefano Bilotta; Elisabetta Grazzini; Elisa Pergola; Renzo Pinzani (2013). Avoiding cross-bifix-free binary words. ACTA INFORMATICA, vol. 50, pp. 157-173, ISSN:0001-5903
DOI
Accesso ONLINE all'editore
F. Disanto; E. Duchi; R. Pinzani; S. Rinaldi (2012). Polyominoes determined by permutations: enumeration via bijections. ANNALS OF COMBINATORICS, vol. 16, pp. 57-75, ISSN:0218-0006
DOI
F. Disanto; L. Ferrari; R. Pinzani; S. Rinaldi (2012). Catalan lattices on series parallel interval orders. In: F. Mueller-Hossein, J. Pallo, J. Stasheff (Eds.). Associahedra, Tamari Lattices, and Related Structures, pp. 323-338, HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY: SPRINGER-VERLAG BERLIN, ISBN:9783034804042.
DOI
S.Bilotta; E.Pergola; R.Pinzani (2012). A new approach to cross-bifix-free sets. IEEE TRANSACTIONS ON INFORMATION THEORY, vol. Volume: 58 Issue: 6, pp. 4058-4063, ISSN:0018-9448
S. Bilotta; D. Merlini; E. Pergola; R. Pinzani (2012). Pattern 1^{j+1}0^j avoiding binary words. FUNDAMENTA INFORMATICAE, vol. 117, pp. 35-55, ISSN:0169-2968
DOI
S. Bilotta; E. Pergola; R. Pinzani (2012). A construction for a class of binary words avoiding 1^j 0^i. PURE MATHEMATICS AND APPLICATIONS, vol. 23, pp. 81-102, ISSN:1218-4586
L. FERRARI; PERGOLA E; PINZANI R; RINALDI S (2011). Some applications arising from the interactions between the theory of Catalan-like numbers and the ECO method. ARS COMBINATORIA, vol. 99, pp. 109-128, ISSN:0381-7032, Charles Babbage Research Centre:PO Box 272, St Norbert Postal Station, Winnipeg Manitoba R3V 1L6 Canada:(204)772-2612, (204)474-8313, EMAIL: stanton@cc.umanitoba.ca:
Bilotta, Stefano; Pergola, Elisa; Pinzani, Renzo (2011). Pattern 1^j 0^i avoiding binary words. In: Words 2011, Praga, Rep. Ceca, 12/09/2011 - 16/09/2011, Petr Ambrož, Štěpán Holub and Zuzana Masáková, vol. 63, pp. 53-64.
DOI
A.Frosini; R.Pinzani; S.Rinaldi; L.Vuillon (2011). Tomographical aspects of 2-convex polyominoes. In: world congress on engineering and technology 2011, Shanghai, IEEE press, pp. 0-0, ISBN:978-1-61284-363-6
S. Bilotta; D. Merlini; E. Pergola; R. Pinzani (2010). Binary words avoiding a pattern and marked succession rule. In: Lattice Path Combinatorics and Applications 2010, Rinaldi Simone, pp. 45-49.
Bacchelli, S.; Ferrari, Luca; Pinzani, Renzo; Sprugnoli, Renzo (2010). Mixed succession rules: the commutative case. JOURNAL OF COMBINATORIAL THEORY. SERIES A, vol. 117, pp. 568-582, ISSN:0097-3165
Disanto, F.; Ferrari, Luca; Pinzani, Renzo; Rinaldi, S. (2010). Catalan pairs: a relational-theoretic approach to Catalan numbers. ADVANCES IN APPLIED MATHEMATICS, vol. 45, pp. 505-517, ISSN:0196-8858
S. Bilotta; F. Disanto; R. Pinzani; S. Rinaldi (2010). Catalan structures and Catalan pairs. In: GASCom 2010, Montreal, Canada, 02/09/2010 - 04/09/2010, Comitato organizzazione congresso, pp. 1-14.
S.Brocchi; A.Frosini; R.Pinzani; S.Rinaldi (2009). On the tiling recognizability of L-convex polyominoes. In: WORDS 2009, WORDS 2009, vol. art. 119, pp. 1-12.
Disanto, F.; Ferrari, Luca; Pinzani, Renzo; Rinaldi, S. (2009). Combinatorial properties of Catalan pairs. In: EuroComb 2009, Bordeaux, Francia, 7-11 settembre 2009, vol. 34, pp. 429-433.
A. Bernini; L. Ferrari; R. Pinzani (2009). Enumeration of some classes of words avoiding two generalized patterns. JOURNAL OF AUTOMATA, LANGUAGES AND COMBINATORICS, vol. 14, pp. 129-147, ISSN:1430-189X
F.DISANTO; A.FROSINI; R.PINZANI; S.RINALDI (2008). The combinatorics of convex permutominoes. SOUTHEAST ASIAN BULLETIN OF MATHEMATICS, vol. 32, pp. 883-912, ISSN:0129-2021
S. Bacchelli; L. Ferrari; R. Pinzani (2008). Mixed succession rules: the commutative case. In: The Thirteenth International Conference on Fibonacci Numbers and Their Applications, Patrasso, Grecia, 7-11 luglio 2008, A. Philippou, pp. 2-2.
I. Fanti; A. Frosini; E. Grazzini; R. Pinzani; S. Rinaldi (2007). CHARACTERIZATION AND ENUMERATION OF SOME CLASSES OF PERMUTOMINOES. PURE MATHEMATICS AND APPLICATIONS, vol. 18 (3-4), pp. 265-290, ISSN:1218-4586
A. BERNINI; F. DISANTO; R. PINZANI; S. RINALDI (2007). Permutations Defining Convex Permutominoes. JOURNAL OF INTEGER SEQUENCES, vol. 10, pp. 1-26, ISSN:1530-7638
F.DISANTO; A. FROSINI; R.PINZANI ; S.RINALDI (2007). A closed formula for the number of convex permutominoes. ELECTRONIC JOURNAL OF COMBINATORICS, vol. 14, pp. 361-376, ISSN:1077-8926
A. BERNINI; E. GRAZZINI; E. PERGOLA; R. PINZANI (2007). A GENERAL EXHAUSTIVE GENERATION ALGORITHM FOR GRAY STRUCTURES. ACTA INFORMATICA, vol. 44(5), pp. 361-376, ISSN:0001-5903
DOI
Accesso ONLINE all'editore
Bernini, Antonio; Ferrari, Luca; Pinzani, Renzo (2007). Enumeration of some classes of words avoiding two generalized patterns of length 3. In: Permutation Patterns 2007, St. Andrews (Scotland), 11-15 giugno 2007, comitato scientifico, pp. 1-2.
I. FANTI; A. FROSINI; E. GRAZZINI; R. PINZANI; S. RINALDI (2006). Polyominoes determined by permutations. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, vol. AG, pp. 381-390, ISSN:1462-7264
Accesso ONLINE all'editore
A. Bernini; L. Ferrari; R. Pinzani (2005). Enumerating permutations avoiding three Babson-Steingrimsson patterns. ANNALS OF COMBINATORICS, vol. 9, pp. 137-162, ISSN:0218-0006
DOI
Ferrari, Luca; Pinzani, Renzo (2005). Lattices of lattice paths. JOURNAL OF STATISTICAL PLANNING AND INFERENCE, vol. 135, pp. 77-92, ISSN:0378-3758
FERRARI L; R. PINZANI (2005). Catalan-like numbers and succession rules. PURE MATHEMATICS AND APPLICATIONS, vol. 16, pp. 229-250, ISSN:1218-4586
R. PINZANI; E. BARCUCCI; M. PONETI (2005). EXHAUSTIVE GENERATION OF SOME REGULAR LANGUAGES BY USING NUMERATION SYSTEMS. In: WORDS, MONTREAL, pp. 119-127.
L. FERRARI; PINZANI R (2004). Catalan-like numbers and succession rules. In: Paths, Permutations and Trees, Tianjin (China), 25-27 febbraio 2004, W. Y. C. Chen, pp. 1-2.
L. Ferrari; R. Pinzani; S. Rinaldi (2004). Enumerative results on integer partitions using the ECO method. In: Third Colloquium on Mathematics and Computer Science, Vienna, Austria, 13-17 settembre 2004, BIRKHÄUSER, pp. 25-36, ISBN:9783764371289
R. PINZANI; A. DEL LUNGO;M. NIVAT;S. RINALDI (2004). A bijection for the total area of parallelogram polyominoes. DISCRETE APPLIED MATHEMATICS, vol. 144, pp. 291-302, ISSN:0166-218X
DOI
E. DUCHI; A. FROSINI; R.PINZANI; S.RINALDI (2003). A note on rational succession rules. JOURNAL OF INTEGER SEQUENCES, vol. 6, pp. ---, ISSN:1530-7638
Ferrari, Luca; Pergola, Elisa; Pinzani, Renzo; Rinaldi, S. (2003). Jumping succession rules and their generating functions. DISCRETE MATHEMATICS, vol. 271, pp. 29-50, ISSN:0012-365X, Elsevier BV:PO Box 211, 1000 AE Amsterdam Netherlands:011 31 20 4853757, 011 31 20 4853642, 011 31 20 4853641, EMAIL: nlinfo-f@elsevier.nl, INTERNET: http://www.elsevier.nl, Fax: 011 31 20 4853598:
R. PINZANI; E. PERGOLA; S. RINALDI; R. SULANKE (2003). Lattice paths moments by cut and paste. ADVANCES IN APPLIED MATHEMATICS, vol. 30, pp. 208-218, ISSN:0196-8858
DOI
S. BRLEK; E. DUCHI; E. PERGOLA; R. PINZANI (2002). BIJECTIVE CONSTRUCTION OF EQUIVALENT ECO-SYSTEMS. In: MATHEMATICS AND COMPUTER SCIENCE, VERSAIILES, Springer, pp. 69-81.
DOI
G. LABELLE; P. LEROUX ; E. PERGOLA; R. PINZANI (2002). Stirling numbers interpolation using permutations with forbidden subsequences. DISCRETE MATHEMATICS, vol. 246, pp. 177-195, ISSN:0012-365X
DOI
E. PERGOLA; R. PINZANI; S. RINALDI; R. SULANKE (2002). A bijective approach to the area of generalized Motzkin paths. ADVANCES IN APPLIED MATHEMATICS, vol. 28, pp. 580-591, ISSN:0196-8858
DOI
L. FERRARI; R. PINZANI (2002). Lattices of lattice paths. In: Lattice Paths Combinatorics and Discrete Distributions 2002, Athens (Greece), 5-7 giugno 2002, Charalambos Charalambides, pp. 22-26.
PERGOLA E.; R. PINZANI; S. RINALDI (2002). Approximating algebraic functions by means of rational ones. THEORETICAL COMPUTER SCIENCE, vol. 270, pp. 643-657, ISSN:0304-3975
DOI
Ferrari, Luca; Pergola, Elisa; Pinzani, Renzo; Rinaldi, S. (2002). An algebraic characterization of the set of succession rules. THEORETICAL COMPUTER SCIENCE, vol. 281, pp. 351-367, ISSN:0304-3975, Elsevier BV:PO Box 211, 1000 AE Amsterdam Netherlands:011 31 20 4853757, 011 31 20 4853642, 011 31 20 4853641, EMAIL: nlinfo-f@elsevier.nl, INTERNET: http://www.elsevier.nl, Fax: 011 31 20 4853598:
Ferrari, Luca; Pinzani, Renzo (2002). A linear operator approach to succession rules. LINEAR ALGEBRA AND ITS APPLICATIONS, vol. 348, pp. 231-246, ISSN:0024-3795, Elsevier Science Incorporated / NY Journals:Madison Square Station, PO Box 882:New York, NY 10159:(212)633-3730, EMAIL: usinfo-f@elsevier.com, INTERNET: http://www.elsevier.com, Fax: (212)633-3680:
R. PINZANI; A. DEL LUNGO; S. RINALDI; M. MIROLLI (2001). A BIJECTION FOR DIRECTED-CONVEX POLYOMINOES. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, vol. CCG, pp. 31-44, ISSN:1462-7264
J. G. PENAUD; E. PERGOLA; R. PINZANI; O. ROQUES (2001). Chemins de Schröder et hiérarchies aléatoires. THEORETICAL COMPUTER SCIENCE, vol. 255, pp. 345-361, ISSN:0304-3975
DOI
E. BARCUCCI; A. DEL LUNGO;M. NIVAT; R. PINZANI (2001). X-rays characterizing some classes of discrete sets. LINEAR ALGEBRA AND ITS APPLICATIONS, vol. 339, pp. 3-21, ISSN:0024-3795
DOI
O. GUIBERT; E. PERGOLA; R. PINZANI (2001). Vexillary involutions are enumerated by Motzkin numbers. ANNALS OF COMBINATORICS, vol. 5, pp. 153-174, ISSN:0218-0006
E. BARCUCCI; E. PERGOLA; R. PINZANI; S. RINALDI (2001). ECO method and hill-free generalized Motzkin paths. SÉMINAIRE LOTHARINGIEN DE COMBINATOIRE, vol. 46, pp. 0-0, ISSN:1286-4889
E. BARCUCCI; A. DEL LUNGO; E. PERGOLA; R. PINZANI (2001). Some permutation with forbidden subsequences and their inversion number. DISCRETE MATHEMATICS, vol. 234, pp. 1-15, ISSN:0012-365X
DOI
E. BARCUCCI; E. PERGOLA; R. PINZANI; S. RINALDI (2001). A Bijection for Some Paths on the Slit Plane. ADVANCES IN APPLIED MATHEMATICS, vol. 26, pp. 89-96, ISSN:0196-8858
DOI
R. PINZANI; A. FROSINI; S. RINALDI (2000). ABOUT HALF THE MIDDLE BINOMIAL COEFFICIENT. PURE MATHEMATICS AND APPLICATIONS, vol. 11, pp. 497-508, ISSN:1218-4586
E. BARCUCCI; A. DEL LUNGO; E. PERGOLA; R. PINZANI (2000). Permutations avoiding an increasing number of length-increasing forbidden subsequences. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, vol. 4, pp. 31-44, ISSN:1365-8050
DOI
E. BARCUCCI; E. PERGOLA; R. PINZANI; S. RINALDI (2000). ECO-systems for Dyck and Schroeder paths. PURE MATHEMATICS AND APPLICATIONS, vol. 11, pp. 401-407, ISSN:1218-4586
E. BARCUCCI; A. DEL LUNGO; E. PERGOLA; R. PINZANI (2000). From Motzkin to Catalan permutations. DISCRETE MATHEMATICS, vol. 217, pp. 33-49, ISSN:0012-365X
E. PERGOLA; R. PINZANI; S. RINALDI (2000). A SET OF WELL-DEFINED OPERATIONS ON SUCCESSION RULES. In: MATHEMATICS AND COMPUTER SCIENCE, VERSAIILES, Springer, pp. 141-152.
DOI
E. PERGOLA; R. PINZANI; J. PENAUD; O. ROQUES (1999). CHEMINS DE SCHRÖDER ET HIÉRARCHIES ALÉATOIRES. In: GASCOM, BORDEUAX, LaBRI, pp. 41-47.
E. PERGOLA; R. PINZANI; G. LABELLE; P. LEROUX (1999). BELL PERMUTATIONS AND STIRLING NUMBERS INTERPOLATION. In: FPSAC, BARCELLONA, Universitat Politecnica de Catalunya, pp. 450-461.
E. BARCUCCI; A. DEL LUNGO; E. PERGOLA; R. PINZANI (1999). Directed animals, forests of trees and permutations. DISCRETE MATHEMATICS, vol. 204, pp. 41-71, ISSN:0012-365X
E. Pergola; R. Pinzani (1999). A COMBINATORIAL INTERPRETATION OF THE AREA OF SCHRÖDER PATHS. ELECTRONIC JOURNAL OF COMBINATORICS, vol. 6, pp. R40 1-R40 12, ISSN:1077-8926
DOI
E. BARCUCCI; A. DEL LUNGO; E. PERGOLA; R. PINZANI (1999). ECO: a methodology for the enumeration of combinatorial objects. JOURNAL OF DIFFERENCE EQUATIONS AND APPLICATIONS, vol. 5, pp. 435-490, ISSN:1023-6198
E. BARCUCCI; A. DEL LUNGO; E. PERGOLA; R. PINZANI (1999). Some combinatorial interpretations of q-analogs of Schröder numbers. ANNALS OF COMBINATORICS, vol. 3, pp. 171-190, ISSN:0218-0006
E. BARCUCCI; A. DEL LUNGO; E. PERGOLA; R. PINZANI (1998). A methodology for plane tree enumeration. DISCRETE MATHEMATICS, vol. 180, pp. 45-64, ISSN:0012-365X
E. BARCUCCI; A. DEL LUNGO; M. NIVAT; R. PINZANI (1998). Medians of polyominoes: a property for the reconstruction. INTERNATIONAL JOURNAL OF IMAGING SYSTEMS AND TECHNOLOGY, vol. 9, pp. 69-77, ISSN:0899-9457
A. DEL LUNGO; M. NIVAT; R. PINZANI; L. SORRI; (1998). The medians of discrete sets. INFORMATION PROCESSING LETTERS, vol. 65, pp. 293-299, ISSN:0020-0190
DOI
E. BARCUCCI; A. DEL LUNGO; E. PERGOLA; R. PINZANI (1998). From C_n to n!: permutations avoiding S_j(j+1)(j+2). In: FPSAC, Toronto, pp. 31-41.
E. BARCUCCI; A. DEL LUNGO; J. M. FEDOU; R. PINZANI (1998). Steep polyominoes, q-Motzkin numbers and q-Bessel functions. DISCRETE MATHEMATICS, vol. 189, pp. 21-42, ISSN:0012-365X
E. BARCUCCI; R. PINZANI; A. DEL LUNGO; S. FEZZI (1997). Nondecreasing Dyck paths and q-Fibonacci numbers. DISCRETE MATHEMATICS, vol. 170, pp. 211-217, ISSN:0012-365X
DOI
E. BARCUCCI; A. DEL LUNGO; M. NIVAT; R. PINZANI; A. ZURLI (1997). Reconstructing digital sets from X-rays. In: ICIAP, Firenze, vol. 1310, pp. 166-173.
E. BARCUCCI; F. BERTOLI; A. DEL LUNGO; R. PINZANI (1997). The average height of directed column-convex polyominoes having square, hexagonal and triangular cells. MATHEMATICAL AND COMPUTER MODELLING, vol. 26, pp. 27-36, ISSN:0895-7177
E. BARCUCCI; A. DEL LUNGO;M. NIVAT; R. PINZANI (1996). Reconstructing convex polyominoes from their vertical and horizontal projections. THEORETICAL COMPUTER SCIENCE, vol. 155, pp. 321-347, ISSN:0304-3975
E. BARCUCCI; A. DEL LUNGO; R. PINZANI; R. SPRUGNOLI (1996). Polyominoes defined by their vertical and horizontal projections. THEORETICAL COMPUTER SCIENCE, vol. 159, pp. 129-136, ISSN:0304-3975
E. BARCUCCI; A. DEL LUNGO; M. NIVAT; R. PINZANI (1996). RECONSTRUCTING CONVEX POLYOMINOES FROM HORIZONTAL AND VERTICAL PROJECTIONS II. In: DGCI, Lyon, vol. 1176, pp. 295-306.
E. BARCUCCI; A. DEL LUNGO; R. PINZANI; S. LANINI; M. MACRI (1996). THE INVERSION NUMBER OF SOME PERMUTATIONS WITH FORBIDDEN SUBSEQUENCES. In: SOCA, pp. 22-32.
E. BARCUCCI; A. DEL LUNGO; S. FEZZI; R. PINZANI (1996). SOME COMBINATORIAL INTERPRETATIONS OF Q-ANALOGUES OF SCHROEDER NUMBERS. In: COMBINATORICS, Assisi, pp. 61-61.
E. BARCUCCI; A. DEL LUNGO; E. PERGOLA; R. PINZANI (1995). A CONSTRUCTION FOR ENUMERATING K-COLORED MOTZKIN PATHS. In: COCOON, pp. 254-263.
E. BARCUCCI; A. DEL LUNGO; E. PERGOLA; R. PINZANI (1995). TOWARDS A METHODOLOGY FOR TREE ENUMERATION. In: FORMAL POWER SERIES AND ALGEBRAIC COMBINATORICS, pp. 53-65.
E. BARCUCCI; A. DEL LUNGO; R. PINZANI (1995). Une série géneratrice pour la hauteur des polyominos dvc. COMPTES RENDUS DE L'ACADÉMIE DES SCIENCES. SÉRIE 1, MATHÉMATIQUE, vol. 321, pp. 259-264, ISSN:0764-4442
E. BARCUCCI; R. PINZANI; R. SPRUGNOLI (1995). The random generation of underdiagonal walks. DISCRETE MATHEMATICS, vol. 139, pp. 3-18, ISSN:0012-365X
E. BARCUCCI; R. PINZANI; R. SPRUGNOLI (1994). The random generation of directed animals. THEORETICAL COMPUTER SCIENCE, vol. 127, pp. 333-350, ISSN:0304-3975
E. BARCUCCI; A. DEL LUNGO; R. PINZANI; R. SPRUGNOLI (1994). DENOMBREMENT DES COUPLES DE VECTEURS DEFINISSANT DES POLYOMINOS. In: JOURNEES INTERNATIONALES POLYOMINOS ET PAVAGE, pp. 128-140.
E. BARCUCCI; A. DEL LUNGO; R. PINZANI; R. SPRUGNOLI (1993). LA HAUTEUR DES POLYOMINOS DIRIGES VERTICALEMENT CONVEXES. In: SEMINAIRE LOTHARINGIEN DE COMBINATOIRE, pp. 5-15.
E. BARCUCCI; R. PINZANI; R. SPRUGNOLI (1993). DIRECTED COLUMN-CONVEX POLYOMINOES BY RECURRENCE RELATIONS. In: TAPSOFT'93, Springer-Verlag, vol. 668, pp. 282-298.
DOI
E. BARCUCCI; R. PINZANI; R. SPRUGNOLI (1992). THE RANDOM GENERATION OF UNDERDIAGONAL WALKS. In: SERIES FORMELLES ET COMBINATOIRE ALGEBRIQUE, pp. 17-32.
E. BARCUCCI; A. CHIUDERI; R. PINZANI; M. VERRI (1991). Index selection in a distributed relational database. COMPUTERS AND ARTIFICIAL INTELLIGENCE, vol. 10, pp. 381-397, ISSN:0232-0274
E. BARCUCCI; R. PINZANI; R. SPRUGNOLI (1991). The Motzkin family. PURE MATHEMATICS AND APPLICATIONS. SER. A, vol. 2, pp. 249-279, ISSN:0866-4943
E. BARCUCCI; R. PINZANI; E. RODELLA; R. SPRUGNOLI (1991). A CHARACTERIZATION OF BINARY SEARCH NETWORKS. In: FCT'91, Gosen (Germania), Springer-Verlag, vol. 529, pp. 126-135.
DOI
E. BARCUCCI; A. CHIUDERI; R. PINZANI; E. RODELLA (1991). OPTIMAL SELECTION OF SECONDARY INDICES IN RELATIONAL DATABASES. In: COMPUTER AND INFORMATION SCIENCES VI, pp. 157-168.
E. BARCUCCI; R. PINZANI; R. SPRUGNOLI (1990). Optimal selection of secondary indexes. IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, vol. 16, pp. 32-38, ISSN:0098-5589
DOI
E. GRAZZINI; R. PINZANI; F. PIPPOLINI (1985). A PHYSICAL STRUCTURE FOR EFFICIENT PROCESSING OF RELATIONAL QUERIES. In: Foundation of Data Organization (FODO), KYOTO, Giugno, pp. 501-514.
R. PINZANI; E. GRAZZINI; E. BARCUCCI (1984). INDEX SELECTION IN A DISTRIBUTED DATA BASE. In: DISTRIBUTED DATA SHARING SYSTEMS, PARMA, Marzo, pp. 179-187.
