default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElena Barcucci
Person information
- affiliation: University of Florence, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j38]Elena Barcucci, Antonio Bernini
, Renzo Pinzani:
Sequences from Fibonacci to Catalan: A combinatorial interpretation via Dyck paths. RAIRO Theor. Informatics Appl. 58: 8 (2024)- [c19]Elena Barcucci, Antonio Bernini, Stefano Bilotta, Renzo Pinzani:
Dyck Paths Enumerated by the Q-bonacci Numbers. GASCom 2024: 49-53 - 2023
- [c18]Elena Barcucci, Antonio Bernini, Stefano Bilotta, Renzo Pinzani:
A Construction for Variable Dimension Strong Non-Overlapping Matrices. AFL 2023: 25-34 - 2022
- [j37]Elena Barcucci, Antonio Bernini, Renzo Pinzani:
Strings from linear recurrences and permutations: A Gray code. Theor. Comput. Sci. 938: 112-120 (2022) - 2021
- [j36]Elena Barcucci, Antonio Bernini, Renzo Pinzani:
Exhaustive generation of some lattice paths and their prefixes. Theor. Comput. Sci. 878-879: 47-52 (2021) - [c17]Elena Barcucci, Antonio Bernini, Renzo Pinzani:
Strings from Linear Recurrences: A Gray Code. WORDS 2021: 40-49 - [c16]Elena Barcucci, Antonio Bernini, Renzo Pinzani:
A Strong Non-overlapping Dyck Code. DLT 2021: 43-53
2010 – 2019
- 2018
- [j35]Elena Barcucci, Antonio Bernini, Stefano Bilotta, Renzo Pinzani:
A 2D non-overlapping code over a q-ary alphabet. Cryptogr. Commun. 10(4): 667-683 (2018) - [c15]Elena Barcucci, Antonio Bernini, Renzo Pinzani:
Exhaustive generation of positive lattice paths. GASCom 2018: 79-86 - [c14]Elena Barcucci, Antonio Bernini, Renzo Pinzani:
A Gray code for a regular language. GASCom 2018: 87-93 - 2017
- [j34]Elena Barcucci, Antonio Bernini, Stefano Bilotta, Renzo Pinzani:
Non-overlapping matrices. Theor. Comput. Sci. 658: 36-45 (2017) - [j33]Elena Barcucci, Antonio Bernini, Stefano Bilotta, Renzo Pinzani:
Cross-bifix-free sets in two dimensions. Theor. Comput. Sci. 664: 29-38 (2017) - [c13]Elena Barcucci, Paolo Dulio, Andrea Frosini, Simone Rinaldi:
Ambiguity Results in the Characterization of hv-convex Polyominoes from Projections. DGCI 2017: 147-158 - 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) - [i2]Elena Barcucci, Antonio Bernini, Stefano Bilotta, Renzo Pinzani:
Non-overlapping matrices. CoRR abs/1601.07723 (2016) - 2015
- [i1]Elena Barcucci, Antonio Bernini, Stefano Bilotta, Renzo Pinzani:
Cross-bifix-free sets in two dimensions. CoRR abs/1502.05275 (2015) - 2014
- [e1]Elena Barcucci, Andrea Frosini, Simone Rinaldi:
Discrete Geometry for Computer Imagery - 18th IAPR International Conference, DGCI 2014, Siena, Italy, September 10-12, 2014. Proceedings. Lecture Notes in Computer Science 8668, Springer 2014, ISBN 978-3-319-09954-5 [contents] - 2013
- [j31]Elena Barcucci, Stefano Brocchi:
Solving Multicolor Discrete Tomography Problems by Using Prior Knowledge. Fundam. Informaticae 125(3-4): 313-328 (2013) - [j30]Elena Barcucci, Vincent Vajnovszki:
Generalized Schröder permutations. Theor. Comput. Sci. 502: 210-216 (2013) - 2011
- [c12]Elena Barcucci, Stefano Brocchi, Andrea Frosini:
Solving the Two Color Problem: An Heuristic Algorithm. IWCIA 2011: 298-310 - [c11]Stefano Brocchi, Elena Barcucci:
BCIF: Another Algorithm for Lossless True Color Image Compression. IWCIA 2011: 372-384
2000 – 2009
- 2009
- [c10]Elena Barcucci, Srecko Brlek, Stefano Brocchi:
PCIF: An Algorithm for Lossless True Color Image Compression. IWCIA 2009: 224-237 - 2005
- [j29]Elena Barcucci, Andrea Frosini, Simone Rinaldi:
An algorithm for the reconstruction of discrete sets from two projections in presence of absorption. Discret. Appl. Math. 151(1-3): 21-35 (2005) - [j28]Elena Barcucci, Andrea Frosini, Simone Rinaldi:
On directed-convex polyominoes in a rectangle. Discret. Math. 298(1-3): 62-78 (2005) - [j27]Andrea Frosini, Simone Rinaldi, Elena Barcucci, Attila Kuba:
An efficient algorithm for reconstructing binary matrices from horizontal and vertical absorbed projections. Electron. Notes Discret. Math. 20: 347-363 (2005) - [j26]Elena Barcucci, Antonio Bernini, Luca Ferrari, Maddalena Poneti:
A Distributive Lattice Structure Connecting Dyck Paths, Noncrossing Partitions and 312-avoiding Permutations. Order 22(4): 311-328 (2005) - 2004
- [j25]Silvia Bacchelli, Elena Barcucci, Elisabetta Grazzini, Elisa Pergola:
Exhaustive generation of combinatorial objects by ECO. Acta Informatica 40(8): 585-602 (2004) - 2003
- [j24]Elena Barcucci, Andrea Frosini, Simone Rinaldi:
Reconstruction of discrete sets from two absorbed projections: an algorithm. Electron. Notes Discret. Math. 12: 118-129 (2003) - 2001
- [j23]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) - [j22]Elena Barcucci, Alberto Del Lungo, Andrea Frosini, Simone Rinaldi:
A Technology for Reverse-Engineering a Combinatorial Problem from a Rational Generating Function. Adv. Appl. Math. 26(2): 129-153 (2001) - [j21]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) - [j20]Elena Barcucci, Sara Brunetti, Alberto Del Lungo, Maurice Nivat:
Reconstruction of lattice sets from their horizontal, vertical and diagonal X-rays. Discret. Math. 241(1-3): 65-78 (2001) - [j19]Elena Barcucci, Simone Rinaldi:
Some linear recurrences and their combinatorial interpretation by means of regular languages. Theor. Comput. Sci. 255(1-2): 679-686 (2001) - 2000
- [j18]Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani:
From Motzkin to Catalan permutations. Discret. Math. 217(1-3): 33-49 (2000) - [j17]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) - [j16]Elena Barcucci, Sara Brunetti, Francesco Del Ristoro:
Succession rules and deco polyominoes. RAIRO Theor. Informatics Appl. 34(1): 1-14 (2000) - [c9]Elena Barcucci, Sara Brunetti, Alberto Del Lungo, Maurice Nivat:
Reconstruction of Discrete Sets from Three or More X-Rays. CIAC 2000: 199-210
1990 – 1999
- 1999
- [j15]Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani:
Directed animals, forests and permutations. Discret. Math. 204(1-3): 41-71 (1999) - [j14]Elena Barcucci, Alberto Del Lungo, Elisa Pergola:
Random Generation of Trees and Other Combinatorial Objects. Theor. Comput. Sci. 218(2): 219-232 (1999) - 1998
- [j13]Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani:
A methodology for plane tree enumeration. Discret. Math. 180(1-3): 45-64 (1998) - [j12]Elena Barcucci, Alberto Del Lungo, Jean-Marc Fedou, Renzo Pinzani:
Steep polyominoes, q-Motzkin numbers and q-Bessel functions. Discret. Math. 189(1-3): 21-42 (1998) - [j11]Elena Barcucci, Sara Brunetti, Alberto Del Lungo, Francesco Del Ristoro:
A combinatorial interpretation of the recurrence fn+1 = 6fn - fn-1. Discret. Math. 190(1-3): 235-240 (1998) - [j10]Elena Barcucci, Alberto Del Lungo, Maurice Nivat, Renzo Pinzani:
Medians of polyominoes: A property for reconstruction. Int. J. Imaging Syst. Technol. 9(2-3): 69-77 (1998) - 1997
- [j9]Elena Barcucci, Alberto Del Lungo, S. Fezzi, Renzo Pinzani:
Nondecreasing Dyck paths and q-Fibonacci numbers. Discret. Math. 170(1-3): 211-217 (1997) - [c8]Elena Barcucci, Alberto Del Lungo, Maurice Nivat, Renzo Pinzani, A. Zurli:
Reconstructing Digital Sets from X-Rays. ICIAP (1) 1997: 166-173 - 1996
- [j8]Elena Barcucci, Alberto Del Lungo, Maurice Nivat, Renzo Pinzani:
Reconstructing Convex Polyominoes from Horizontal and Vertical Projections. Theor. Comput. Sci. 155(2): 321-347 (1996) - [j7]Elena Barcucci, Alberto Del Lungo, Renzo Pinzani:
"Deco" Polyominoes, Permutations and Random Generation. Theor. Comput. Sci. 159(1): 29-42 (1996) - [j6]Elena Barcucci, Alberto Del Lungo, Renzo Pinzani, Renzo Sprugnoli:
Polyominoes Defined by Their Vertical and Horizontal Projections. Theor. Comput. Sci. 159(1): 129-136 (1996) - [c7]Elena Barcucci, Alberto Del Lungo, Maurice Nivat, Renzo Pinzani:
Reconstruction convex polyominoes from horizontal and vertical projections II. DGCI 1996: 295-306 - 1995
- [j5]Elena Barcucci, Renzo Pinzani, Renzo Sprugnoli:
The random generation of underdiagonal walks. Discret. Math. 139(1-3): 3-18 (1995) - [c6]Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani:
A Construction for Enumerating k-coloured Motzkin Paths. COCOON 1995: 254-263 - 1994
- [j4]Elena Barcucci, Renzo Pinzani, Renzo Sprugnoli:
The Random Generation of Directed Animals. Theor. Comput. Sci. 127(2): 333-350 (1994) - 1993
- [c5]Elena Barcucci, Renzo Pinzani, Renzo Sprugnoli:
Directed Column-Convex Polyominoes by Recurrence Relations. TAPSOFT 1993: 282-298 - 1992
- [j3]Elena Barcucci, M. Cecilia Verri:
Some more properties of Catalan numbers. Discret. Math. 102(3): 229-237 (1992) - 1991
- [c4]Elena Barcucci, Renzo Pinzani, E. Rodella, Renzo Sprugnoli:
A Characterization of Binary Search Networks. FCT 1991: 126-135 - 1990
- [j2]Elena Barcucci, Renzo Pinzani, Renzo Sprugnoli:
Optimal Selection of Secondary Indexes. IEEE Trans. Software Eng. 16(1): 32-38 (1990)
1980 – 1989
- 1989
- [c3]Elena Barcucci, Alessandra Chiuderi, Renzo Pinzani, M. Cecilia Verri:
Index Selection in Relational Databases. MFDBS 1989: 24-36 - [c2]Renzo Sprugnoli, Elena Barcucci, Alessandra Chiuderi, Renzo Pinzani:
On Some Properties of (a, b)-Trees. Optimal Algorithms 1989: 139-152 - 1984
- [j1]Elena Barcucci, Gianluca Pelacani:
A Software Development System Based on a Macroprocessor. Softw. Pract. Exp. 14(6): 519-531 (1984) - [c1]Elena Barcucci, Elisabetta Grazzini, Renzo Pinzani:
Index Selection in a Distributed Data Base. DDSS 1984: 179-187
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 2024-09-05 23:42 CEST 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:
