Renzo Sprugnoli

According to our database1, Renzo Sprugnoli authored at least 54 papers between 1972 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

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

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

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

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

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

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

Sequence characterization of Riordan arrays.
Discret. Math., 2009

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

2008
Negation of binomial coefficients.
Discret. 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

Automatic resolution rule assignment to multilingual Temporal Expressions using annotated corpora.
Proceedings of the 13th International Symposium on Temporal Representation and Reasoning (TIME 2006), 2006

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

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

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

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

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

Recurrence Relations on Heaps.
Algorithmica, 1996

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

1995
Riordan arrays and the Abel-Gould identity.
Discret. Math., 1995

The random generation of underdiagonal walks.
Discret. Math., 1995

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

Riordan arrays and combinatorial sums.
Discret. Math., 1994

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

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

1992
The Generation of Binary Trees as a Numerical Problem.
J. ACM, 1992

Properties of Binary Trees Related to Position.
Comput. J., 1992

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

On the Approximation of Catalan Numbers and Other Quantities.
Eur. J. Comb., 1990

Counting Labels in Binary Trees.
BIT Comput. Sci. Sect., 1990

1989
The Analysis of a Simple In-Place Merging Algorithm.
J. Algorithms, 1989

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

1983
A Model for Word Processing Systems.
Proceedings of the New Applications of Data Bases, Papers from the Workshop on New Applications of Data Bases held at the ICOD 1983 Meeting, Churchill College, Cambridge, UK, August 30, 1983

1982
The Separability of Formal Languages.
RAIRO Theor. Informatics Appl., 1982

1981
On the Allocation of Binary Trees to Secondary Storage.
BIT Comput. Sci. Sect., 1981

1977
Perfect Hashing Functions: A Single Probe Retrieving Method for Static Sets.
Commun. ACM, 1977

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.
Proceedings of the Automata, 1972


  Loading...