| EDEN: Communication-Efficient and Robust Distributed Mean Estimation for Federated Learning. | 0 | 0.34 | 2022 |
| Viewpoint Algorithms with Predictions | 0 | 0.34 | 2022 |
| Improved Sublinear Time Algorithm for Longest Increasing Subsequence. | 1 | 0.36 | 2021 |
| Partitioned Learned Bloom Filters. | 0 | 0.34 | 2021 |
| Putting The "Learning" Into Learning-Augmented Algorithms For Frequency Estimation | 0 | 0.34 | 2021 |
| How to send a real number using a single bit (and some shared randomness) | 0 | 0.34 | 2021 |
| Clustering with a faulty oracle | 0 | 0.34 | 2020 |
| PINT: Probabilistic In-band Network Telemetry | 11 | 0.55 | 2020 |
| DISCOvering the heavy hitters with disaggregated sketches | 0 | 0.34 | 2020 |
| Optimal Learning of Joint Alignments with a Faulty Oracle | 0 | 0.34 | 2020 |
| Detecting routing loops in the data plane | 0 | 0.34 | 2020 |
| Arithmetic Progression Hypergraphs: Examining the Second Moment Method. | 0 | 0.34 | 2019 |
| Online Pandora's Boxes and Bandits. | 0 | 0.34 | 2019 |
| Scheduling with Predictions and the Price of Misprediction. | 0 | 0.34 | 2019 |
| A Bayesian Nonparametric View on Count-Min Sketch. | 0 | 0.34 | 2018 |
| Weightless: Lossy Weight Encoding For Deep Neural Network Compression. | 0 | 0.34 | 2018 |
| Metric Sublinear Algorithms via Linear Sampling | 0 | 0.34 | 2018 |
| A Model for Learned Bloom Filters and Related Structures. | 3 | 0.41 | 2018 |
| Reconciling Graphs and Sets of Sets | 1 | 0.40 | 2017 |
| Theory and Applications of Hashing (Dagstuhl Seminar 17181). | 0 | 0.34 | 2017 |
| Predicting Positive and Negative Links with Noisy Queries: Theory & Practice. | 1 | 0.38 | 2017 |
| Compresso: Efficient Compression of Segmentation Data for Connectomics. | 0 | 0.34 | 2017 |
| Auditable Data Structures | 0 | 0.34 | 2017 |
| Predicting Signed Edges with O(n log n) Queries. | 0 | 0.34 | 2016 |
| Models And Algorithms For Graph Watermarking | 5 | 0.48 | 2016 |
| Technical Perspective: Catching lies (and mistakes) in offloaded computation | 0 | 0.34 | 2016 |
| 2-Bit Random Projections, NonLinear Estimators, and Approximate Near Neighbor Search. | 0 | 0.34 | 2016 |
| Analyzing distributed Join-Idle-Queue: A fluid limit approach | 3 | 0.43 | 2016 |
| OMASS: One Memory Access Set Separation. | 1 | 0.34 | 2016 |
| Better bounds for coalescing-branching random walks. | 2 | 0.43 | 2016 |
| A New Approach to Analyzing Robin Hood Hashing. | 1 | 0.34 | 2016 |
| Measuring dependence powerfully and equitably | 2 | 0.45 | 2015 |
| Equitability, Interval Estimation, and Statistical Power | 3 | 0.46 | 2015 |
| Multi-party set reconciliation using characteristic polynomials | 1 | 0.35 | 2014 |
| Parallel Peeling Algorithms | 5 | 0.42 | 2014 |
| Improving the performance of Invertible Bloom Lookup Tables | 2 | 0.44 | 2014 |
| Repeated deletion channels | 2 | 0.42 | 2014 |
| Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket. | 0 | 0.34 | 2014 |
| Coding for Random Projections. | 12 | 0.71 | 2014 |
| Cuckoo Filter: Practically Better Than Bloom. | 85 | 2.48 | 2014 |
| External-Memory Multimaps | 1 | 0.35 | 2013 |
| The groupon effect on yelp ratings: a root cause analysis | 29 | 1.68 | 2012 |
| Biff (Bloom filter) codes: Fast error correction for large data sets | 15 | 0.74 | 2012 |
| An economic analysis of user-privacy options in ad-supported services | 0 | 0.34 | 2012 |
| Practical verified computation with streaming interactive proofs | 70 | 1.80 | 2012 |
| Practical oblivious storage | 22 | 0.87 | 2012 |
| Privacy-preserving group data access via stateless oblivious RAM simulation | 100 | 3.71 | 2012 |
| Cache-Oblivious dictionaries and multimaps with negligible failure probability | 2 | 0.38 | 2012 |
| Balanced allocations and double hashing | 4 | 0.46 | 2012 |
| Information dissemination via random walks in d-dimensional space | 6 | 0.55 | 2012 |
