![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Antonio Bernini
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j18]Elena Barcucci, Antonio Bernini
, Renzo Pinzani:
Sequences from Fibonacci to Catalan: A combinatorial interpretation via Dyck paths. RAIRO Theor. Informatics Appl. 58: 8 (2024) - [i5]Elena Barcucci, Antonio Bernini, Stefano Bilotta, Renzo Pinzani:
Dyck Paths Enumerated by the Q-bonacci Numbers. CoRR abs/2406.16394 (2024) - 2023
- [c6]Elena Barcucci, Antonio Bernini, Stefano Bilotta, Renzo Pinzani:
A Construction for Variable Dimension Strong Non-Overlapping Matrices. AFL 2023: 25-34 - 2022
- [j17]Christian Bean
, Antonio Bernini
, Matteo Cervetti, Luca S. Ferrari
:
On the generating functions of pattern-avoiding Motzkin paths. J. Symb. Comput. 113: 126-138 (2022) - [j16]Elena Barcucci, Antonio Bernini
, Renzo Pinzani:
Strings from linear recurrences and permutations: A Gray code. Theor. Comput. Sci. 938: 112-120 (2022) - 2021
- [j15]Antonio Bernini, Matteo Cervetti, Luca Ferrari
, Einar Steingrímsson:
Enumerative Combinatorics of Intervals in the Dyck Pattern Poset. Order 38(3): 473-487 (2021) - [j14]Elena Barcucci, Antonio Bernini, Renzo Pinzani:
Exhaustive generation of some lattice paths and their prefixes. Theor. Comput. Sci. 878-879: 47-52 (2021) - [c5]Elena Barcucci
, Antonio Bernini
, Renzo Pinzani:
Strings from Linear Recurrences: A Gray Code. WORDS 2021: 40-49 - [c4]Elena Barcucci
, Antonio Bernini
, Renzo Pinzani:
A Strong Non-overlapping Dyck Code. DLT 2021: 43-53
2010 – 2019
- 2018
- [j13]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) - [c3]Elena Barcucci, Antonio Bernini, Renzo Pinzani:
Exhaustive generation of positive lattice paths. GASCom 2018: 79-86 - [c2]Elena Barcucci, Antonio Bernini, Renzo Pinzani:
A Gray code for a regular language. GASCom 2018: 87-93 - 2017
- [j12]Antonio Bernini
, Stefano Bilotta
, Renzo Pinzani, Vincent Vajnovszki:
A Gray code for cross-bifix-free sets. Math. Struct. Comput. Sci. 27(2): 184-196 (2017) - [j11]Elena Barcucci
, Antonio Bernini
, Stefano Bilotta, Renzo Pinzani:
Non-overlapping matrices. Theor. Comput. Sci. 658: 36-45 (2017) - [j10]Elena Barcucci, Antonio Bernini
, Stefano Bilotta
, Renzo Pinzani:
Cross-bifix-free sets in two dimensions. Theor. Comput. Sci. 664: 29-38 (2017) - [j9]Chiara Bodei, Linda Brodo, Roberta Gori
, Francesca Levi, Antonio Bernini, Diana Hermith
:
A static analysis for Brane Calculi providing global occurrence counting information. Theor. Comput. Sci. 696: 11-51 (2017) - [c1]Antonio Bernini:
Restricted Binary Strings and Generalized Fibonacci Numbers. AUTOMATA 2017: 32-43 - 2016
- [i4]Elena Barcucci, Antonio Bernini, Stefano Bilotta, Renzo Pinzani:
Non-overlapping matrices. CoRR abs/1601.07723 (2016) - 2015
- [j8]Antonio Bernini
, Stefano Bilotta
, Renzo Pinzani, Ahmad Sabri
, Vincent Vajnovszki:
Gray code orders for q-ary words avoiding a given factor. Acta Informatica 52(7-8): 573-592 (2015) - [i3]Elena Barcucci, Antonio Bernini, Stefano Bilotta, Renzo Pinzani:
Cross-bifix-free sets in two dimensions. CoRR abs/1502.05275 (2015) - 2014
- [j7]Antonio Bernini
, Stefano Bilotta
, Renzo Pinzani, Ahmad Sabri
, Vincent Vajnovszki:
Prefix partitioned gray codes for particular cross-bifix-free sets. Cryptogr. Commun. 6(4): 359-369 (2014) - [j6]Axel Bacher, Antonio Bernini
, Luca Ferrari
, Benjamin Gunby, Renzo Pinzani, Julian West:
The Dyck pattern poset. Discret. Math. 321: 12-23 (2014) - [i2]Antonio Bernini, Stefano Bilotta, Renzo Pinzani, Vincent Vajnovszki:
A Gray Code for cross-bifix-free sets. CoRR abs/1401.4650 (2014) - [i1]Antonio Bernini, Stefano Bilotta, Renzo Pinzani, Ahmad Sabri, Vincent Vajnovszki:
Gray code orders for $q$-ary words avoiding a given factor. CoRR abs/1404.0823 (2014) - 2011
- [j5]Antonio Bernini, Luca Ferrari, Einar Steingrímsson:
The Möbius Function of the Consecutive Pattern Poset. Electron. J. Comb. 18(1) (2011)
2000 – 2009
- 2009
- [j4]Antonio Bernini, Luca Ferrari, Renzo Pinzani:
Enumeration of Some Classes of Words Avoiding Two Generalized Patterns of Length Three. J. Autom. Lang. Comb. 14(2): 129-147 (2009) - 2007
- [j3]Antonio Bernini
, Elisabetta Grazzini, Elisa Pergola, Renzo Pinzani:
A general exhaustive generation algorithm for Gray structures. Acta Informatica 44(5): 361-376 (2007) - [j2]Antonio Bernini, Luca Ferrari:
Order properties of the Motzkin and Schroder families. Australas. J Comb. 39: 259-272 (2007) - 2005
- [j1]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)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-07-17 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint