47 citations · 100 across the 13 of their papers we have counts for
Showing 2011 · cs.DSShow all
2 papers · 2 filters
cs.DS2011★ 3 cited
Colorful Triangle Counting and a MapReduce Implementation
Rasmus Pagh, Charalampos E. Tsourakakis
In this note we introduce a new randomized algorithm for counting triangles in graphs. We show that under mild conditions, the estimate of our algorithm is strongly concentrated ar…
cs.DS2011★ 4 cited
A New Data Layout For Set Intersection on GPUs
Rasmus Resen Amossen, Rasmus Pagh
Set intersection is the core in a variety of problems, e.g. frequent itemset mining and sparse boolean matrix multiplication. It is well-known that large speed gains can, for some…