Pietro Nannipieri

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Silvia Moranti

> Home > Persons > Pietro Nannipieri

Publications

2025
[j16]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/access/MonopoliBNMF25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/access/MonopoliBNMF25
Matteo Monopoli, Matteo Biondi, Pietro Nannipieri, Silvia Moranti, Luca Fanucci:
RADSAFiE: A Netlist-Level Fault Injection User Interface Application for FPGA-Based Digital Systems. IEEE Access 13: 28809-28823 (2025)
[j15]
- view
  authority control:
- export record
  dblp key:
  - journals/mam/ZulbertiMNMTF25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mam/ZulbertiMNMTF25
Luca Zulberti, Matteo Monopoli, Pietro Nannipieri, Silvia Moranti, Geert Thys, Luca Fanucci:
Efficient Coarse-Grained Reconfigurable Array architecture for machine learning applications in space using DARE65T library platform. Microprocess. Microsystems 113: 105142 (2025)
2024
[c14]
- view
  authority control:
- export record
  dblp key:
  - conf/icsrs/MonopoliBTNMBF24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icsrs/MonopoliBTNMBF24
Matteo Monopoli, Matteo Biondi, Giovanni Todaro, Pietro Nannipieri, Silvia Moranti, Cinzia Bernardeschi, Luca Fanucci:
Enhancing a Soft GPU IP Reliability Against SEUs in Space: Modelling Approach and Criticality Analysis on a Radiation-Tolerant FPGA. ICSRS 2024: 40-48

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.