Renzo Pinzani

According to our database1, Renzo Pinzani
  • authored at least 69 papers between 1972 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Cross-bifix-free sets in two dimensions.
Theor. Comput. Sci., 2017

Non-overlapping matrices.
Theor. Comput. Sci., 2017

A Gray code for cross-bifix-free sets.
Mathematical Structures in Computer Science, 2017

2016
Cross-bifix-free sets generation via Motzkin paths.
RAIRO - Theor. Inf. and Applic., 2016

Non-overlapping matrices.
CoRR, 2016

2015
Cross-bifix-free sets in two dimensions.
CoRR, 2015

Gray code orders for q-ary words avoiding a given factor.
Acta Inf., 2015

Recurrence Relations, Succession Rules, and the Positivity Problem.
Proceedings of the Language and Automata Theory and Applications, 2015

2014
The Dyck pattern poset.
Discrete Mathematics, 2014

A Gray Code for cross-bifix-free sets.
CoRR, 2014

Gray code orders for $q$-ary words avoiding a given factor.
CoRR, 2014

Prefix partitioned gray codes for particular cross-bifix-free sets.
Cryptography and Communications, 2014

2013
A tiling system for the class of L-convex polyominoes.
Theor. Comput. Sci., 2013

Catalan structures and Catalan pairs.
Theor. Comput. Sci., 2013

Generation and Enumeration of Some Classes of Interval Orders.
Order, 2013

Recurrence relations versus succession rules
CoRR, 2013

Avoiding cross-bifix-free binary words.
Acta Inf., 2013

2012
A New Approach to Cross-Bifix-Free Sets.
IEEE Trans. Information Theory, 2012

Pattern 1j+10j Avoiding Binary Words.
Fundam. Inform., 2012

Generation of binary words avoiding alternating patterns
CoRR, 2012

2011
A new approach to cross-bifix-free sets
CoRR, 2011

Pattern 1^j0^i avoiding binary words
Proceedings of the Proceedings 8th International Conference Words 2011, 2011

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

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

2010
Mixed succession rules: The commutative case.
J. Comb. Theory, Ser. A, 2010

Catalan structures and Catalan pairs
CoRR, 2010

2009
Enumeration of Some Classes of Words Avoiding Two Generalized Patterns of Length Three.
Journal of Automata, Languages and Combinatorics, 2009

Combinatorial properties of Catalan pairs.
Electronic Notes in Discrete Mathematics, 2009

2007
A Closed Formula for the Number of Convex Permutominoes.
Electr. J. Comb., 2007

A general exhaustive generation algorithm for Gray structures.
Acta Inf., 2007

2004
A bijection for the total area of parallelogram polyominoes.
Discrete Applied Mathematics, 2004

2003
Jumping succession rules and their generating functions.
Discrete Mathematics, 2003

2002
Approximating algebraic functions by means of rational ones.
Theor. Comput. Sci., 2002

An algebraic characterization of the set of succession rules.
Theor. Comput. Sci., 2002

Stirling numbers interpolation using permutations with forbidden subsequences.
Discrete Mathematics, 2002

2001
Chemins de Schröder et hiérarchies aléatoires.
Theor. Comput. Sci., 2001

Some permutations with forbidden subsequences and their inversion number.
Discrete Mathematics, 2001

A Bijection for Directed-Convex Polyominoes.
Proceedings of the Discrete Models: Combinatorics, Computation, and Geometry, 2001

2000
Permutations avoiding an increasing number of length-increasing forbidden subsequences.
Discrete Mathematics & Theoretical Computer Science, 2000

From Motzkin to Catalan permutations.
Discrete Mathematics, 2000

1999
Avant Propos.
Theor. Comput. Sci., 1999

Directed animals, forests and permutations.
Discrete Mathematics, 1999

A Combinatorial Interpretation of the Area of Schröder Paths.
Electr. J. Comb., 1999

1998
The Medians of Discrete Sets.
Inf. Process. Lett., 1998

Medians of polyominoes: A property for reconstruction.
Int. J. Imaging Systems and Technology, 1998

A methodology for plane tree enumeration.
Discrete Mathematics, 1998

Steep polyominoes, q-Motzkin numbers and q-Bessel functions.
Discrete Mathematics, 1998

1997
Nondecreasing Dyck paths and q-Fibonacci numbers.
Discrete Mathematics, 1997

Reconstructing Digital Sets from X-Rays.
Proceedings of the Image Analysis and Processing, 9th International Conference, 1997

1996
Polyominoes Defined by Their Vertical and Horizontal Projections.
Theor. Comput. Sci., 1996

"Deco" Polyominoes, Permutations and Random Generation.
Theor. Comput. Sci., 1996

Reconstructing Convex Polyominoes from Horizontal and Vertical Projections.
Theor. Comput. Sci., 1996

The number of convex polyominoes reconstructible from their orthogonal projections.
Discrete Mathematics, 1996

Foreword/Avant-Propos.
Discrete Mathematics, 1996

Reconstruction convex polyominoes from horizontal and vertical projections II.
Proceedings of the Discrete Geometry for Computer Imagery, 1996

1995
The random generation of underdiagonal walks.
Discrete Mathematics, 1995

A Construction for Enumerating k-coloured Motzkin Paths.
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994
The Random Generation of Directed Animals.
Theor. Comput. Sci., 1994

1993
Directed Column-Convex Polyominoes by Recurrence Relations.
Proceedings of the TAPSOFT'93: Theory and Practice of Software Development, 1993

1991
A Characterization of Binary Search Networks.
Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

1990
Optimal Selection of Secondary Indexes.
IEEE Trans. Software Eng., 1990

1989
On Some Properties of (a, b)-Trees.
Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

Index Selection in Relational Databases.
Proceedings of the MFDBS 89, 1989

1985
A Physical Structure for Efficient Processing of Relational Queries.
FODO, 1985

1984
Index Selection in a Distributed Data Base.
DDSS, 1984

1982
The Separability of Formal Languages.
ITA, 1982

1974
Tree structures handling by APS.
Proceedings of the Programming Symposium, 1974

1973
Towards an Automatic Generation of Interpreters.
Proceedings of the Gesellschaft für Informatik e.V., 1973

1972
An Algorithmic Approach to the Semantics of Programming Languages.
ICALP, 1972


  Loading...