Stefano Della Fiore

About me

I am a Postdoc researcher in Information Theory at University of Salerno – working on Asymptotic Behaviour of Code Rates which is often related to problems treated in Extremal Set Theory and Extremal Combinatorics.
I obtained my BSc degree in 2016 (in Computer Science) with a thesis titled “Implementation of an algorithm for the processing of a sequence based on analysis of iterative local symmetries”, my MSc degree (in Communication Technologies and Multimedia) in 2018 (cum laude) with a thesis titled “Constraints in Source Coding” and my PhD degree in 2023 (cum laude) with a thesis titled “Asymptotic behaviour of code rates and related combinatorial problems”.
You can download my resume here.

Publications

• S. Costa, S. Della Fiore and A. Ferraguti, Variants of the Erdős distinct sums problem and variance method, submitted (link)

• S. Della Fiore and M. Dalai, Upper bounds on the rate of linear $q$-ary $k$-hash codes, submitted (link)

• A. Gnutti, S. Della Fiore, M. Savardi, Y. Chen, R. Leonardi and W. Peng, LiDAR Depth Map Guided Image Compression Model, submitted (link)

• M. Dalai, S. Della Fiore, A. A. Rescigno and U. Vaccaro, An Efficient Algorithm for Group Testing with Runlength Constraints, submitted (link)

• S. Costa and S. Della Fiore, Alternating Parity Weak Sequencing, Journal of Combinatorial Designs 2024 (link, preprint)

• S. Costa, S. Della Fiore and A. Ferraguti, Higher degree Erdős distinct evaluations problem, European Conference on Combinatorics 2023 (link)

• S. Costa, S. Della Fiore and M. A. Ollis, Sequencings in Semidirect Products via the Polynomial Method, submitted (link)

• M. Dalai, S. Della Fiore, A. A. Rescigno and U. Vaccaro, Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures, IEEE ITW 2023 (link, preprint)

• S. Costa and S. Della Fiore, Bounds on the Higher Degree Erdős-Ginzburg-Ziv Constants over $\mathbb{F}_q^n$, Archiv der Mathematik (2023) (link, preprint)

• S. Costa and S. Della Fiore, Existence of $\lambda$-fold non-zero sum Heffter arrays through local considerations, The Australasian Journal of Combinatorics 87 (2023) (link, preprint)

• S. Costa and S. Della Fiore, Weak Sequenceability in Cyclic Groups, Journal of Combinatorial Designs 30 (2022) (link, preprint)

• S. Della Fiore, M. Dalai and U. Vaccaro, Achievable Rates and Algorithms for Group Testing with Runlength Constraints, IEEE ITW 2022 (link, preprint)

• S. Costa, S. Della Fiore, M. A. Ollis and S. Z. Rovner-Frydman, On Sequences in Cyclic Groups with Distinct Partial Sums, The Electronic Journal of Combinatorics 3 (2022) (link, preprint, tables, code)

• S. Della Fiore, A. Gnutti and S. Polak, The maximum cardinality of trifferent codes with lengths 5 and 6, Examples and Counterexamples 2 (2022) (link, preprint, additional material)

• S. Costa, S. Della Fiore and A. Pasotti, Non-zero sum Heffter arrays and their applications, Discrete Mathematics 345 (2022) (link, preprint, additional material)

• S. Costa, M. Dalai and S. Della Fiore, Variations on the Erdős distinct-sums problem, Discrete Applied Mathematics 325 (2023) (link, preprint)

• S. Della Fiore and M. Dalai, A note on $\overline{2}$-separable codes and $B_2$ codes, Discrete Mathematics 345 (2022) (link, preprint)

• S. Della Fiore, S. Costa and M. Dalai, Improved Bounds for $(b,k)$-hashing, IEEE Transactions on Information Theory 68 (2022) (link, preprint, additional material)

• S. Della Fiore, S. Costa and M. Dalai, New upper bounds for $(b,k)$-hashing, IEEE ISIT 2021 (link, preprint)

Seminars

15/05/2020 – New bounds for the problem of perfect k-hashing – ISIT 2021 (slides)

08/07/2020 – The Probabilistic Method applied to Graphs (slides)

26/11/2020 – Sauer-Shelah Lemma and its Application to Codes (slides)

19/04/2021 – Some results on Graceful graphs and Latin Transversals (slides)

25/11/2021 – Variations on the Erdős Distinct-Sums Problem (slides)

01/06/2022 – On Sequences in Cyclic Groups with Distinct Partial Sums – Combinatorics 2022 (slides)

27/06/2023 – Asymptotic growth of codes and related combinatorial problems – PhD Discussion (slides)

Education

University of Salerno, 2022 – present, Postdoc in Information Theory
University of Brescia, 2019 – 2022, PhD in Information Theory
3rd level degree in Telecommunications engineering
Dissertation/thesis title: Asymptotic growth of codes and related combinatorial problems
Thesis supervisor: DALAI MARCO
Official duration: 3 years
Graduation date: 27/06/2023
University of Brescia, 2016 – 2018, Communication Technologies and Multimedia
LM-27 – 2nd level degree in Telecommunications engineering
Dissertation/thesis title: Constraints in Source Coding
Thesis supervisor: DALAI MARCO
Age at graduation: 24 | Official duration: 2 years
Final degree mark: 110/110 cum laude
Graduation date: 20/03/2019
University of Brescia, 2013 – 2016, Computer Science
L-8 – 1st level degree in Information technology
Dissertation/thesis title: Implementation of an algorithm for the processing of a sequence based on analysis of iterative local symmetries
Thesis supervisor: LEONARDI RICCARDO
Age at graduation: 22 | Official duration: 3 years
Final degree mark: 106/110
Graduation date: 22/03/2017
Industrial Vocational School BENEDETTO CASTELLI , BRESCIA (BS)
Kind of secondary school diploma: Italian secondary school diploma
Kind of secondary school attended: Public school

Work Experience

Software Developer / Servonet SNC / May, 2019 – Nov, 2019

Full stack developer using Eloquent, Twig and Slim frameworks.
Software Developer / Freelancer / Jan, 2018 – Dec, 2018
Java developer.
Software Developer / Freelancer / Jan, 2017 – Dec, 2017
C/C++ developer.