9 citations · 11 across the 7 of their papers we have counts for
7 papers
On Parallelizing Matrix Multiplication by the Column-Row Method
Andrea Campagna, Konstantin Kutzkov, Rasmus Pagh
We consider the problem of sparse matrix multiplication by the column row method in a distributed setting where the matrix product is not necessarily sparse. We present a surprisin…
Local reconstructors and tolerant testers for connectivity and diameter
Andrea Campagna, Alan Guo, Ronitt Rubinfeld
A local property reconstructor for a graph property is an algorithm which, given oracle access to the adjacency list of a graph that is "close" to having the property, provides ora…
On Finding Similar Items in a Stream of Transactions
Andrea Campagna, Rasmus Pagh
While there has been a lot of work on finding frequent itemsets in transaction data streams, none of these solve the problem of finding similar pairs according to standard similari…
On Finding Frequent Patterns in Event Sequences
Andrea Campagna, Rasmus Pagh
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some maximum le…
Better size estimation for sparse matrix products
Rasmus Resen Amossen, Andrea Campagna, Rasmus Pagh
We consider the problem of doing fast and reliable estimation of the number of non-zero entries in a sparse boolean matrix product. This problem has applications in databases and c…
On Finding Frequent Patterns in Directed Acyclic Graphs
Andrea Campagna, Rasmus Pagh
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some maximum le…