International Journals

Publications

2008

· D. Merlini, R. Sprugnoli, M. C. Verri, "Combinatorial sums and implicit Riordan arrays", accepted for publication on Discrete Mathematics.

· R. Sprugnoli, “Negation of binomial coefficients”, Discrete Mathematics, 308, 5070-5077, 2008. Available on-line at www.sciencedirect.com

· D. Merlini, R. Sprugnoli, M. C. Verri, "Combinatorial sums and implicit Riordan arrays", Discrete Mathematics, 2008, doi:10.1016/j.disc.2007.12.039. Available on-line at http://www.sciencedirect.com.

· D. Baccherini, D. Merlini, R. Sprugnoli, "Level Generating Trees and proprer Riordan arrays", Applicable Analysis and Discrete Mathematics, 2 (1), 69-91, 2008. Available electronically at http://pefmath.etf.bg.ac.yu/

2007

· D. Baccherini, D. Merlini, R. Sprugnoli, "Binary words excluding a pattern and proper Riordan arrays", Discrete Mathematics, 307, 1021-1037, 2007.

· D. Merlini, R. Sprugnoli, M. C. Verri, "The method of coefficients", The American Mathematical Monthly 114, 40-57, January 2007.

· D. Baccherini, D. Merlini, R. Sprugnoli, "Tablatures for Stringed Instruments and Generating Functions", Proceedings of FUN 2007, Lecture Notes in Computer Science 4475, 40-52, 2007.

· D. Merlini, R. Sprugnoli, M. C. Verri, "An analysis of a simple algorithm for random derangements ", Proceedings of ICTCS’07, World Scientific, 139-150, 2007.

· D. Merlini, R. Sprugnoli, "Playing with some identities of Andrews", Journal of Integer Sequences, 10, 07.9.5, 2007.

2006

· D. Merlini, R. Sprugnoli, M. C. Verri, "Lagrange inversion: when and how", Acta Applicandae Mathematicae, 94 (3), 233-249, 2006.

· D. Merlini, R. Sprugnoli, M. C. Verri, "The Cauchy numbers", Discrete Mathematics, 306, 1906-1920, 2006.

· D. Merlini, R. Sprugnoli, M. C. Verri, "Combinatorial inversions and implicit Riordan arrays", Electronic Notes in Discrete Mathematics, 26, 103-110, 2006 (Combinatorics 2006).

· R. Sprugnoli, “Sums of reciprocals of the central binomial coefficients”, Integers, Elect. J. of Combin. Number Theory, 6:A27 (2006).

2005

· D. Merlini, R. Sprugnoli, M. C. Verri, Human and constructive proof of combinatorial identities: an example from Romik, Discrete Mathematics and Theoretical Computer Science, AD, 383-392, 2005 (AofA’05).

· D. Merlini, R. Sprugnoli, M. C. Verri, "The Akiyama - Tanigawa Transformation", Integers: Electronic Journal of Combinatorial Number Theory, 5:A5, 2005.

2004

· D. Merlini, R. Sprugnoli, M.C. Verri, “Waiting patterns for a printer”, Discrete Applied Mathematics, 144, 359-373, 2004.

· D. Merlini, R. Sprugnoli, F. Uncini, C. Verri, "Uniform random generation of (r,s)-Fibonacci tilings", FUN 2004, Paolo Ferragina e Roberto Grossi Editors, Edizioni Plus, Pisa, 220-234, 2004.

2002

· D. Merlini, R. Sprugnoli, "Fountains and histograms", Journal of Algorithms, 44, 159-176, 2002.

· D. Merlini, R. Sprugnoli, M. C. Verri, "The Tennis ball problem", Journal of Combinatorial Theory, Series A 99, 307-344, 2002.

· D. Merlini, R. Sprugnoli, M. C. Verri, "Modified Binary Searching for Static Tables”, Theoretical Computer Science, 285, (1): 73-88, 2002.

· D. Merlini, R. Sprugnoli, M.C. Verri, "A strip-like tiling algorithm", Theoretical Computer Science, 282 (2): 337-352, 2002.

· D. Merlini, R. Sprugnoli, "A Riordan array proof of a curious identity", Integers: Electronic Journal of Combinatorial Number Theory, 2:A08, 2002.

· D. Merlini, R. Sprugnoli, M. C. Verri, "Some statistics on Dyck paths", Journal of Statistical Planning and Inference, 101, 211-227, 2002.

2001

· D. Merlini, R. Sprugnoli, M.C. Verri, "Waiting patterns for a printer", FUN with algorithm'01, Isola d'Elba, 2001.

2000

· D. Merlini, R. Sprugnoli, M.C. Verri, "Strip Tiling and Regular Grammars", Theoretical Computer Science, 242, Issue 1-2, 109-124, 2000.

