Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatteo Pontecorvi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c7]Conor McMenamin, Vanesa Daza, Matteo Pontecorvi:
Achieving state machine replication without honest players. AFT 2021: 1-14- [c6]Maurantonio Caprolu
, Matteo Pontecorvi, Matteo Signorini, Carlos Segarra, Roberto Di Pietro:
Analysis and Patterns of Unknown Transactions in Bitcoin. Blockchain 2021: 170-179 - [i10]Maurantonio Caprolu, Matteo Pontecorvi, Matteo Signorini, Carlos Segarra, Roberto Di Pietro:
A Novel Framework for the Analysis of Unknown Transactions in Bitcoin: Theory, Model, and Experimental Results. CoRR abs/2103.09459 (2021) - 2020
- [j2]Matteo Signorini, Matteo Pontecorvi, Waël Kanoun, Roberto Di Pietro:
BAD: A Blockchain Anomaly Detection Solution. IEEE Access 8: 173481-173490 (2020) - [i9]Conor McMenamin, Vanesa Daza, Matteo Pontecorvi:
Achieving State Machine Replication without Honesty Assumptions. CoRR abs/2012.10146 (2020) - [i8]Conor McMenamin, Vanesa Daza, Matteo Pontecorvi:
Achieving State Machine Replication without Honesty Assumptions. IACR Cryptol. ePrint Arch. 2020: 1580 (2020)
2010 – 2019
- 2019
- [c5]Loc Hoang, Matteo Pontecorvi, Roshan Dathathri, Gurbinder Gill, Bozhi You, Keshav Pingali, Vijaya Ramachandran:
A round-efficient distributed betweenness centrality algorithm. PPoPP 2019: 272-286 - 2018
- [c4]Udit Agarwal, Vijaya Ramachandran, Valerie King, Matteo Pontecorvi:
A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ(n 3/2 ) Rounds. PODC 2018: 199-205 - [i7]Udit Agarwal, Vijaya Ramachandran, Valerie King, Matteo Pontecorvi:
A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in O͠(n3/2) Rounds. CoRR abs/1804.05441 (2018) - [i6]Matteo Pontecorvi, Vijaya Ramachandran:
Distributed Algorithms for Directed Betweenness Centrality and All Pairs Shortest Paths. CoRR abs/1805.08124 (2018) - [i5]Matteo Signorini, Matteo Pontecorvi, Wael Kanoun, Roberto Di Pietro:
BAD: Blockchain Anomaly Detection. CoRR abs/1807.03833 (2018) - 2015
- [c3]Matteo Pontecorvi, Vijaya Ramachandran:
Fully Dynamic Betweenness Centrality. ISAAC 2015: 331-342 - [i4]Matteo Pontecorvi, Vijaya Ramachandran:
A Faster Algorithm for Fully Dynamic Betweenness Centrality. CoRR abs/1506.05783 (2015) - 2014
- [c2]Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran:
Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality. ISAAC 2014: 766-778 - [c1]Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran:
Betweenness Centrality - Incremental and Faster. MFCS (2) 2014: 577-588 - [i3]Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran:
Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality. CoRR abs/1411.4073 (2014) - [i2]Matteo Pontecorvi, Vijaya Ramachandran:
Fully Dynamic All Pairs All Shortest Paths. CoRR abs/1412.3852 (2014) - 2013
- [i1]Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran:
Betweenness Centrality - Incremental and Faster. CoRR abs/1311.2147 (2013) - 2012
- [j1]Matteo Pontecorvi, Paul Wollan:
Disjoint cycles intersecting a set of vertices. J. Comb. Theory, Ser. B 102(5): 1134-1141 (2012)
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 2023-09-28 03:16 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:
