How to Store a Random Walk. | 0 | 0.34 | 2020 |
Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs. | 1 | 0.35 | 2018 |
Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation. | 1 | 0.35 | 2017 |
Coding with asymmetric prior knowledge. | 0 | 0.34 | 2017 |
The Minrank of Random Graphs. | 3 | 0.42 | 2016 |
Amortized Dynamic Cell-Probe Lower Bounds from Four-Party Communication | 4 | 0.44 | 2016 |
Distributed Signaling Games | 0 | 0.34 | 2016 |
The Simultaneous Communication of Disjointness with Applications to Data Streams. | 6 | 0.45 | 2015 |
Dictatorship is the Most Informative Balanced Function at the Extremes. | 0 | 0.34 | 2015 |
Display Advertising with Information Mediators. | 0 | 0.34 | 2014 |
Direct product via round-preserving compression | 11 | 0.81 | 2013 |
Information Lower Bounds via Self-reducibility. | 2 | 0.38 | 2012 |
Approximating the influence of monotone boolean functions in O(√n) query complexity | 6 | 0.58 | 2012 |
A discrepancy lower bound for information complexity | 14 | 0.63 | 2012 |
Approximating the Influence of a monotone Boolean function in O(\sqrt{n}) query complexity | 1 | 0.36 | 2011 |