15 citations · 42 across the 8 of their papers we have counts for
9 papers
A Novel Framework for the Analysis of Unknown Transactions in Bitcoin: Theory, Model, and Experimental Results
Maurantonio Caprolu, Matteo Pontecorvi, Matteo Signorini +2
Bitcoin (BTC) is probably the most transparent payment network in the world, thanks to the full history of transactions available to the public. Though, Bitcoin is not a fully anon…
Achieving State Machine Replication without Honest Players
Conor McMenamin, Vanesa Daza, Matteo Pontecorvi
Existing standards for player characterisation in tokenised state machine replication protocols depend on honest players who will always follow the protocol, regardless of possible…
BAD: Blockchain Anomaly Detection
Matteo Signorini, Matteo Pontecorvi, Wael Kanoun +1
Anomaly detection tools play a role of paramount importance in protecting networks and systems from unforeseen attacks, usually by automatically recognizing and filtering out anoma…
Distributed Algorithms for Directed Betweenness Centrality and All Pairs Shortest Paths
Matteo Pontecorvi, Vijaya Ramachandran
The betweenness centrality (BC) of a node in a network (or graph) is a measure of its importance in the network. BC is widely used in a large number of environments such as social…
A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Rounds
Udit Agarwal, Vijaya Ramachandran, Valerie King +1
We present a deterministic distributed algorithm to compute all-pairs shortest paths(APSP) in an edge-weighted directed or undirected graph. Our algorithm runs in $\tilde{O}(n^{3/2…
A Faster Algorithm for Fully Dynamic Betweenness Centrality
Matteo Pontecorvi, Vijaya Ramachandran
We present a new fully dynamic algorithm for maintaining betweenness centrality (BC) of vertices in a directed graph with positive edge weights. BC is a widely used param…
Fully Dynamic All Pairs All Shortest Paths
Matteo Pontecorvi, Vijaya Ramachandran
We consider the all pairs all shortest paths (APASP) problem, which maintains all of the multiple shortest paths for every vertex pair in a directed graph with a positive…
Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality
Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran
We consider the all pairs all shortest paths (APASP) problem, which maintains the shortest path dag rooted at every vertex in a directed graph G=(V,E) with positive edge weights. F…
Betweenness Centrality -- Incremental and Faster
Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran
We consider the incremental computation of the betweenness centrality of all vertices in a large complex network modeled as a graph G = (V, E), directed or undirected, with positiv…