Donatella Merlini

According to our database1, Donatella Merlini authored at least 42 papers between 1994 and 2018.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Algebraic Generating Functions for Languages Avoiding Riordan Patterns.
J. Integer Seq., 2018

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

Arithmetic into geometric progressions through Riordan arrays.
Discret. Math., 2017

University Student Progressions and First Year Behaviour.
Proceedings of the CSEDU 2017, 2017

2016
A Preprocessing Design Scheme for Sequential Pattern Analysis of a Student Database.
Proceedings of the CSEDU 2016, 2016

2015
Data mining models for student careers.
Expert Syst. Appl., 2015

2014
Complementary Riordan arrays.
Discret. Appl. Math., 2014

An Analysis of Courses Evaluation Through Clustering.
Proceedings of the Computer Supported Education - 6th International Conference, 2014

Finding Regularities in Courses Evaluation with K-means Clustering.
Proceedings of the CSEDU 2014, 2014

2012
Pattern 1<sup>j+1</sup>0<sup>j</sup> Avoiding Binary Words.
Fundam. Informaticae, 2012

Analyzing paths in a student database.
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.
Theor. Comput. Sci., 2011

Smooth movement and Manhattan path based Random Waypoint mobility.
Inf. Process. Lett., 2011

Binary words avoiding a pattern and marked succession rule
CoRR, 2011

2010
The relevant prefixes of coloured Motzkin walks: An average case analysis.
Theor. Comput. Sci., 2010

2009
Combinatorial sums and implicit Riordan arrays.
Discret. Math., 2009

An algorithm for proving identities with Riordan transformations.
Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

2008
Combinatorial analysis of Tetris-like games.
Discret. Math., 2008

Proper generating trees and their internal path length.
Discret. Appl. Math., 2008

2007
The Method of Coefficients.
Am. Math. Mon., 2007

Binary words excluding a pattern and proper Riordan arrays.
Discret. Math., 2007

The random generation of derangements.
Proceedings of the Theoretical Computer Science, 10th Italian Conference, 2007

Tablatures for Stringed Instruments and Generating Functions.
Proceedings of the Fun with Algorithms, 4th International Conference, 2007

2006
Combinatorial inversions and implicit Riordan arrays.
Electron. Notes Discret. Math., 2006

The Cauchy numbers.
Discret. Math., 2006

2004
Waiting patterns for a printer.
Discret. Appl. Math., 2004

2003
Stirling Numbers for Complex Arguments: Asymptotics and Identities.
SIAM J. Discret. Math., 2003

Generating functions for the area below some lattice paths.
Proceedings of the Discrete Random Walks, 2003

2002
Modified binary searching for static tables.
Theor. Comput. Sci., 2002

A strip-like tiling algorithm.
Theor. Comput. Sci., 2002

The Tennis Ball Problem.
J. Comb. Theory, Ser. A, 2002

Fountains and histograms.
J. Algorithms, 2002

2000
Strip tiling and regular grammars.
Theor. Comput. Sci., 2000

Generating trees and proper Riordan Arrays.
Discret. Math., 2000

1999
Underdiagonal Lattice Paths with Unrestricted Steps.
Discret. Appl. Math., 1999

A System for Algorithms' Animation.
Proceedings of the IEEE International Conference on Multimedia Computing and Systems, 1999

1998
Left-inversion of combinatorial sums.
Discret. Math., 1998

Average-Case Analysis for a Simple Compression Algorithm.
Algorithmica, 1998

1997
Stirling Numbers for Complex Arguments.
SIAM J. Discret. Math., 1997

1996
A Uniform Model for the Storage Utilization of B-Tree-Like Structures.
Inf. Process. Lett., 1996

The Area Determined by Underdiagonal Lattice Paths.
Proceedings of the Trees in Algebra and Programming, 1996

1994
Algebraic and Combinatorial Properties of Simple, Coloured Walks.
Proceedings of the Trees in Algebra and Programming, 1994


  Loading...