Paolo Massazza

A CAT algorithm for the exhaustive generation of ice piles

We present a CAT (constant amortized time) algorithm for generating those partitions of n that are in the ice pile model

On a class of languages with holonomic generating functions

\mbox{IPM}_k

An Efficient Algorithm for the Generation of Z-Convex Polyominoes

( n ), a generalization of the sand pile model

Smooth sand piles

\mbox{SPM}

On the exhaustive generation of k-convex polyominoes

( n ). More precisely, for any fixed integer k , we show that the negative lexicographic ordering naturally identifies a tree structure on the lattice

An efficient algorithm for generating symmetric ice piles

\mbox{IPM}_k

On computing the coefficients of bivariate holonomic formal series

( n ): this lets us design an algorithm which generates all the ice piles of

On the exhaustive generation of plane partitions

\mbox{IPM}_k

A New Sandpile Model with Smoothness Assumptions

( n ) in amortized time O (1) and in space O (

From Models to Languages

\sqrt n