default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefano Della Fiore
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j6]Marco Dalai, Stefano Della Fiore, Adele A. Rescigno, Ugo Vaccaro:
An efficient algorithm for group testing with runlength constraints. Discret. Appl. Math. 360: 181-187 (2025)- 2024
- [c4]Stefano Della Fiore, Marco Dalai:
Upper Bounds on the Rate of Linear Q-Ary K-Hash Codes. ISIT 2024: 2610-2615 - [i7]Stefano Della Fiore, Marco Dalai
:
Upper bounds on the rate of linear q-ary k-hash codes. CoRR abs/2401.16288 (2024) - [i6]Marco Dalai, Stefano Della Fiore, Adele A. Rescigno, Ugo Vaccaro:
An Efficient Algorithm for Group Testing with Runlength Constraints. CoRR abs/2409.03491 (2024) - 2023
- [j5]Simone Costa, Marco Dalai, Stefano Della Fiore:
Variations on the Erdős distinct-sums problem. Discret. Appl. Math. 325: 172-185 (2023) - [c3]Marco Dalai, Stefano Della Fiore, Adele A. Rescigno, Ugo Vaccaro:
Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures. ITW 2023: 544-549 - [i5]Marco Dalai, Stefano Della Fiore, Adele A. Rescigno, Ugo Vaccaro:
Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures. CoRR abs/2303.07211 (2023) - 2022
- [j4]Simone Costa, Stefano Della Fiore, M. A. Ollis, Sarah Z. Rovner-Frydman:
On Sequences in Cyclic Groups with Distinct Partial Sums. Electron. J. Comb. 29(3) (2022) - [j3]Stefano Della Fiore, Marco Dalai:
A note on 2‾-separable codes and B2 codes. Discret. Math. 345(3): 112751 (2022) - [j2]Simone Costa, Stefano Della Fiore, Anita Pasotti:
Non-zero sum Heffter arrays and their applications. Discret. Math. 345(9): 112952 (2022) - [j1]Stefano Della Fiore, Simone Costa, Marco Dalai:
Improved Bounds for (b, k)-Hashing. IEEE Trans. Inf. Theory 68(8): 4983-4997 (2022) - [c2]Stefano Della Fiore, Marco Dalai, Ugo Vaccaro:
Achievable Rates and Algorithms for Group Testing with Runlength Constraints. ITW 2022: 576-581 - [i4]Stefano Della Fiore, Alessandro Gnutti, Sven C. Polak:
The maximum cardinality of trifferent codes with lengths 5 and 6. CoRR abs/2201.06846 (2022) - [i3]Stefano Della Fiore, Marco Dalai, Ugo Vaccaro:
Achievable Rates and Algorithms for Group Testing with Runlength Constraints. CoRR abs/2208.14066 (2022) - 2021
- [c1]Stefano Della Fiore, Simone Costa, Marco Dalai:
New upper bounds for (b, k)-hashing. ISIT 2021: 256-261 - [i2]Stefano Della Fiore, Simone Costa, Marco Dalai:
New upper bounds for (b, k)-hashing. CoRR abs/2101.10916 (2021) - 2020
- [i1]Stefano Della Fiore, Simone Costa, Marco Dalai:
Further strengthening of upper bounds for perfect k-Hashing. CoRR abs/2012.00620 (2020)
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-10-12 23:01 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:
