( en | de | ru )

 

Disambiguation of "Sanders, Geoffrey"

Author of the publication

copydeleteadd this publication to your clipboard
Estimating Edge-Local Triangle Count Heavy Hitters in Edge-Linear Time and Almost-Vertex-Linear Space.

, , and . HPEC, page 1-7. IEEE, (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.

Geoffrey Hinds

Geoffrey Coulson

Geoffrey Lund

Geoffrey Davis

Geoffrey Mwachala

 

Other publications of authors with the same name

Efficient Algebraic Multigrid Methods for Multilevel Overlapping Coclustering of User-Item Relationships., , , and . INFORMS J. Comput., 34 (3): 1587-1605 (2022)Scalable Edge Clustering of Dynamic Graphs via Weighted Line Graphs., , , and . CoRR, (2023)Distributed Kronecker Graph Generation with Ground Truth of Many Graph Properties., , , , , and . IPDPS Workshops, page 251-260. IEEE, (2019)Numerically approximating centrality for graph ranking guarantees., , , and . J. Comput. Sci., (2018)Towards A Massive-scale Distributed Neighborhood Graph Construction., , , , and . SC Workshops, page 728-738. ACM, (2023)Personalized Ranking in Dynamic Graphs Using Nonbacktracking Walks., , and . ICCS (2), volume 11537 of Lecture Notes in Computer Science, page 276-289. Springer, (2019)Mixed-Precision analysis of Householder QR Algorithms., , and . CoRR, (2019)You've Got Mail (YGM): Building Missing Asynchronous Communication Primitives., , , and . IPDPS Workshops, page 221-230. IEEE, (2019)Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees., , , and . SIGMOD Conference, page 1115-1131. ACM, (2020)Scaling Graph Clustering with Distributed Sketches., , and . HPEC, page 1-7. IEEE, (2020)