23 citations · 65 across the 8 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2012★ 4 cited
Finding Connected Components on Map-reduce in Logarithmic Rounds
Vibhor Rastogi, Ashwin Machanavajjhala, Laukik Chitnis +1
Given a large graph G = (V,E) with millions of nodes and edges, how do we compute its connected components efficiently? Recent work addresses this problem in map-reduce, where a fu…
cs.DS2009
Succinct Coverage Oracles
Ioannis Antonellis, Anish Das Sarma, Shaddin Dughmi
In this paper, we identify a fundamental algorithmic problem that we term succinct dynamic covering (SDC), arising in many modern-day web applications, including ad-serving and onl…