Elisa Pergola

According to our database1, Elisa Pergola
  • authored at least 36 papers between 1995 and 2016.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

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

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
Posets and permutations in the duplication-loss model: Minimal permutations with d descents.
Theor. Comput. Sci., 2010

2008
Posets and Permutations in the Duplication-Loss Model: Minimal Permutations with d Descents
CoRR, 2008

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

2006
Non uniform random generation of generalized Motzkin paths.
Acta Inf., 2006

2005
In memoriam: Alberto Del Lungo (1965-2003).
Theor. Comput. Sci., 2005

Preface.
Theor. Comput. Sci., 2005

On the equivalence problem for succession rules.
Discrete Mathematics, 2005

2004
Exhaustive generation of combinatorial objects by ECO.
Acta Inf., 2004

2003
Some bijective results about the area of Schröder paths.
Theor. Comput. Sci., 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

Two bijections for the area of Dyck paths.
Discrete Mathematics, 2001

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

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

Enumeration of vexillary involutions which are equal to their mirror/complement.
Discrete Mathematics, 2000

From Motzkin to Catalan permutations.
Discrete Mathematics, 2000

1999
Random Generation of Trees and Other Combinatorial Objects.
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
A methodology for plane tree enumeration.
Discrete Mathematics, 1998

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


  Loading...