Matteo Pontecorvi

According to our database, Matteo Pontecorvi authored at least 16 papers between 2012 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

A Novel Framework for the Analysis of Unknown Transactions in Bitcoin: Theory, Model, and Experimental Results.

Maurantonio Caprolu, Matteo Pontecorvi, Matteo Signorini, Carlos Segarra, Roberto Di Pietro

CoRR, 2021

Analysis and Patterns of Unknown Transactions in Bitcoin.

Maurantonio Caprolu, Matteo Pontecorvi, Matteo Signorini, Carlos Segarra, Roberto Di Pietro

Proceedings of the 2021 IEEE International Conference on Blockchain, 2021

Achieving state machine replication without honest players.

Conor McMenamin, Vanesa Daza, Matteo Pontecorvi

Proceedings of the AFT '21: 3rd ACM Conference on Advances in Financial Technologies, Arlington, Virginia, USA, September 26, 2021

2020

Achieving State Machine Replication without Honesty Assumptions.

Conor McMenamin, Vanesa Daza, Matteo Pontecorvi

IACR Cryptol. ePrint Arch., 2020

BAD: A Blockchain Anomaly Detection Solution.

Matteo Signorini, Matteo Pontecorvi, Waël Kanoun, Roberto Di Pietro

IEEE Access, 2020

2019

A round-efficient distributed betweenness centrality algorithm.

Loc Hoang, Matteo Pontecorvi, Roshan Dathathri, Gurbinder Gill, Bozhi You, Keshav Pingali, Vijaya Ramachandran

Proceedings of the 24th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2019

2018

BAD: Blockchain Anomaly Detection.

Matteo Signorini, Matteo Pontecorvi, Wael Kanoun, Roberto Di Pietro

CoRR, 2018

Distributed Algorithms for Directed Betweenness Centrality and All Pairs Shortest Paths.

Matteo Pontecorvi, Vijaya Ramachandran

CoRR, 2018

A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in O͠(n^3/2) Rounds.

Udit Agarwal, Vijaya Ramachandran, Valerie King, Matteo Pontecorvi

CoRR, 2018

A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ(n 3/2 ) Rounds.

Udit Agarwal, Vijaya Ramachandran, Valerie King, Matteo Pontecorvi

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2015

A Faster Algorithm for Fully Dynamic Betweenness Centrality.

Matteo Pontecorvi, Vijaya Ramachandran

CoRR, 2015

Fully Dynamic Betweenness Centrality.

Matteo Pontecorvi, Vijaya Ramachandran

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014

Fully Dynamic All Pairs All Shortest Paths.

Matteo Pontecorvi, Vijaya Ramachandran

CoRR, 2014

Betweenness Centrality - Incremental and Faster.

Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality.

Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

2012

Disjoint cycles intersecting a set of vertices.

Matteo Pontecorvi, Paul Wollan

J. Comb. Theory, Ser. B, 2012