default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMassimiliano Rossi 0001
Person information
- affiliation: University of Florida, Gainesville, FL, USA
- affiliation (former): University of Verona, Italy
Other persons with the same name
- Massimiliano Rossi 0002
![[0000-0002-3200-7667]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0002-3200-7667")
— MBDA Italia S.p.A., Rome, Italy - Massimiliano Rossi 0003 — Media Lario Technologies S.r.l., Italy
- Massimiliano Rossi 0004 — European Environment Agency
- Massimiliano Rossi 0005 — National Cybersecurity Agency, Rome, Italy
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Christina Boucher, Davide Cenzato, Zsuzsanna Lipták, Massimiliano Rossi, Marinella Sciortino:
r-indexing the eBWT. Inf. Comput. 298: 105155 (2024)- 2023
- [j9]Davide Cozzi, Massimiliano Rossi, Simone Rubinacci, Travis Gagie, Dominik Köppl, Christina Boucher, Paola Bonizzoni:
μ- PBWT: a lightweight r-indexing of the PBWT for storing and querying UK Biobank data. Bioinform. 39(9) (2023) - [c22]Aaron Hong, Massimiliano Rossi, Christina Boucher:
LZ77 via Prefix-Free Parsing. ALENEX 2023: 123-134 - [c21]Paola Bonizzoni, Christina Boucher, Davide Cozzi, Travis Gagie, Dominik Köppl, Massimiliano Rossi:
Data Structures for SMEM-Finding in the PBWT. SPIRE 2023: 89-101 - 2022
- [j8]Massimiliano Rossi, Marco Oliva, Ben Langmead, Travis Gagie, Christina Boucher:
MONI: A Pangenomic Index for Finding Maximal Exact Matches. J. Comput. Biol. 29(2): 169-187 (2022) - [j7]Massimiliano Rossi, Marco Oliva, Paola Bonizzoni, Ben Langmead, Travis Gagie, Christina Boucher:
Finding Maximal Exact Matches Using the r-Index. J. Comput. Biol. 29(2): 188-194 (2022) - [j6]Kingshuk Mukherjee, Daniel Dole-Muinos, Massimiliano Rossi, Ayomide Ajayi, Mattia Prosperi, Christina Boucher:
Finding Overlapping Rmaps via Clustering. IEEE ACM Trans. Comput. Biol. Bioinform. 19(6): 3114-3123 (2022) - [c20]Marco Oliva, Davide Cenzato, Massimiliano Rossi, Zsuzsanna Lipták, Travis Gagie, Christina Boucher:
CSTs for Terabyte-Sized Data. DCC 2022: 93-102 - [c19]Nathaniel K. Brown, Travis Gagie, Massimiliano Rossi:
RLBWT Tricks. DCC 2022: 444 - [c18]Christina Boucher, Dominik Köppl, Herman Perera, Massimiliano Rossi:
Accessing the Suffix Array via φ -1-Forest. SPIRE 2022: 86-98 - [c17]Nathaniel K. Brown, Travis Gagie, Massimiliano Rossi:
RLBWT Tricks. SEA 2022: 16:1-16:16 - [c16]Sara Giuliani, Giuseppe Romana, Massimiliano Rossi:
Computing Maximal Unique Matches with the r-Index. SEA 2022: 22:1-22:16 - [i9]Sara Giuliani, Giuseppe Romana, Massimiliano Rossi:
Computing Maximal Unique Matches with the r-index. CoRR abs/2205.01576 (2022) - 2021
- [j5]Kingshuk Mukherjee, Massimiliano Rossi, Leena Salmela, Christina Boucher:
Fast and efficient Rmap assembly using the Bi-labelled de Bruijn graph. Algorithms Mol. Biol. 16(1): 6 (2021) - [j4]Zsuzsanna Lipták, Simon J. Puglisi, Massimiliano Rossi:
Pattern Discovery in Colored Strings. ACM J. Exp. Algorithmics 26: 1.1:1-1.1:26 (2021) - [j3]Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi:
On infinite prefix normal words. Theor. Comput. Sci. 859: 134-148 (2021) - [c15]Christina Boucher, Ondrej Cvacho, Travis Gagie, Jan Holub, Giovanni Manzini, Gonzalo Navarro, Massimiliano Rossi:
PFP Compressed Suffix Trees. ALENEX 2021: 60-72 - [c14]Christina Boucher, Travis Gagie, Tomohiro I, Dominik Köppl, Ben Langmead, Giovanni Manzini, Gonzalo Navarro, Alejandro Pacheco, Massimiliano Rossi:
PHONI: Streamed Matching Statistics with Multi-Genome References. DCC 2021: 193-202 - [c13]Marco Oliva, Massimiliano Rossi, Jouni Sirén, Giovanni Manzini, Tamer Kahveci, Travis Gagie, Christina Boucher:
Efficiently Merging r-indexes. DCC 2021: 203-212 - [c12]Ferdinando Cicalese, Massimiliano Rossi:
On the Redundancy of D-Ary Fano Codes. SOFSEM 2021: 263-277 - [c11]Christina Boucher, Davide Cenzato, Zsuzsanna Lipták, Massimiliano Rossi, Marinella Sciortino:
r-Indexing the eBWT. SPIRE 2021: 3-12 - [c10]Christina Boucher, Davide Cenzato, Zsuzsanna Lipták, Massimiliano Rossi, Marinella Sciortino:
Computing the Original eBWT Faster, Simpler, and with Less Memory. SPIRE 2021: 129-142 - [i8]Christina Boucher, Davide Cenzato, Zsuzsanna Lipták, Massimiliano Rossi, Marinella Sciortino:
Computing the original eBWT faster, simpler, and with less memory. CoRR abs/2106.11191 (2021) - [i7]Nathaniel K. Brown, Travis Gagie, Massimiliano Rossi:
RLBWT Tricks. CoRR abs/2112.04271 (2021) - 2020
- [j2]Ferdinando Cicalese, Massimiliano Rossi:
On the multi-interval Ulam-Rényi game: For 3 lies 4 intervals suffice. Theor. Comput. Sci. 809: 339-356 (2020) - [c9]Dustin Cobas, Veli Mäkinen, Massimiliano Rossi:
Tailoring r-index for Document Listing Towards Metagenomics Applications. SPIRE 2020: 291-306 - [c8]Kingshuk Mukherjee, Massimiliano Rossi, Leena Salmela, Christina Boucher:
Fast and Efficient Rmap Assembly Using the Bi-Labelled de Bruijn Graph. WABI 2020: 9:1-9:16 - [c7]Zsuzsanna Lipták, Simon J. Puglisi, Massimiliano Rossi:
Pattern Discovery in Colored Strings. SEA 2020: 12:1-12:14 - [i6]Zsuzsanna Lipták, Simon J. Puglisi, Massimiliano Rossi:
Pattern Discovery in Colored Strings. CoRR abs/2004.04858 (2020) - [i5]Dustin Cobas, Veli Mäkinen, Massimiliano Rossi:
Tailoring r-index for metagenomics. CoRR abs/2006.05871 (2020) - [i4]Christina Boucher, Ondrej Cvacho, Travis Gagie, Jan Holub, Giovanni Manzini, Gonzalo Navarro, Massimiliano Rossi:
PFP Data Structures. CoRR abs/2006.11687 (2020) - [i3]Christina Boucher, Travis Gagie, Tomohiro I, Dominik Köppl, Ben Langmead, Giovanni Manzini, Gonzalo Navarro, Alejandro Pacheco, Massimiliano Rossi:
PHONI: Streamed Matching Statistics with Multi-Genome References. CoRR abs/2011.05610 (2020)
2010 – 2019
- 2019
- [c6]Simon J. Puglisi, Massimiliano Rossi:
On Lempel-Ziv Decompression in Small Space. DCC 2019: 221-230 - [c5]Massimiliano Rossi:
Greedy additive approximation algorithms for minimum-entropy coupling problem. ISIT 2019: 1127-1131 - [c4]Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi:
On Infinite Prefix Normal Words. SOFSEM 2019: 122-135 - 2018
- [j1]Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi:
Bubble-Flip - A new generation algorithm for prefix normal words. Theor. Comput. Sci. 743: 38-52 (2018) - [c3]Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi:
Bubble-Flip - A New Generation Algorithm for Prefix Normal Words. LATA 2018: 207-219 - [i2]Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi:
On Infinite Prefix Normal Words. CoRR abs/1811.06273 (2018) - 2017
- [c2]Ferdinando Cicalese, Massimiliano Rossi:
On the Multi-interval Ulam-Rényi game: For 3 Lies 4 Intervals Suffice. ICTCS/CILC 2017: 39-50 - [i1]Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi:
Bubble-Flip - A New Generation Algorithm for Prefix Normal Words. CoRR abs/1712.05876 (2017) - 2015
- [c1]Andrea Bonci, Massimiliano Pirani, Massimiliano Rossi, Enrico Maria Gabbanini:
Embedded system for a Ballbot robot. WISES 2015: 157-161
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 21:25 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:
