default search action
Lavinia Egidi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c18]Davide Cerotti, Daniele Codetta Raiteri, Giovanna Dondossola, Lavinia Egidi, Giuliana Franceschinis, Luigi Portinale, Roberta Terruggia, Davide Savarro:
SecuriDN: a customizable GUI generating cybersecurity models for DER control architectures. ITASEC 2024 - 2022
- [j15]Lavinia Egidi, Felipe A. Louza
, Giovanni Manzini:
Space Efficient Merging of de Bruijn Graphs and Wheeler Graphs. Algorithmica 84(3): 639-669 (2022) - [c17]Lavinia Egidi, Paola Giannini, Lorenzo Ventura:
Multiparty-session-types Coordination for Core Erlang. ICSOFT 2022: 532-541 - 2020
- [j14]Lavinia Egidi
Lightweight merging of compressed indices based on BWT variants. Theor. Comput. Sci. 812: 214-229 (2020) - [i4]Lavinia Egidi, Felipe A. Louza, Giovanni Manzini:
Space efficient merging of de Bruijn graphs and Wheeler graphs. CoRR abs/2009.03675 (2020)
2010 – 2019
- 2019
- [j13]Lavinia Egidi
External memory BWT and LCP computation for sequence collections with applications. Algorithms Mol. Biol. 14(1): 6:1-6:15 (2019) - [c16]Davide Cerotti, Daniele Codetta Raiteri
Analysis and Detection of Cyber Attack Processes targeting Smart Grids. ISGT Europe 2019: 1-5 - [c15]Davide Cerotti, Daniele Codetta Raiteri, Giovanna Dondossola, Lavinia Egidi, Giuliana Franceschinis, Luigi Portinale, Roberta Terruggia:
A Bayesian Network Approach for the Interpretation of Cyber Attacks to Power Systems. ITASEC 2019 - [c14]Lavinia Egidi
Space-Efficient Merging of Succinct de Bruijn Graphs. SPIRE 2019: 337-351 - [i3]Lavinia Egidi, Felipe A. Louza, Giovanni Manzini:
Space-efficient merging of succinct de Bruijn graphs. CoRR abs/1902.02889 (2019) - [i2]Lavinia Egidi, Giovanni Manzini:
Lightweight merging of compressed indices based on BWT variants. CoRR abs/1903.01465 (2019) - 2018
- [c13]Lavinia Egidi
External memory BWT and LCP computation for sequence collections with applications. WABI 2018: 10:1-10:14 - [i1]Lavinia Egidi, Felipe A. Louza, Giovanni Manzini, Guilherme P. Telles:
External memory BWT and LCP computation for sequence collections with applications. CoRR abs/1805.06821 (2018) - 2017
- [c12]Lavinia Egidi
Lightweight BWT and LCP Merging via the Gap Algorithm. SPIRE 2017: 176-190 - 2015
- [j12]Lavinia Egidi
Multiple seeds sensitivity using a single seed with threshold. J. Bioinform. Comput. Biol. 13(4): 1550011:1-1550011:15 (2015) - 2014
- [j11]Lavinia Egidi
Spaced Seed Design Using Perfect Rulers. Fundam. Informaticae 131(2): 187-203 (2014) - [j10]Lavinia Egidi
Design and analysis of periodic multiple seeds. Theor. Comput. Sci. 522: 62-76 (2014) - 2013
- [j9]Lavinia Egidi
Better spaced seeds using Quadratic Residues. J. Comput. Syst. Sci. 79(7): 1144-1155 (2013) - 2011
- [j8]Lavinia Egidi
Double-exponential inseparability of Robinson subsystem Q+. J. Symb. Log. 76(1): 94-124 (2011) - [c11]Lavinia Egidi
Spaced Seeds Design Using Perfect Rulers. SPIRE 2011: 32-43
2000 – 2009
- 2008
- [j7]Lavinia Egidi
A modular approach to user-defined symbolic periodicities. Data Knowl. Eng. 66(1): 163-198 (2008) - 2006
- [j6]Lavinia Egidi
A mathematical framework for the semantics of symbolic languages representing periodic time. Ann. Math. Artif. Intell. 46(3): 317-347 (2006) - [j5]Lavinia Egidi
From digital audiobook to secure digital multimedia-book. Comput. Entertain. 4(3): 5 (2006) - 2005
- [j4]Lavinia Egidi
Bringing multimedia contents into MP3 files. IEEE Commun. Mag. 43(5): 90-97 (2005) - [c10]Lavinia Egidi
A flexible approach to user-defined symbolic granularities in temporal databases. SAC 2005: 592-597 - 2004
- [c9]Lavinia Egidi, Paolo Terenziani
Orthogonal Operators for User-Defined Symbolic Periodicities. AIMSA 2004: 137-147 - [c8]Lavinia Egidi, Giovanni Porcelli:
Anonymity and certification: e-mail, a case study. SAC 2004: 397-403 - [c7]Lavinia Egidi, Paolo Terenziani
A Lattice of Classes of User-Defined Symbolic Periodicities. TIME 2004: 13-20 - [c6]Lavinia Egidi, Paolo Terenziani
A Mathematical Framework for the Semantics of Symbolic Languages Representing Periodic Time. TIME 2004: 21-27 - [c5]Lavinia Egidi
Modelling a Secure Agent with Team Automata. VODCA@FOSAD 2004: 111-127 - 2003
- [c4]Lavinia Egidi, Maurizio Melato:
Authentication and Access Delegation with User-Released Certificates. SAC 2003: 288-293 - [c3]Lavinia Egidi
Minimal Information Disclosure in a Centralized Authorization System. SecCo 2003: 89-104
1990 – 1999
- 1999
- [j3]Anna Bernasconi, Lavinia Egidi
Hilbert Function and Complexity Lower Bounds for Symmetric Boolean Functions. Inf. Comput. 153(1): 1-25 (1999) - 1998
- [j2]Lavinia Egidi
A quantifier elimination for the theory of p-adic numbers. Comput. Complex. 7(3): 205-263 (1998) - 1993
- [c2]Lavinia Egidi:
The Complexity of the Theory of p-adic Numbers. FOCS 1993: 412-421 - 1992
- [j1]Lavinia Egidi, Furio Honsell, Simona Ronchi Della Rocca:
Operational, denotational and logical descriptions: a case study. Fundam. Informaticae 16(1): 149-169 (1992) - 1991
- [c1]Lavinia Egidi
The lazy call-by-value Lamda-Calculus. MFCS 1991: 161-169
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: