5 citations · 5 across the 3 of their papers we have counts for
3 papers
A Block-Based Triangle Counting Algorithm on Heterogeneous Environments
Abdurrahman Yaşar, Sivasankaran Rajamanickam, Jonathan Berry +1
Triangle counting is a fundamental building block in graph algorithms. In this paper, we propose a block-based triangle counting algorithm to reduce data movement during both seque…
The Online Event-Detection Problem
Michael A. Bender, Jonathan W. Berry, Martin Farach-Colton +5
Given a stream , a -heavy hitter is an item that occurs at least times in . The problem of finding heavy-hitters has been extensively stu…
Why do simple algorithms for triangle enumeration work in the real world?
Jonathan W. Berry, Luke A. Fostvedt, Daniel J. Nordman +3
Listing all triangles is a fundamental graph operation. Triangles can have important interpretations in real-world graphs, especially social and other interaction networks. Despite…