· D. Merlini, R. Sprugnoli, M. C. Verri, "An algebra for generating trees", in Proceedings of the Colloquium on Mathematics and Computer Science 2000, Versailles, Trends in Mathematics, Mathematics and Computer Science, Birkhäuser, 2000. Slides

· S. Brogelli, D. Merlini, R. Sprugnoli, "Proving a class of hypergeometric ideentities by means of generating functions" Lecture Notes in Computers Science, 12-th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC00), Moscow, Russia, 2000.

· D. Merlini, R. Sprugnoli, M. C. Verri, "Modified Binary Searching for Static Tables", in Proceedings of the 4-th Italian Conference on Algorithms and Complexity (CIAC 2000), Rome (Italy), Lecture Notes In Computer Science 1767, 211-225, 2000.

1999

· D. Merlini, D.G. Rogers, R. Sprugnoli, M.C. Verri, "Underdiagonal Lattice Paths with unrestricted steps", Discrete Applied Mathematics, 91, 197-213, 1999.

· D. Merlini, S. Petruzzi, R. Sprugnoli, M. C. Verri, "A system for algorithms' animation", IEEE Multimedia Systems '99, Florence.

· D. Merlini, R. Sprugnoli, M. C. Verri, "An algebraic-combinatorial approach for studying coloured Dyck-Schroder paths", in Proceedings of "Formal Power Series and Algebraic Combinatorics 1999", Bercelona, 341-352, 1999.

1998

· D. Merlini, R. Sprugnoli, M.C. Verri, "Average Case Analysis for a Simple Compression Algorithm", Algorithmica, 22, 585-599, 1998.

· C. Corsani, D. Merlini, R. Sprugnoli, "Left-inversion of combinatorial sums", Discrete Mathematics, 180, 107-122, 1998.

· D. Merlini, R. Sprugnoli, M. C. Verri, "Lagrange statistics on Dyck paths", Lattice Paths Combinatorics and Applications '98, Wien, Austria, 1998.

· D. Merlini, R. Sprugnoli, M. C. Verri, "A strip-like tiling algorithm", "FUN with algorithm'98, Isola d'Elba, 1998.

1997

· D. Merlini, D.G. Rogers, R. Sprugnoli, M.C. Verri, "On some alternative characterization of Riordan arrays", Canadian Journal of Mathematics, vol. 49 (2) 1997, pp. 301-320.

1996

· D. Merlini, R. Sprugnoli, M.C. Verri, "A uniform model for the storage utilization of B-tree-like structures", Information Processing Letters, 57, 53-58, 1996.

· D. Merlini, R. Sprugnoli, M. C. Verri, "An algebraic approach to solve a class of combinatorial sums", in Proceedings of "Formal Power Series and Algebraic Combinatorics 1996", University of Minnesota, USA, 365-375, 1996.

· D. Merlini, R. Sprugnoli, M.C. Verri, "The area determined by underdiagonal lattice paths", in Proceedings of CAAP'96, Lecture Notes in Computer Science 1059, 59-71, 1996.

· R. Sprugnoli, “Recurrence relations on heaps”, Algorithmica 15, 467-480, 1996.

1995

· D. Merlini, R. Sprugnoli, M. C. Verri, "Asy2dim: a package for finding asymptotics for convolution matrices in Proceedings of "Formal Power Series and Algebraic Combinatorics 1995", Université de Marne-la-Vallée, Francia, 417-422, 1995.

· C. Corsani, D. Merlini, R. Sprugnoli, "Pseudo-inversion of combinatorial sums" , in Proceedings of "Formal Power Series and Algebraic Combinatorics 1995", Université de Marne-la-Vallée, France, 117-125, 1995.

· D. Merlini, R. Sprugnoli, M.C. Verri, "Dimostrazione automatica di una classe di identità combinatorie di tipo ipergeometrico", XV Congresso dell’Unione Matematica Italiana, 1995.

· E. Barcucci, R. Pinzani, R. Sprugnoli, “The random generation of underdiagonal walks”, Discrete Mathematics 139, 3-18, 1995.

· D. Merlini, R. Sprugnoli, M. C. Verri, “Dimostrazione automatica di una classe di identità combinatorie di tipo ipergeometrico”, XV Congresso U.M.I., Padova, 1995.

· R. Sprugnoli, “Riordan arrays and the Abel-Gould identity”, Discrete Mathematics 142, 213-233, 1

1994

· D. Merlini, R. Sprugnoli, M. C. Verri, "Algebraic and combinatorial properties of simple, coloured walks", in Proceedings of CAAP'94, Lecture Notes in Computer Science 787, 218-233, 1994.

· R. Sprugnoli, “Riordan arrays and combinatorial sums”, Discrete Mathematics 132, 267-290, 1994.

· E. Barcucci, R. Pinzani, R. Sprugnoli, “The random generation of directed animals”, Theoretical Computer Science 127, 333-350, 1994.

HOME