EDBT 2026 Demo / reviewers in the wild / expert
Alessandro Siciliano
dblp:60/5860
· DBLP profile ↗
8ranked-venue papers
0as first author
2since 2021 · last 2024
0000-0002-6042-3377ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 7 · 2 since 2021Theory of computation · 1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Classifying pseudo-ovals, translation generalized quadrangles, and elation Laguerre planes of small orderabstractAbstract We provide classification results for translation generalized quadrangles of order less than or equal to 64, and hence, for all incidence geometries related to them. The results consist of the classification of all pseudo-ovals in $$\textrm{PG}(3n-1,2)$$ PG ( 3 n - 1 , 2 ) , for $$n=3,4$$ n = 3 , 4 , and that of the pseudo-ovals in $$\textrm{PG}(3n-1,q)$$ PG ( 3 n - 1 , q ) , for $$n=5,6$$ n = 5 , 6 , such that one of the associated projective planes is Desarguesian. Giusy Monzillo, Tim Penttila, Alessandro Siciliano |
Des. Codes Cryptogr. | 3 |
| 2023 | Eggs in finite projective spaces and unitals in translation planes
Giusy Monzillo, Tim Penttila, Alessandro Siciliano |
Des. Codes Cryptogr. | 3 |
| 2014 | On unitals in PG(2, q2) stabilized by a homology group
Giorgio Donati, Nicola Durante, Alessandro Siciliano |
Des. Codes Cryptogr. | 3 |
| 2014 | Some blocking semiovals of homology type in planes of square order
Nicola Durante, Alessandro Siciliano |
Des. Codes Cryptogr. | 2 |
| 2008 | The geometry of some two-character sets
Antonio Cossidente, Nicola Durante, Giuseppe Marino 0002, Tim Penttila, Alessandro Siciliano |
Des. Codes Cryptogr. | 5 |
| 2006 | The Automorphism Group of Plane Algebraic Curves with Singer Automorphisms
Antonio Cossidente, Alessandro Siciliano |
Des. Codes Cryptogr. | 2 |
| 2001 | Veronese Varieties Over Finite Fields and Their Projections
Antonio Cossidente, Domenico Labbate, Alessandro Siciliano |
Des. Codes Cryptogr. | 3 |
| 2001 | A geometric construction of an optimal [67, 9, 30] binary codeabstractWe construct a new optimal binary [67,9,30]-code corresponding to a complete cap of PG(8,2). This cap is obtained by gluing together some Hermitian Veroneseans in a mixed partition of PG(8,2) and one hyperoval. We also construct a ternary [364,9,234]-code corresponding to a complete cap of PG(8,3). This cap turns out to be as large as the largest known cap in PG(8,3) (in an asymptotical sense). Antonio Cossidente, Alessandro Siciliano |
IEEE Trans. Inf. Theory | 2 |