Elia Onofri

Orcid: 0000-0001-8391-2563

According to our database1, Elia Onofri authored at least 15 papers between 2019 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
mRLWE-CP-ABE: A revocable CP-ABE for post-quantum cryptography.
J. Math. Cryptol., February, 2024

A Mathematical Formalisation of the {\gamma}-contraction Problem.
CoRR, 2024

Characterizing Polkadot's Transactions Ecosystem: methodology, tools, and insights.
Proceedings of the IEEE International Conference on Decentralized Applications and Infrastructures, 2024

2023
Explainable Drug Repurposing Approach From Biased Random Walks.
IEEE ACM Trans. Comput. Biol. Bioinform., 2023

mR<sub>LWE</sub>-CP-ABE a revocable CP-ABE for Post-Quantum Cryptography.
IACR Cryptol. ePrint Arch., 2023

Inverting the Fundamental Diagram and Forecasting Boundary Conditions: How Machine Learning Can Improve Macroscopic Models for Traffic Flow.
CoRR, 2023

Finite Algebras for Solid Modeling using Julia's Sparse Arrays.
Comput. Aided Des., 2023

Harnessing computational models to uncover the role of the immune system in tuberculosis treatment.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2023

2022
Some Results on Colored Network Contraction.
J. Ubiquitous Syst. Pervasive Networks, 2022

Ten years of cube attacks.
IACR Cryptol. ePrint Arch., 2022

Graph Contraction on Attribute-Based Coloring.
Proceedings of the 13th International Conference on Ambient Systems, 2022

2021
Managing crowded museums: Visitors flow measurement, analysis, modeling, and optimization.
J. Comput. Sci., 2021

2020
Local congruence of chain complexes.
CoRR, 2020

2019
Measurement and analysis of visitors' trajectories in crowded museums.
CoRR, 2019

Finite Boolean Algebras for Solid Geometry using Julia's Sparse Arrays.
CoRR, 2019


  Loading...