PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Marino, Andrea"

Author of the publication

copydeleteadd this publication to your clipboard
The bow tie structure of the Bitcoin users graph.

, , and . Applied Network Science, 4 (1): 56:1-56:22 (2019)

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.

Univ. -Prof. Dr. -Ing. Andrea Beck University of Stuttgart

GALÆXI Validation: Taylor-Green Vortex, , , , , , , , and . Dataset, (2024)Related to: Kempf, Daniel et al. “GALÆXI: Solving complex compressible flows with high-order discontinuous Galerkin methods on accelerator-based systems.” (2024). arXiv: 2404.12703.
GALÆXI Validation: Taylor-Green Vortex, , , , , , , , and . Dataset, (2024)Related to: Kempf, Daniel et al. “GALÆXI: Solving complex compressible flows with high-order discontinuous Galerkin methods on accelerator-based systems.” (2024). arXiv: 2404.12703.GALÆXI Scaling, , , , , , , , and . Dataset, (2024)Related to: Kempf, Daniel et al. “GALÆXI: Solving complex compressible flows with high-order discontinuous Galerkin methods on accelerator-based systems.” (2024). arXiv: 2404.12703.GALÆXI Verification: Convergence Tests, , , , , , , , and . Dataset, (2024)Related to: Kempf, Daniel et al. “GALÆXI: Solving complex compressible flows with high-order discontinuous Galerkin methods on accelerator-based systems.” (2024). arXiv: 2404.12703.

Daniel Marino

Daniel Marino

Sebastian Marino University of Stuttgart

Dr. Andrea Thom University of Stuttgart

 

Other publications of authors with the same name

Smooth movement and Manhattan path based Random Waypoint mobility., , , , , and . Inf. Process. Lett., 111 (5): 239-246 (2011)The bow tie structure of the Bitcoin users graph., , and . Applied Network Science, 4 (1): 56:1-56:22 (2019)Detecting artificial behaviours in the Bitcoin users graph., , and . Online Social Networks and Media, (2017)On Computing the Diameter of Real-World Directed (Weighted) Graphs., , , and . 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., , , and . TAPAS, volume 6595 of Lecture Notes in Computer Science, page 92-103. Springer, (2011)A Fast Algorithm for Large Common Connected Induced Subgraphs., , , , and . 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., , , and . IWOCA, volume 11638 of Lecture Notes in Computer Science, page 148-159. Springer, (2019)Enumerating Cyclic Orientations of a Graph., , , and . IWOCA, volume 9538 of Lecture Notes in Computer Science, page 88-99. Springer, (2015)Efficient Bubble Enumeration in Directed Graphs., , , , , , , , and . SPIRE, volume 7608 of Lecture Notes in Computer Science, page 118-129. Springer, (2012)BUbiNG: massive crawling for the masses., , , and . WWW (Companion Volume), page 227-228. ACM, (2014)