Paolo Massazza

According to our database1, Paolo Massazza authored at least 31 papers between 1986 and 2022.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
On Counting k-Convex Polyominoes.
Proceedings of the 23rd Italian Conference on Theoretical Computer Science, 2022

2021
A Dynamical System Approach to Polyominoes Generation.
Fundam. Informaticae, 2021

Partially Directed Animals with a Bounded Number of Holes.
Proceedings of the Language and Automata Theory and Applications, 2021

On Counting L-Convex Polyominoes.
Proceedings of the 22nd Italian Conference on Theoretical Computer Science, 2021

2019
Hole-Free Partially Directed Animals.
Proceedings of the Developments in Language Theory - 23rd International Conference, 2019

2018
On the Generating Functions of Languages Accepted by Deterministic One-reversal Counter Machines.
Proceedings of the 19th Italian Conference on Theoretical Computer Science, 2018

On the Generation of 2-Polyominoes.
Proceedings of the Descriptional Complexity of Formal Systems, 2018

2017
On a class of languages with holonomic generating functions.
Theor. Comput. Sci., 2017

On the exhaustive generation of k-convex polyominoes.
Theor. Comput. Sci., 2017

From Tetris to polyominoes generation.
Electron. Notes Discret. Math., 2017

On the Conjecture ℒ<sub><i>DFCM</i></sub> ⊊ <i>RCM</i>.
Proceedings of the Implementation and Application of Automata, 2017

2016
An efficient algorithm for generating symmetric ice piles.
Theor. Comput. Sci., 2016

A New Sandpile Model with Smoothness Assumptions.
Fundam. Informaticae, 2016

2015
On the generation of convex polyominoes.
Discret. Appl. Math., 2015

On Computing the Degree of Convexity of Polyominoes.
Electron. J. Comb., 2015

2014
From Models to Languages.
Fundam. Informaticae, 2014

An Efficient Algorithm for the Generation of Z-Convex Polyominoes.
Proceedings of the Combinatorial Image Analysis - 16th International Workshop, 2014

2013
On the exhaustive generation of plane partitions.
Theor. Comput. Sci., 2013

2012
Smooth Sand Piles.
Proceedings of the Reachability Problems - 6th International Workshop, 2012

2011
From Linear Partitions to Parallelogram Polyominoes.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

2010
A CAT algorithm for the exhaustive generation of ice piles.
RAIRO Theor. Informatics Appl., 2010

2006
On the simplest centralizer of a language.
RAIRO Theor. Informatics Appl., 2006

2005
On computing the coefficients of bivariate holonomic formal series.
Theor. Comput. Sci., 2005

The Inclusion Problem for Unambiguous Rational Trace Languages.
Proceedings of the Developments in Language Theory, 9th International Conference, 2005

2001
On the Root of Languages.
Int. J. Algebra Comput., 2001

1998
On the Inclusion Problem for Finitely Ambiguous Rational Trace Languages.
RAIRO Theor. Informatics Appl., 1998

1994
A Parallel Algorithm for the Hadamard Product of Holonomic Formal Series.
Int. J. Algebra Comput., 1994

1993
Holonomic Functions and Their Relation to Linearly Constrained Languages.
RAIRO Theor. Informatics Appl., 1993

1992
Holonomic Generating Functions and Context Free Languages.
Int. J. Found. Comput. Sci., 1992

1990
Counting Problems and Algebraic Formal Power Series in Noncommuting Variables.
Inf. Process. Lett., 1990

1986
A Symbolic Manipulation System for Combinatorial Problems.
Proceedings of the Applied Algebra, 1986


  Loading...