default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElisa Pergola
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j38]Michela Ascolese
, Andrea Frosini, Elisa Pergola, Simone Rinaldi, Laurent Vuillon:
An algebraic approach to the reconstruction of uniform hypergraphs from their degree sequence. Theor. Comput. Sci. 1020: 114872 (2024)- 2023
- [j37]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): 745-761 (2023) - 2021
- [j36]Robert Cori, Andrea Frosini, Giulia Palma, Elisa Pergola, Simone Rinaldi:
On doubly symmetric Dyck words. Theor. Comput. Sci. 896: 79-97 (2021) - 2019
- [j35]Stefano Bilotta, Elisa Pergola, Renzo Pinzani, Simone Rinaldi:
Recurrence relations, succession rules and the positivity problem. J. Comput. Syst. Sci. 104: 102-118 (2019) - 2018
- [j34]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): 93-109 (2018) - 2017
- [j33]Stefano Bilotta, Elisabetta Grazzini, Elisa Pergola:
Pattern Avoiding Languages and Recurrence Relations Interpretation. Fundam. Informaticae 156(1): 1-19 (2017) - 2016
- [j32]Elena Barcucci, Stefano Bilotta, Elisa Pergola, Renzo Pinzani, Jonathan Succi:
Cross-bifix-free sets generation via Motzkin paths. RAIRO Theor. Informatics Appl. 50(1): 81-91 (2016) - 2015
- [j31]Stefano Bilotta, Elisabetta Grazzini, Elisa Pergola:
Enumeration of Two Particular Sets of Minimal Permutations. J. Integer Seq. 18(10): 15.10.2 (2015) - 2013
- [j30]Stefano Bilotta, Elisabetta Grazzini, Elisa Pergola, Renzo Pinzani:
Avoiding cross-bifix-free binary words. Acta Informatica 50(3): 157-173 (2013) - [j29]Filippo Disanto, Elisa Pergola, Renzo Pinzani, Simone Rinaldi:
Generation and Enumeration of Some Classes of Interval Orders. Order 30(2): 663-676 (2013) - 2012
- [j28]Stefano Bilotta, Donatella Merlini, Elisa Pergola, Renzo Pinzani:
Pattern 1j+10j Avoiding Binary Words. Fundam. Informaticae 117(1-4): 35-55 (2012) - [j27]Stefano Bilotta, Elisa Pergola, Renzo Pinzani:
A New Approach to Cross-Bifix-Free Sets. IEEE Trans. Inf. Theory 58(6): 4058-4063 (2012) - 2011
- [j26]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: 109-128 (2011) - 2010
- [j25]Mathilde Bouvel, Elisa Pergola:
Posets and permutations in the duplication-loss model: Minimal permutations with d descents. Theor. Comput. Sci. 411(26-28): 2487-2501 (2010) - 2007
- [j24]Antonio Bernini, Elisabetta Grazzini, Elisa Pergola, Renzo Pinzani:
A general exhaustive generation algorithm for Gray structures. Acta Informatica 44(5): 361-376 (2007) - 2006
- [j23]Srecko Brlek, Elisa Pergola, Olivier Roques:
Non uniform random generation of generalized Motzkin paths. Acta Informatica 42(8-9): 603-616 (2006) - 2005
- [j22]Srecko Brlek, Enrica Duchi, Elisa Pergola, Simone Rinaldi:
On the equivalence problem for succession rules. Discret. Math. 298(1-3): 142-154 (2005) - [j21]Elisa Pergola, Simone Rinaldi:
Preface. Theor. Comput. Sci. 346(2-3): 183 (2005) - [j20]Elisa Pergola, Simone Rinaldi:
In memoriam: Alberto Del Lungo (1965-2003). Theor. Comput. Sci. 346(2-3): 184-188 (2005) - 2004
- [j19]Silvia Bacchelli, Elena Barcucci, Elisabetta Grazzini, Elisa Pergola:
Exhaustive generation of combinatorial objects by ECO. Acta Informatica 40(8): 585-602 (2004) - 2003
- [j18]Elisa Pergola, Renzo Pinzani, Simone Rinaldi, Robert A. Sulanke:
Lattice path moments by cut and paste. Adv. Appl. Math. 30(1-2): 208-218 (2003) - [j17]Luca Ferrari, Elisa Pergola, Renzo Pinzani, Simone Rinaldi:
Jumping succession rules and their generating functions. Discret. Math. 271(1-3): 29-50 (2003) - [j16]Luca Ferrari, Elisabetta Grazzini, Elisa Pergola, Simone Rinaldi:
Some bijective results about the area of Schröder paths. Theor. Comput. Sci. 307(2): 327-335 (2003) - 2002
- [j15]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): 580-591 (2002) - [j14]Gilbert Labelle, Pierre Leroux, Elisa Pergola, Renzo Pinzani:
Stirling numbers interpolation using permutations with forbidden subsequences. Discret. Math. 246(1-3): 177-195 (2002) - [j13]Elisa Pergola, Renzo Pinzani, Simone Rinaldi:
Approximating algebraic functions by means of rational ones. Theor. Comput. Sci. 270(1-2): 643-657 (2002) - [j12]Luca Ferrari, Elisa Pergola, Renzo Pinzani, Simone Rinaldi:
An algebraic characterization of the set of succession rules. Theor. Comput. Sci. 281(1-2): 351-367 (2002) - 2001
- [j11]Elena Barcucci, Elisa Pergola, Renzo Pinzani, Simone Rinaldi:
A Bijection for Some Paths on the Slit Plane. Adv. Appl. Math. 26(2): 89-96 (2001) - [j10]Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani:
Some permutations with forbidden subsequences and their inversion number. Discret. Math. 234(1-3): 1-15 (2001) - [j9]Elisa Pergola:
Two bijections for the area of Dyck paths. Discret. Math. 241(1-3): 435-447 (2001) - [j8]Jean-Guy Penaud, Elisa Pergola, Renzo Pinzani, Olivier Roques:
Chemins de Schröder et hiérarchies aléatoires. Theor. Comput. Sci. 255(1-2): 345-361 (2001) - 2000
- [j7]Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani:
From Motzkin to Catalan permutations. Discret. Math. 217(1-3): 33-49 (2000) - [j6]Olivier Guibert, Elisa Pergola:
Enumeration of vexillary involutions which are equal to their mirror/complement. Discret. Math. 224(1-3): 281-287 (2000) - [j5]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): 31-44 (2000) - 1999
- [j4]Elisa Pergola, Renzo Pinzani:
A Combinatorial Interpretation of the Area of Schröder Paths. Electron. J. Comb. 6 (1999) - [j3]Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani:
Directed animals, forests and permutations. Discret. Math. 204(1-3): 41-71 (1999) - [j2]Elena Barcucci, Alberto Del Lungo, Elisa Pergola:
Random Generation of Trees and Other Combinatorial Objects. Theor. Comput. Sci. 218(2): 219-232 (1999) - 1998
- [j1]Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani:
A methodology for plane tree enumeration. Discret. Math. 180(1-3): 45-64 (1998)
Conference and Workshop Papers
- 2023
- [c5]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: 77-91 - 2019
- [c4]Srecko Brlek, Andrea Frosini, Ilaria Mancini, Elisa Pergola, Simone Rinaldi:
Burrows-Wheeler Transform of Words Defined by Morphisms. IWOCA 2019: 393-404 - 2015
- [c3]Stefano Bilotta, Elisa Pergola, Renzo Pinzani, Simone Rinaldi:
Recurrence Relations, Succession Rules, and the Positivity Problem. LATA 2015: 499-510 - 2011
- [c2]Stefano Bilotta, Elisa Pergola, Renzo Pinzani:
Pattern 1^j0^i avoiding binary words. WORDS 2011: 53-64 - 1995
- [c1]Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani:
A Construction for Enumerating k-coloured Motzkin Paths. COCOON 1995: 254-263
Informal and Other Publications
- 2013
- [i5]Stefano Bilotta, Elisa Pergola, Renzo Pinzani, Simone Rinaldi:
Recurrence relations versus succession rules. CoRR abs/1301.2967 (2013) - 2012
- [i4]Stefano Bilotta, Elisabetta Grazzini, Elisa Pergola, Renzo Pinzani:
Generation of binary words avoiding alternating patterns. CoRR abs/1210.7620 (2012) - 2011
- [i3]Stefano Bilotta, Donatella Merlini, Elisa Pergola, Renzo Pinzani:
Binary words avoiding a pattern and marked succession rule. CoRR abs/1103.5689 (2011) - [i2]Stefano Bilotta, Elisa Pergola, Renzo Pinzani:
A new approach to cross-bifix-free sets. CoRR abs/1112.3168 (2011) - 2008
- [i1]Mathilde Bouvel, Elisa Pergola:
Posets and Permutations in the Duplication-Loss Model: Minimal Permutations with d Descents. CoRR abs/0806.1494 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
