Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

The Graph Structure of Bitcoin.

D. Maesa, A. Marino, and L. Ricci. COMPLEX NETWORKS (2), volume 813 of Studies in Computational Intelligence, page 547-558. Springer, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Daniel Marino

Daniel Marino

Sebastian Marino University of Stuttgart

Dr. Andrea Thom University of Stuttgart

Andrea Loi University of Stuttgart

Other publications of authors with the same name

The bow tie structure of the Bitcoin users graph.D. Maesa, A. Marino, and L. Ricci. Applied Network Science, 4 (1): 56:1-56:22 (2019)Detecting artificial behaviours in the Bitcoin users graph.D. Maesa, A. Marino, and L. Ricci. Online Social Networks and Media, (2017)Smooth movement and Manhattan path based Random Waypoint mobility.P. Crescenzi, M. Ianni, A. Marino, D. Merlini, G. Rossi, and P. Vocca. Inf. Process. Lett., 111 (5): 239-246 (2011)Edge-Disjoint Branchings in Temporal Digraphs.V. Campos, R. Lopes, A. Marino, and A. Silva. Electron. J. Comb., (2021)On Computing the Diameter of Real-World Directed (Weighted) Graphs.P. Crescenzi, R. Grossi, L. Lanzi, and A. Marino. SEA, volume 7276 of Lecture Notes in Computer Science, page 99-110. Springer, (2012)A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs.P. Crescenzi, R. Grossi, L. Lanzi, and A. Marino. TAPAS, volume 6595 of Lecture Notes in Computer Science, page 92-103. Springer, (2011)A Fast Algorithm for Large Common Connected Induced Subgraphs.A. Conte, R. Grossi, A. Marino, L. Tattini, and L. Versari. AlCoB, volume 10252 of Lecture Notes in Computer Science, page 62-74. Springer, (2017)Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs.A. Conte, M. Kanté, A. Marino, and T. Uno. IWOCA, volume 11638 of Lecture Notes in Computer Science, page 148-159. Springer, (2019)Enumerating Cyclic Orientations of a Graph.A. Conte, R. Grossi, A. Marino, and R. Rizzi. IWOCA, volume 9538 of Lecture Notes in Computer Science, page 88-99. Springer, (2015)Efficient Bubble Enumeration in Directed Graphs.E. Birmelé, P. Crescenzi, R. Ferreira, R. Grossi, V. Lacroix, A. Marino, N. Pisanti, G. Sacomoto, and M. Sagot. SPIRE, volume 7608 of Lecture Notes in Computer Science, page 118-129. Springer, (2012)