1 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.DS2016★ 1 cited
Near-Optimal Induced Universal Graphs for Bounded Degree Graphs
Mikkel Abrahamsen, Stephen Alstrup, Jacob Holm +2
A graph is an induced universal graph for a family of graphs if every graph in is a vertex-induced subgraph of . For the family of all undirected graphs on verti…
cs.DB2015★ 1 cited
Association Rule Mining using Maximum Entropy
Rasmus Pagh, Morten Stöckel
Recommendations based on behavioral data may be faced with ambiguous statistical evidence. We consider the case of association rules, relevant e.g.~for query and product recommenda…
cs.DS2014
The Input/Output Complexity of Sparse Matrix Multiplication
Rasmus Pagh, Morten Stöckel
We consider the problem of multiplying sparse matrices (over a semiring) where the number of non-zero entries is larger than main memory. In the classical paper of Hong and Kung (S…