Sfoglia per Serie LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS
Constructing strings avoiding forbidden substrings
2021-01-01 Bernardini, G.; Marchetti-Spaccamela, A.; Pissis, S. P.; Stougie, L.; Sweering, M.
Expressiveness and Decidability of Temporal Logics for Asynchronous Hyperproperties
2022-01-01 Bozzelli, L.; Peron, A.; Sanchez, C.
Making de Bruijn Graphs Eulerian
2022-01-01 Bernardini, Giulia; Chen, Huiping; Loukides, Grigorios; Pissis, Solon P.; Stougie, Leen; Sweering, Michelle
On Strings Having the Same Length- k Substrings
2022-01-01 Bernardini, Giulia; Conte, Alessio; Gabory, Esteban; Grossi, Roberto; Loukides, Grigorios; Pissis, Solon P.; Punzi, Giulia; Sweering, Michelle
On Two Measures of Distance between Fully-Labelled Trees
2020-01-01 Bernardini, Giulia; Bonizzoni, Paola; Gawrychowski, Paweł
A Quantitative Extension of Interval Temporal Logic over Infinite Words
2022-01-01 Bozzelli, L.; Peron, A.
A rearrangement distance for fully-labelled trees
2019-01-01 Bernardini, G; Bonizzoni, P; Della Vedova, G; Patterson, M
Reconstructing Phylogenetic Networks via Cherry Picking and Machine Learning
2022-01-01 Bernardini, Giulia; van Iersel, Leo; Julien, Esther; Stougie, Leen
Substring Complexity in Sublinear Space
2023-01-01 Bernardini, Giulia; Fici, Gabriele; Gawrychowski, Paweł; Pissis, Solon P.
Taming Strategy Logic: Non-Recurrent Fragments
2022-01-01 Benerecetti, M.; Mogavero, F.; Peron, A.
Titolo | Data di pubblicazione | Autori | File |
---|---|---|---|
Constructing strings avoiding forbidden substrings | 1-gen-2021 | Bernardini G. + | |
Expressiveness and Decidability of Temporal Logics for Asynchronous Hyperproperties | 1-gen-2022 | Peron A. + | |
Making de Bruijn Graphs Eulerian | 1-gen-2022 | Giulia Bernardini + | |
On Strings Having the Same Length- k Substrings | 1-gen-2022 | Giulia Bernardini + | |
On Two Measures of Distance between Fully-Labelled Trees | 1-gen-2020 | Giulia Bernardini + | |
A Quantitative Extension of Interval Temporal Logic over Infinite Words | 1-gen-2022 | Peron A. + | |
A rearrangement distance for fully-labelled trees | 1-gen-2019 | Bernardini, G + | |
Reconstructing Phylogenetic Networks via Cherry Picking and Machine Learning | 1-gen-2022 | Giulia Bernardini + | |
Substring Complexity in Sublinear Space | 1-gen-2023 | Giulia Bernardini + | |
Taming Strategy Logic: Non-Recurrent Fragments | 1-gen-2022 | Peron A. + |
Legenda icone
- file ad accesso aperto
- file disponibili sulla rete interna
- file disponibili agli utenti autorizzati
- file disponibili solo agli amministratori
- file sotto embargo
- nessun file disponibile