13 citations · 29 across the 9 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2022★ 1 cited
On the amortized complexity of approximate counting
Ishaq Aden-Ali, Yanjun Han, Jelani Nelson +1
Naively storing a counter up to value would require bits of memory. Nelson and Yu [NY22], following work of [Morris78], showed that if the query answers need only b…
cs.DS2019★ 2 cited
Domain Compression and its Application to Randomness-Optimal Distributed Goodness-of-Fit
Jayadev Acharya, Clément L. Canonne, Yanjun Han +2
We study goodness-of-fit of discrete distributions in the distributed setting, where samples are divided between multiple users who can only release a limited amount of information…