Lavinia Egidi

Orcid: 0000-0002-9745-0942

According to our database1, Lavinia Egidi authored at least 31 papers between 1991 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
SecuriDN: a customizable GUI generating cybersecurity models for DER control architectures.
Proceedings of the 8th Italian Conference on Cyber Security (ITASEC 2024), 2024

2022
Space Efficient Merging of de Bruijn Graphs and Wheeler Graphs.
Algorithmica, 2022

Multiparty-session-types Coordination for Core Erlang.
Proceedings of the 17th International Conference on Software Technologies, 2022

2020
Lightweight merging of compressed indices based on BWT variants.
Theor. Comput. Sci., 2020

2019
External memory BWT and LCP computation for sequence collections with applications.
Algorithms Mol. Biol., 2019

Space-Efficient Merging of Succinct de Bruijn Graphs.
Proceedings of the String Processing and Information Retrieval, 2019

A Bayesian Network Approach for the Interpretation of Cyber Attacks to Power Systems.
Proceedings of the Third Italian Conference on Cyber Security, 2019

Analysis and Detection of Cyber Attack Processes targeting Smart Grids.
Proceedings of the 2019 IEEE PES Innovative Smart Grid Technologies Europe, 2019

2017
Lightweight BWT and LCP Merging via the Gap Algorithm.
Proceedings of the String Processing and Information Retrieval, 2017

2015
Multiple seeds sensitivity using a single seed with threshold.
J. Bioinform. Comput. Biol., 2015

2014
Design and analysis of periodic multiple seeds.
Theor. Comput. Sci., 2014

Spaced Seed Design Using Perfect Rulers.
Fundam. Informaticae, 2014

2013
Better spaced seeds using Quadratic Residues.
J. Comput. Syst. Sci., 2013

2011
Double-exponential inseparability of Robinson subsystem Q<sub>+</sub>.
J. Symb. Log., 2011

Spaced Seeds Design Using Perfect Rulers.
Proceedings of the String Processing and Information Retrieval, 2011

2008
A modular approach to user-defined symbolic periodicities.
Data Knowl. Eng., 2008

2006
From digital audiobook to secure digital multimedia-book.
Comput. Entertain., 2006

A mathematical framework for the semantics of symbolic languages representing periodic time.
Ann. Math. Artif. Intell., 2006

2005
Bringing multimedia contents into MP3 files.
IEEE Commun. Mag., 2005

A flexible approach to user-defined symbolic granularities in temporal databases.
Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), 2005

2004
Modelling a Secure Agent with Team Automata.
Proceedings of the First International Workshop on Views on Designing Complex Architectures, 2004

A Lattice of Classes of User-Defined Symbolic Periodicities.
Proceedings of the 11th International Symposium on Temporal Representation and Reasoning (TIME 2004), 2004

Anonymity and certification: e-mail, a case study.
Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), 2004

Orthogonal Operators for User-Defined Symbolic Periodicities.
Proceedings of the Artificial Intelligence: Methodology, 2004

2003
Minimal Information Disclosure in a Centralized Authorization System.
Proceedings of the First International Workshop on Security Issues in Coordination Models, 2003

Authentication and Access Delegation with User-Released Certificates.
Proceedings of the 2003 ACM Symposium on Applied Computing (SAC), 2003

1999
Hilbert Function and Complexity Lower Bounds for Symmetric Boolean Functions.
Inf. Comput., 1999

1998
A quantifier elimination for the theory of <i>p</i>-adic numbers.
Comput. Complex., 1998

1993
The Complexity of the Theory of p-adic Numbers
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992
Operational, denotational and logical descriptions: a case study.
Fundam. Informaticae, 1992

1991
The lazy call-by-value Lamda-Calculus.
Proceedings of the Mathematical Foundations of Computer Science 1991, 1991


  Loading...