Author of the publication

Centrality Measures on Big Graphs: Exact, Approximated, and Distributed Algorithms.

, , and . WWW (Companion Volume), page 1017-1020. ACM, (2016)

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.

 

Other publications of authors with the same name

Wiggins: Detecting Valuable Information in Dynamic Networks Using Limited Resources., , and . WSDM, page 677-686. ACM, (2016)ProSecCo: Progressive Sequence Mining with Convergence Guarantees., , and . ICDM, page 417-426. IEEE Computer Society, (2018)ProSecCo: progressive sequence mining with convergence guarantees., , and . Knowl. Inf. Syst., 62 (4): 1313-1340 (2020)MCRapper: Monte-Carlo Rademacher Averages for Poset Families and Approximate Pattern Mining., , , and . ACM Trans. Knowl. Discov. Data, 16 (6): 124:1-124:29 (2022)Finding the True Frequent Itemsets., and . SDM, page 497-505. SIAM, (2014)CaDET: interpretable parametric conditional density estimation with decision trees and forests., and . Mach. Learn., 108 (8-9): 1613-1634 (2019)The VC-Dimension of SQL Queries and Selectivity Estimation through Sampling., , , , and . ECML/PKDD (2), volume 6912 of Lecture Notes in Computer Science, page 661-676. Springer, (2011)ABRA: Approximating Betweenness Centrality in Static and Dynamic Graphs with Rademacher Averages., and . KDD, page 1145-1154. ACM, (2016)Hypothesis Testing and Statistically-sound Pattern Mining., , and . KDD, page 3215-3216. ACM, (2019)Bavarian: Betweenness Centrality Approximation with Variance-Aware Rademacher Averages., , and . KDD, page 196-206. ACM, (2021)