Donatella Merlini

Maple Trans., 2023

2022

Analysing Computer Science Courses over Time.

[BibT_eX]

[DOI]

Maria Cecilia Verri

Data, 2022

2018

Algebraic Generating Functions for Languages Avoiding Riordan Patterns.

[BibT_eX]

[DOI]

Massimo Nocentini

J. Integer Seq., 2018

2017

Corrigendum to "Arithmetic into geometric progressions through Riordan arrays" [Discrete Math. 340(2) (2017) 160-174].

[BibT_eX]

[DOI]

Discret. Math., 2017

Arithmetic into geometric progressions through Riordan arrays.

[BibT_eX]

[DOI]

Discret. Math., 2017

University Student Progressions and First Year Behaviour.

[BibT_eX]

[DOI]

Proceedings of the CSEDU 2017, 2017

2016

A Preprocessing Design Scheme for Sequential Pattern Analysis of a Student Database.

[BibT_eX]

[DOI]

Proceedings of the CSEDU 2016, 2016

2015

Data mining models for student careers.

[BibT_eX]

[DOI]

Expert Syst. Appl., 2015

2014

Complementary Riordan arrays.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

An Analysis of Courses Evaluation Through Clustering.

[BibT_eX]

[DOI]

Maria Cecilia Verri

Proceedings of the Computer Supported Education - 6th International Conference, 2014

Finding Regularities in Courses Evaluation with K-means Clustering.

[BibT_eX]

[DOI]

Proceedings of the CSEDU 2014, 2014

2012

Pattern 1<sup>j+1</sup>0<sup>j</sup> Avoiding Binary Words.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2012

Analyzing paths in a student database.

[BibT_eX]

[DOI]

Proceedings of the 5th International Conference on Educational Data Mining, 2012

2011

Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Smooth movement and Manhattan path based Random Waypoint mobility.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

Binary words avoiding a pattern and marked succession rule

[BibT_eX]

[DOI]

CoRR, 2011

2010

The relevant prefixes of coloured Motzkin walks: An average case analysis.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

2009

Combinatorial sums and implicit Riordan arrays.

[BibT_eX]

[DOI]

Discret. Math., 2009

An algorithm for proving identities with Riordan transformations.

[BibT_eX]

Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

2008

Combinatorial analysis of Tetris-like games.

[BibT_eX]

[DOI]

Davide Baccherini

Discret. Math., 2008

Proper generating trees and their internal path length.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

2007

The Method of Coefficients.

[BibT_eX]

[DOI]

Am. Math. Mon., 2007

Binary words excluding a pattern and proper Riordan arrays.

[BibT_eX]

[DOI]

Davide Baccherini

Discret. Math., 2007

The random generation of derangements.

[BibT_eX]

Proceedings of the Theoretical Computer Science, 10th Italian Conference, 2007

Tablatures for Stringed Instruments and Generating Functions.

[BibT_eX]

[DOI]

Davide Baccherini

Proceedings of the Fun with Algorithms, 4th International Conference, 2007

2006

Combinatorial inversions and implicit Riordan arrays.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

The Cauchy numbers.

[BibT_eX]

[DOI]

Discret. Math., 2006

2004

Waiting patterns for a printer.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

2003

Stirling Numbers for Complex Arguments: Asymptotics and Identities.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2003

Generating functions for the area below some lattice paths.

[BibT_eX]

[DOI]

Proceedings of the Discrete Random Walks, 2003

2002

A strip-like tiling algorithm.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

The Tennis Ball Problem.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2002

Fountains and histograms.

[BibT_eX]

[DOI]

J. Algorithms, 2002

2000

Strip tiling and regular grammars.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Generating trees and proper Riordan Arrays.

[BibT_eX]

[DOI]

Discret. Math., 2000

Modified Binary Searching for Static Tables.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1999

Underdiagonal Lattice Paths with Unrestricted Steps.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

A System for Algorithms' Animation.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Multimedia Computing and Systems, 1999

1998

Left-inversion of combinatorial sums.

[BibT_eX]

[DOI]

Cristiano Corsani

Discret. Math., 1998

Average-Case Analysis for a Simple Compression Algorithm.

[BibT_eX]

[DOI]

Algorithmica, 1998

1997

Stirling Numbers for Complex Arguments.

[BibT_eX]

[DOI]

L. Bruce Richmond

SIAM J. Discret. Math., 1997

1996

A Uniform Model for the Storage Utilization of B-Tree-Like Structures.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1996

The Area Determined by Underdiagonal Lattice Paths.

[BibT_eX]

[DOI]

Proceedings of the Trees in Algebra and Programming, 1996

1994

Algebraic and Combinatorial Properties of Simple, Coloured Walks.

[BibT_eX]

[DOI]