default search action
Matteo Dell'Amico
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i16]Francesco Villani, Dario Lazzaro, Antonio Emanuele Cinà, Matteo Dell'Amico, Battista Biggio, Fabio Roli:
Sonic: Fast and Transferable Data Poisoning on Clustering Algorithms. CoRR abs/2408.07558 (2024) - [i15]Serena Cofano, Giacomo Benedetti
, Matteo Dell'Amico:
SBOM Generation Tools in the Python Ecosystem: an In-Detail Analysis. CoRR abs/2409.01214 (2024) - 2023
- [j11]Giovanni Camurati, Matteo Dell'Amico, François-Xavier Standaert:
MCRank: Monte Carlo Key Rank Estimation for Side-Channel Security Evaluations. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2023(1): 277-300 (2023) - [c32]Andrea Oliveri, Matteo Dell'Amico, Davide Balzarotti:
An OS-agnostic Approach to Memory Forensics. NDSS 2023 - 2022
- [j10]Michael Mitzenmacher, Matteo Dell'Amico
The Supermarket Model With Known and Predicted Service Times. IEEE Trans. Parallel Distributed Syst. 33(11): 2740-2751 (2022) - [c31]Iskander Sánchez-Rola, Matteo Dell'Amico, Davide Balzarotti, Pierre-Antoine Vervier, Leyla Bilge:
Journey to the Center of the Cookie Ecosystem: Unraveling Actors' Roles and Relationships. SP 2022: 1990-2004 - 2021
- [i14]Gibran Gómez, Platon Kotzias, Matteo Dell'Amico, Leyla Bilge, Juan Caballero:
Unsupervised Detection and Clustering of Malicious TLS Flows. CoRR abs/2109.03878 (2021) - 2020
- [c30]Emanuele Cozzi, Pierre-Antoine Vervier, Matteo Dell'Amico, Yun Shen, Leyla Bilge, Davide Balzarotti:
The Tangled Genealogy of IoT Malware. ACSAC 2020: 1-16 - [c29]Matteo Dell'Amico
Webs of Trust: Choosing Who to Trust on the Internet. APF 2020: 113-126
2010 – 2019
- 2019
- [c28]Iskander Sánchez-Rola, Matteo Dell'Amico
Can I Opt Out Yet?: GDPR and the Global Illusion of Cookie Control. AsiaCCS 2019: 340-351 - [c27]Mahmood Sharif, Kevin A. Roundy, Matteo Dell'Amico
A Field Study of Computer-Security Perceptions Using Anti-Virus Customer-Support Chats. CHI 2019: 78 - [i13]Matteo Dell'Amico:
Scheduling With Inexact Job Sizes: The Merits of Shortest Processing Time First. CoRR abs/1907.04824 (2019) - [i12]Matteo Dell'Amico:
FISHDBC: Flexible, Incremental, Scalable, Hierarchical Density-Based Clustering for Arbitrary Data and Distance. CoRR abs/1910.07283 (2019) - 2018
- [c26]Fabio Pagani, Matteo Dell'Amico
Beyond Precision and Recall: Understanding Uses (and Misuses) of Similarity Hashes in Binary Analysis. CODASPY 2018: 354-365 - 2017
- [j9]Alessandro Lulli
Scalable and flexible clustering solutions for mobile phone-based population indicators. Int. J. Data Sci. Anal. 4(4): 285-299 (2017) - [j8]Mario Pastorelli, Damiano Carra, Matteo Dell'Amico
HFSP: Bringing Size-Based Scheduling To Hadoop. IEEE Trans. Cloud Comput. 5(1): 43-56 (2017) - [c25]Kevin A. Roundy, Acar Tamersoy, Michael Spertus, Michael Hart, Daniel Kats, Matteo Dell'Amico
Smoke Detector: Cross-Product Intrusion Detection With Weak Indicators. ACSAC 2017: 200-211 - [c24]Matteo Dell'Amico
Lean On Me: Mining Internet Service Dependencies From Large-Scale DNS Data. ACSAC 2017: 449-460 - [c23]Leyla Bilge, Yufei Han, Matteo Dell'Amico
RiskTeller: Predicting the Risk of Cyber Incidents. CCS 2017: 1299-1311 - 2016
- [j7]Alessandro Lulli, Matteo Dell'Amico, Pietro Michiardi, Laura Ricci:
NG-DBSCAN: Scalable Density-Based Clustering for Arbitrary Data. Proc. VLDB Endow. 10(3): 157-168 (2016) - [j6]Matteo Dell'Amico
PSBS: Practical Size-Based Scheduling. IEEE Trans. Computers 65(7): 2199-2212 (2016) - [c22]Alessandro Lulli, Lorenzo Gabrielli, Patrizio Dazzi
Improving population estimation from mobile calls: A clustering approach. ISCC 2016: 1097-1102 - 2015
- [j5]Matteo Dell'Amico
Adaptive redundancy management for durable P2P backup. Comput. Networks 83: 136-148 (2015) - [j4]Matteo Dell'Amico
On User Availability Prediction and Network Applications. IEEE/ACM Trans. Netw. 23(4): 1300-1313 (2015) - [c21]Duy-Hung Phan, Quang-Nhat Hoang-Xuan, Matteo Dell'Amico
Efficient and Self-Balanced ROLLUP Aggregates for Large-Scale Data Summarization. BigData Congress 2015: 158-165 - [c20]Alessandro Lulli, Thibault Debatty, Matteo Dell'Amico
Scalable k-NN based text clustering. IEEE BigData 2015: 958-963 - [c19]Matteo Dell'Amico
Monte Carlo Strength Evaluation: Fast and Reliable Password Checking. CCS 2015: 158-169 - [i11]Matteo Dell'Amico, Damiano Carra, Pietro Michiardi:
On Fair Size-Based Scheduling. CoRR abs/1506.09158 (2015) - 2014
- [c18]Duy-Hung Phan, Matteo Dell'Amico, Pietro Michiardi:
On the design space of MapReduce ROLLUP aggregates. EDBT/ICDT Workshops 2014: 10-18 - [c17]Mario Pastorelli, Matteo Dell'Amico
OS-Assisted Task Preemption for Hadoop. ICDCS Workshops 2014: 94-99 - [c16]Matteo Dell'Amico
Revisiting Size-Based Scheduling with Estimated Job Sizes. MASCOTS 2014: 411-420 - [i10]Mario Pastorelli, Matteo Dell'Amico, Pietro Michiardi:
OS-Assisted Task Preemption for Hadoop. CoRR abs/1402.2107 (2014) - [i9]Matteo Dell'Amico, Damiano Carra, Mario Pastorelli, Pietro Michiardi:
Revisiting Size-Based Scheduling with Estimated Job Sizes. CoRR abs/1403.5996 (2014) - [i8]Matteo Dell'Amico, Maurizio Filippone, Pietro Michiardi, Yves Roudier:
On User Availability Prediction and Network Applications. CoRR abs/1404.7688 (2014) - [i7]Matteo Dell'Amico, Damiano Carra, Pietro Michiardi:
PSBS: Practical Size-Based Scheduling. CoRR abs/1410.6122 (2014) - 2013
- [j3]Matteo Dell'Amico
HiPoLDS: A Hierarchical Security Policy Language for Distributed Systems. Inf. Secur. Tech. Rep. 17(3): 81-92 (2013) - [c15]Mario Pastorelli, Antonio Barbuzzi, Damiano Carra, Matteo Dell'Amico
HFSP: Size-based scheduling for Hadoop. IEEE BigData 2013: 51-59 - [c14]Xiaolan Sha, Daniele Quercia
Trend makers and trend spotters in a mobile application. CSCW 2013: 1365-1374 - [c13]Ronan-Alexandre Cherrueau, Rémi Douence, Jean-Claude Royer, Mario Südholt, Anderson Santana de Oliveira, Yves Roudier, Matteo Dell'Amico
Reference Monitors for Security and Interoperability in OAuth 2.0. DPM/SETOP 2013: 235-249 - [i6]Matteo Dell'Amico:
A Simulator for Data-Intensive Job Scheduling. CoRR abs/1306.6023 (2013) - 2012
- [c12]László Toka, Pasquale Cataldi, Matteo Dell'Amico
Redundancy management for P2P backup. INFOCOM 2012: 2986-2990 - [c11]Xiaolan Sha, Daniele Quercia, Pietro Michiardi, Matteo Dell'Amico
Spotting trends: the wisdom of the few. RecSys 2012: 51-58 - [c10]Matteo Dell'Amico
HiPoLDS: A Security Policy Language for Distributed Systems. WISTP 2012: 97-112 - [i5]László Toka, Pasquale Cataldi, Matteo Dell'Amico, Pietro Michiardi:
Redundancy Management for P2P Backup. CoRR abs/1201.2360 (2012) - 2011
- [c9]László Toka, Matteo Dell'Amico
Data transfer scheduling for P2P storage. Peer-to-Peer Computing 2011: 132-141 - [c8]Rajesh Sharma, Anwitaman Datta
An empirical study of availability in friend-to-friend storage systems. Peer-to-Peer Computing 2011: 348-351 - 2010
- [j2]Matteo Dell'Amico, Licia Capra:
Dependable filtering: Philosophy and realizations. ACM Trans. Inf. Syst. 29(1): 5:1-5:37 (2010) - [c7]Antonio Nappa
Take a Deep Breath: A Stealthy, Resilient and Cost-Effective Botnet Using Skype. DIMVA 2010: 81-100 - [c6]Matteo Dell'Amico
Password Strength: An Empirical Analysis. INFOCOM 2010: 983-991 - [c5]László Toka, Matteo Dell'Amico
Online Data Backup: A Peer-Assisted Approach. Peer-to-Peer Computing 2010: 1-10 - [i4]László Toka, Matteo Dell'Amico, Pietro Michiardi:
On Scheduling and Redundancy for P2P Backup. CoRR abs/1009.1344 (2010) - [i3]Matteo Dell'Amico, Pietro Michiardi, Yves Roudier:
Back To The Future: On Predicting User Uptime. CoRR abs/1010.0626 (2010)
2000 – 2009
- 2009
- [i2]Matteo Dell'Amico, Pietro Michiardi, Yves Roudier:
Measuring Password Strength: An Empirical Analysis. CoRR abs/0907.3402 (2009) - 2008
- [j1]Matteo Dell'Amico
Neighbourhood maps: decentralized ranking in small-world P2P networks. Concurr. Comput. Pract. Exp. 20(6): 659-674 (2008) - [c4]Matteo Dell'Amico
SOFIA: Social Filtering for Robust Recommendations. IFIPTM 2008: 135-150 - 2007
- [c3]Matteo Dell'Amico:
Mapping Small Worlds. Peer-to-Peer Computing 2007: 219-228 - 2006
- [c2]Matteo Dell'Amico
DO-Casl: An Observer-Based Casl Extension for Dynamic Specifications. AMAST 2006: 96-110 - [c1]Matteo Dell'Amico
Neighbourhood maps: decentralised ranking in small-world P2P networks. IPDPS 2006 - 2005
- [i1]Maura Cerioli, Matteo Dell'Amico:
Injecting Distribution in CASL. Foundations of Global Computing 2005
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-09 21:27 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: