COSTA, Simone
COSTA, Simone
Dipartimento di Ingegneria Meccanica e Industriale
A class of highly symmetric Archdeacon embeddings
2024-01-01 Costa, S.; Mella, L.
A complete solution to the infinite Oberwolfach problem
2020-01-01 Costa, S.
A gap in the slice rank of k-tensors
2021-01-01 Costa, S.; Dalai, M.
A generalization of Heffter arrays
2020-01-01 Costa, S.; Morini, F.; Pasotti, A.; Pellegrini, M. A.
A problem on partial sums in abelian groups
2018-01-01 Costa, Simone; Fiorenza, Morini; Pasotti, Anita; Pellegrini, MARCO ANTONIO
A tour problem on a toroidal board
2020-01-01 Costa, S.; Dalai, M.; Pasotti, A.
Alternating parity weak sequencing
2024-01-01 Costa, Simone; Della Fiore, Stefano
Blocking Sets in PG(r, q2n)
2013-01-01 Costa, S.
Bounds on the higher degree Erdős–Ginzburg–Ziv constants over Fqn
2023-01-01 Costa, S.; Della Fiore, S.
Existence of λ-fold non-zero sum Heffter arrays through local considerations
2023-01-01 Costa, S.; Della Fiore, S.
Factorizing the Rado graph and infinite complete graphs
2023-01-01 Costa, S.; Traetta, T.
Frame difference families and resolvable balanced incomplete block designs
2018-01-01 Costa, Simone; Feng, Tao; Wang, Xiaomiao
Globally simple heffter arrays and orthogonal cyclic cycle decompositions
2018-01-01 Costa, S.; Morini, F.; Pasotti, A.; Pellegrini, M. A.
Improved Bounds for (b, k)-Hashing
2022-01-01 Della Fiore, S; Costa, S; Dalai, M
New 2-designs from strong difference families
2018-01-01 Costa, Simone; Feng, Tao; Wang, Xiaomiao
New bounds for perfect k-hashing
2021-01-01 Costa, S; Dalai, M
New i-Perfect Cycle Decompositions via Vertex Colorings of Graphs
2016-01-01 Buratti, Marco; Costa, Simone; Wang, Xiaomiao
New upper bounds for (b, k)-hashing
2021-01-01 DELLA FIORE, Stefano; Costa, Simone; Dalai, Marco
Non-zero sum Heffter arrays and their applications
2022-01-01 Costa, S.; Della Fiore, S.; Pasotti, A.
On k-symmetries of hyperbolic spaces
2013-01-01 Costa, S.; Pianta, S.
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| A class of highly symmetric Archdeacon embeddings | 1-gen-2024 | Costa, S.; Mella, L. | |
| A complete solution to the infinite Oberwolfach problem | 1-gen-2020 | Costa, S. | |
| A gap in the slice rank of k-tensors | 1-gen-2021 | Costa, S.; Dalai, M. | |
| A generalization of Heffter arrays | 1-gen-2020 | Costa, S.; Morini, F.; Pasotti, A.; Pellegrini, M. A. | |
| A problem on partial sums in abelian groups | 1-gen-2018 | Costa, Simone; Fiorenza, Morini; Pasotti, Anita; Pellegrini, MARCO ANTONIO | |
| A tour problem on a toroidal board | 1-gen-2020 | Costa, S.; Dalai, M.; Pasotti, A. | |
| Alternating parity weak sequencing | 1-gen-2024 | Costa, Simone; Della Fiore, Stefano | |
| Blocking Sets in PG(r, q2n) | 1-gen-2013 | Costa, S. | |
| Bounds on the higher degree Erdős–Ginzburg–Ziv constants over Fqn | 1-gen-2023 | Costa, S.; Della Fiore, S. | |
| Existence of λ-fold non-zero sum Heffter arrays through local considerations | 1-gen-2023 | Costa, S.; Della Fiore, S. | |
| Factorizing the Rado graph and infinite complete graphs | 1-gen-2023 | Costa, S.; Traetta, T. | |
| Frame difference families and resolvable balanced incomplete block designs | 1-gen-2018 | Costa, Simone; Feng, Tao; Wang, Xiaomiao | |
| Globally simple heffter arrays and orthogonal cyclic cycle decompositions | 1-gen-2018 | Costa, S.; Morini, F.; Pasotti, A.; Pellegrini, M. A. | |
| Improved Bounds for (b, k)-Hashing | 1-gen-2022 | Della Fiore, S; Costa, S; Dalai, M | |
| New 2-designs from strong difference families | 1-gen-2018 | Costa, Simone; Feng, Tao; Wang, Xiaomiao | |
| New bounds for perfect k-hashing | 1-gen-2021 | Costa, S; Dalai, M | |
| New i-Perfect Cycle Decompositions via Vertex Colorings of Graphs | 1-gen-2016 | Buratti, Marco; Costa, Simone; Wang, Xiaomiao | |
| New upper bounds for (b, k)-hashing | 1-gen-2021 | DELLA FIORE, Stefano; Costa, Simone; Dalai, Marco | |
| Non-zero sum Heffter arrays and their applications | 1-gen-2022 | Costa, S.; Della Fiore, S.; Pasotti, A. | |
| On k-symmetries of hyperbolic spaces | 1-gen-2013 | Costa, S.; Pianta, S. |