Elisa Pergola

Publication Activity (10 Years)

Years Active: 1995-2023
Publications (10 Years): 10

Top Topics

Top Venues

Fundam. Informaticae

J. Comput. Syst. Sci.

Publications

Michela Ascolese, Andrea Frosini, Elisa Pergola, Simone Rinaldi
A Heuristic for the P-time Reconstruction of Unique 3-Uniform Hypergraphs from their Degree Sequences. ICTCS (2023)
Niccolò Di Marco, Andrea Frosini, William Lawrence Kocay, Elisa Pergola, Lama Tarsissi
Structure and Complexity of 2-Intersection Graphs of 3-Hypergraphs. Algorithmica 85 (3) (2023)
Robert Cori, Andrea Frosini, Giulia Palma, Elisa Pergola, Simone Rinaldi
On doubly symmetric Dyck words. Theor. Comput. Sci. 896 (2021)
Srecko Brlek, Andrea Frosini, Ilaria Mancini, Elisa Pergola, Simone Rinaldi
Burrows-Wheeler Transform of Words Defined by Morphisms. IWOCA (2019)
Stefano Bilotta, Elisa Pergola, Renzo Pinzani, Simone Rinaldi
Recurrence relations, succession rules and the positivity problem. J. Comput. Syst. Sci. 104 (2019)
Paolo Dulio, Paolo Finotelli, Andrea Frosini, Elisa Pergola, Alice Presenti
Graph Model Simulation of Human Brain's Functional Activity at Resting State by Means of the FD Model. Fundam. Informaticae 163 (1) (2018)
Stefano Bilotta, Elisabetta Grazzini, Elisa Pergola
Pattern Avoiding Languages and Recurrence Relations Interpretation. Fundam. Informaticae 156 (1) (2017)
Elena Barcucci, Stefano Bilotta, Elisa Pergola, Renzo Pinzani, Jonathan Succi
Motzkin paths. RAIRO Theor. Informatics Appl. 50 (1) (2016)
Stefano Bilotta, Elisa Pergola, Renzo Pinzani, Simone Rinaldi
Recurrence Relations, Succession Rules, and the Positivity Problem. LATA (2015)
Stefano Bilotta, Elisabetta Grazzini, Elisa Pergola
Enumeration of Two Particular Sets of Minimal Permutations. J. Integer Seq. 18 (10) (2015)
Filippo Disanto, Elisa Pergola, Renzo Pinzani, Simone Rinaldi
Generation and Enumeration of Some Classes of Interval Orders. Order 30 (2) (2013)
Stefano Bilotta, Elisabetta Grazzini, Elisa Pergola, Renzo Pinzani
Avoiding cross-bifix-free binary words. Acta Informatica 50 (3) (2013)
Stefano Bilotta, Elisa Pergola, Renzo Pinzani, Simone Rinaldi
Recurrence relations versus succession rules CoRR (2013)
Stefano Bilotta, Elisa Pergola, Renzo Pinzani
A New Approach to Cross-Bifix-Free Sets. IEEE Trans. Inf. Theory 58 (6) (2012)
Stefano Bilotta, Donatella Merlini, Elisa Pergola, Renzo Pinzani
Avoiding Binary Words. Fundam. Informaticae 117 (1-4) (2012)
Stefano Bilotta, Elisabetta Grazzini, Elisa Pergola, Renzo Pinzani
Generation of binary words avoiding alternating patterns CoRR (2012)
Stefano Bilotta, Donatella Merlini, Elisa Pergola, Renzo Pinzani
Binary words avoiding a pattern and marked succession rule CoRR (2011)
Stefano Bilotta, Elisa Pergola, Renzo Pinzani
A new approach to cross-bifix-free sets CoRR (2011)
Stefano Bilotta, Elisa Pergola, Renzo Pinzani
Pattern 1^j0^i avoiding binary words WORDS (2011)
Luca Ferrari, Elisa Pergola, Renzo Pinzani, Simone Rinaldi
Some applications arising from the interactions between the theory of Catalan-like numbers and the ECO method. Ars Comb. 99 (2011)
Mathilde Bouvel, Elisa Pergola
Posets and permutations in the duplication-loss model: Minimal permutations with d descents. Theor. Comput. Sci. 411 (26-28) (2010)
Mathilde Bouvel, Elisa Pergola
Posets and Permutations in the Duplication-Loss Model: Minimal Permutations with d Descents CoRR (2008)
Antonio Bernini, Elisabetta Grazzini, Elisa Pergola, Renzo Pinzani
A general exhaustive generation algorithm for Gray structures. Acta Informatica 44 (5) (2007)
Srecko Brlek, Elisa Pergola, Olivier Roques
Non uniform random generation of generalized Motzkin paths. Acta Informatica 42 (8-9) (2006)
Srecko Brlek, Enrica Duchi, Elisa Pergola, Simone Rinaldi
On the equivalence problem for succession rules. Discret. Math. 298 (1-3) (2005)
Elisa Pergola, Simone Rinaldi
Preface. Theor. Comput. Sci. 346 (2-3) (2005)
Elisa Pergola, Simone Rinaldi
In memoriam: Alberto Del Lungo (1965-2003). Theor. Comput. Sci. 346 (2-3) (2005)
Silvia Bacchelli, Elena Barcucci, Elisabetta Grazzini, Elisa Pergola
Exhaustive generation of combinatorial objects by ECO. Acta Informatica 40 (8) (2004)
Luca Ferrari, Elisa Pergola, Renzo Pinzani, Simone Rinaldi
Jumping succession rules and their generating functions. Discret. Math. 271 (1-3) (2003)
Luca Ferrari, Elisabetta Grazzini, Elisa Pergola, Simone Rinaldi
Some bijective results about the area of Schröder paths. Theor. Comput. Sci. 307 (2) (2003)
Elisa Pergola, Renzo Pinzani, Simone Rinaldi, Robert A. Sulanke
Lattice path moments by cut and paste. Adv. Appl. Math. 30 (1-2) (2003)
Elisa Pergola, Renzo Pinzani, Simone Rinaldi, Robert A. Sulanke
A Bijective Approach to the Area of Generalized Motzkin Paths. Adv. Appl. Math. 28 (3-4) (2002)
Gilbert Labelle, Pierre Leroux, Elisa Pergola, Renzo Pinzani
Stirling numbers interpolation using permutations with forbidden subsequences. Discret. Math. 246 (1-3) (2002)
Luca Ferrari, Elisa Pergola, Renzo Pinzani, Simone Rinaldi
An algebraic characterization of the set of succession rules. Theor. Comput. Sci. 281 (1-2) (2002)
Elisa Pergola, Renzo Pinzani, Simone Rinaldi
Approximating algebraic functions by means of rational ones. Theor. Comput. Sci. 270 (1-2) (2002)
Jean-Guy Penaud, Elisa Pergola, Renzo Pinzani, Olivier Roques
Chemins de Schröder et hiérarchies aléatoires. Theor. Comput. Sci. 255 (1-2) (2001)
Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani
Some permutations with forbidden subsequences and their inversion number. Discret. Math. 234 (1-3) (2001)
Elena Barcucci, Elisa Pergola, Renzo Pinzani, Simone Rinaldi
A Bijection for Some Paths on the Slit Plane. Adv. Appl. Math. 26 (2) (2001)
Elisa Pergola
Two bijections for the area of Dyck paths. Discret. Math. 241 (1-3) (2001)
Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani
From Motzkin to Catalan permutations. Discret. Math. 217 (1-3) (2000)
Olivier Guibert, Elisa Pergola
Enumeration of vexillary involutions which are equal to their mirror/complement. Discret. Math. 224 (1-3) (2000)
Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani
Permutations avoiding an increasing number of length-increasing forbidden subsequences. Discret. Math. Theor. Comput. Sci. 4 (1) (2000)
Elena Barcucci, Alberto Del Lungo, Elisa Pergola
Random Generation of Trees and Other Combinatorial Objects. Theor. Comput. Sci. 218 (2) (1999)
Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani
Directed animals, forests and permutations. Discret. Math. 204 (1-3) (1999)
Elisa Pergola, Renzo Pinzani
A Combinatorial Interpretation of the Area of Schröder Paths. Electron. J. Comb. 6 (1999)
Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani
A methodology for plane tree enumeration. Discret. Math. 180 (1-3) (1998)
Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani
A Construction for Enumerating k-coloured Motzkin Paths. COCOON (1995)