192 citations · 271 across the 11 of their papers we have counts for
3 papers · 1 filter
Connected Components for Infinite Graph Streams: Theory and Practice
Jonathan W. Berry, Cynthia A Phillips, Alexandra M. Porter
Motivated by the properties of unending real-world cybersecurity streams, we present a new graph streaming model: XStream. We maintain a streaming graph and its connected component…
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…