Lower And Upper Bounds On The Randomness Complexity Of Private Computations Of And | 0 | 0.34 | 2021 |
Sublinear Random Access Generators for Preferential Attachment Graphs | 0 | 0.34 | 2021 |
Fully decentralized computation of aggregates over data streams | 1 | 0.48 | 2011 |
On Delivery Times in Packet Networks under Adversarial Traffic | 7 | 0.49 | 2006 |
Lower bounds on the amount of randomness in private computation | 5 | 0.44 | 2003 |