2 citations · 4 across the 10 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018
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…
cs.GT2018
Efficient Rational Proofs with Strong Utility-Gap Guarantees
Jing Chen, Samuel McCauley, Shikha Singh
As modern computing moves towards smaller devices and powerful cloud platforms, more and more computation is being delegated to powerful service providers. Interactive proofs are a…