Renzo Pinzani

Theor. Comput. Sci., 2022

2021

Exhaustive generation of some lattice paths and their prefixes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

A Strong Non-overlapping Dyck Code.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 25th International Conference, 2021

Strings from Linear Recurrences: A Gray Code.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 13th International Conference, 2021

2019

Recurrence relations, succession rules and the positivity problem.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2019

2018

A 2D non-overlapping code over a q-ary alphabet.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2018

A Gray code for a regular language.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Random and Exhaustive Generation of Combinatorial Structures, 2018

Exhaustive generation of positive lattice paths.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Random and Exhaustive Generation of Combinatorial Structures, 2018

2017

Cross-bifix-free sets in two dimensions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Non-overlapping matrices.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

A Gray code for cross-bifix-free sets.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2017

2016

Cross-bifix-free sets generation via Motzkin paths.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2016

2015

Gray code orders for q-ary words avoiding a given factor.

[BibT_eX]

[DOI]

Acta Informatica, 2015

2014

The Dyck pattern poset.

[BibT_eX]

[DOI]

Discret. Math., 2014

Prefix partitioned gray codes for particular cross-bifix-free sets.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2014

2013

A tiling system for the class of L-convex polyominoes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Catalan structures and Catalan pairs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Generation and Enumeration of Some Classes of Interval Orders.

[BibT_eX]

[DOI]

Order, 2013

Recurrence relations versus succession rules

[BibT_eX]

[DOI]

CoRR, 2013

Avoiding cross-bifix-free binary words.

[BibT_eX]

[DOI]

Acta Informatica, 2013

2012

A New Approach to Cross-Bifix-Free Sets.

[BibT_eX]

[DOI]

Stefano Bilotta

IEEE Trans. Inf. Theory, 2012

Pattern 1j+10j Avoiding Binary Words.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2012

Generation of binary words avoiding alternating patterns

[BibT_eX]

[DOI]

CoRR, 2012

2011

Pattern 1^j0^i avoiding binary words

[BibT_eX]

[DOI]

Stefano Bilotta

Proceedings of the Proceedings 8th International Conference Words 2011, 2011

Binary words avoiding a pattern and marked succession rule

[BibT_eX]

[DOI]

CoRR, 2011

Some applications arising from the interactions between the theory of Catalan-like numbers and the ECO method.

[BibT_eX]

Ars Comb., 2011

2010

Mixed succession rules: The commutative case.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2010

Catalan pairs: A relational-theoretic approach to Catalan numbers.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2010

2009

Enumeration of Some Classes of Words Avoiding Two Generalized Patterns of Length Three.

[BibT_eX]

[DOI]

Luca Ferrari

J. Autom. Lang. Comb., 2009

Combinatorial properties of Catalan pairs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

2007

A Closed Formula for the Number of Convex Permutominoes.

[BibT_eX]

[DOI]

Electron. J. Comb., 2007

A general exhaustive generation algorithm for Gray structures.

[BibT_eX]

[DOI]

Acta Informatica, 2007

2004

A bijection for the total area of parallelogram polyominoes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

2003

Jumping succession rules and their generating functions.

[BibT_eX]

[DOI]

Discret. Math., 2003

Lattice path moments by cut and paste.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2003

2002

Approximating algebraic functions by means of rational ones.

[BibT_eX]

[DOI]

Simone Rinaldi

Theor. Comput. Sci., 2002

An algebraic characterization of the set of succession rules.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Stirling numbers interpolation using permutations with forbidden subsequences.

[BibT_eX]

[DOI]

Discret. Math., 2002

A Bijective Approach to the Area of Generalized Motzkin Paths.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2002

2001

Chemins de Schröder et hiérarchies aléatoires.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Some permutations with forbidden subsequences and their inversion number.

[BibT_eX]

[DOI]

Discret. Math., 2001

A Bijection for Some Paths on the Slit Plane.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2001

A Bijection for Directed-Convex Polyominoes.

[BibT_eX]

[DOI]

Proceedings of the Discrete Models: Combinatorics, Computation, and Geometry, 2001

2000

Permutations avoiding an increasing number of length-increasing forbidden subsequences.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2000

From Motzkin to Catalan permutations.

[BibT_eX]

[DOI]

Discret. Math., 2000

1999

Avant Propos.

[BibT_eX]

[DOI]

Jacques Mazoyer

Jean-Guy Penaud

Theor. Comput. Sci., 1999

Directed animals, forests and permutations.

[BibT_eX]

[DOI]

Discret. Math., 1999

A Combinatorial Interpretation of the Area of Schröder Paths.

[BibT_eX]

[DOI]

Electron. J. Comb., 1999

1998

The Medians of Discrete Sets.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

Medians of polyominoes: A property for reconstruction.

[BibT_eX]

[DOI]

Int. J. Imaging Syst. Technol., 1998

A methodology for plane tree enumeration.

[BibT_eX]

[DOI]

Discret. Math., 1998

Steep polyominoes, q-Motzkin numbers and q-Bessel functions.

[BibT_eX]

[DOI]

Discret. Math., 1998

1997

Nondecreasing Dyck paths and q-Fibonacci numbers.

[BibT_eX]

[DOI]

Discret. Math., 1997

Reconstructing Digital Sets from X-Rays.

[BibT_eX]

[DOI]

Proceedings of the Image Analysis and Processing, 9th International Conference, 1997

1996

Polyominoes Defined by Their Vertical and Horizontal Projections.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

"Deco" Polyominoes, Permutations and Random Generation.

[BibT_eX]

[DOI]

Alberto Del Lungo

Theor. Comput. Sci., 1996

Reconstructing Convex Polyominoes from Horizontal and Vertical Projections.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

The number of convex polyominoes reconstructible from their orthogonal projections.

[BibT_eX]

[DOI]

Alberto Del Lungo

Maurice Nivat

Discret. Math., 1996

Foreword/Avant-Propos.

[BibT_eX]

[DOI]

M. Delest

Discret. Math., 1996

Reconstruction convex polyominoes from horizontal and vertical projections II.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 1996

1995

The random generation of underdiagonal walks.

[BibT_eX]

[DOI]

Discret. Math., 1995

A Construction for Enumerating k-coloured Motzkin Paths.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994

The Random Generation of Directed Animals.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

1993

Directed Column-Convex Polyominoes by Recurrence Relations.

[BibT_eX]

[DOI]

Proceedings of the TAPSOFT'93: Theory and Practice of Software Development, 1993

1991

A Characterization of Binary Search Networks.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

1990

Optimal Selection of Secondary Indexes.

[BibT_eX]

[DOI]

IEEE Trans. Software Eng., 1990

1989

On Some Properties of (a, b)-Trees.

[BibT_eX]

[DOI]

Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

Index Selection in Relational Databases.

[BibT_eX]

[DOI]

Proceedings of the MFDBS 89, 1989

1985

A Physical Structure for Efficient Processing of Relational Queries.

[BibT_eX]

Elisabetta Grazzini

Fabio Pippolini

Proceedings of the Foundations of Data Organization, 1985

1984

Index Selection in a Distributed Data Base.

[BibT_eX]

Elisabetta Grazzini

Proceedings of the Distributed Data Sharing Systems, 1984

1982

The Separability of Formal Languages.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1982

1974

Tree structures handling by APS.

[BibT_eX]

[DOI]

Proceedings of the Programming Symposium, 1974

1973

Towards an Automatic Generation of Interpreters.

[BibT_eX]

[DOI]

Proceedings of the Gesellschaft für Informatik e.V., 1973

1972

An Algorithmic Approach to the Semantics of Programming Languages.

[BibT_eX]

Gianni Aguzzi