| Label differential privacy via clustering | 0 | 0.34 | 2022 |
| Massively Parallel Computation Via Remote Memory Access | 0 | 0.34 | 2021 |
| Extreme K-Center Clustering | 0 | 0.34 | 2021 |
| Almost Linear Time Density Level Set Estimation Via Dbscan | 0 | 0.34 | 2021 |
| Feature Cross Search via Submodular Optimization. | 0 | 0.34 | 2021 |
| Adaptivity in Adaptive Submodularity. | 0 | 0.34 | 2021 |
| Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice. | 0 | 0.34 | 2020 |
| Contextual Reserve Price Optimization in Auctions via Mixed Integer Programming | 0 | 0.34 | 2020 |
| Online Pandora's Boxes and Bandits. | 0 | 0.34 | 2019 |
| Categorical Feature Compression via Submodular Optimization. | 0 | 0.34 | 2019 |
| Locality-Sensitive Hashing for f-Divergences: Mutual Information Loss and Beyond | 0 | 0.34 | 2019 |
| Seeding with Costly Network Information. | 0 | 0.34 | 2019 |
| Massively Parallel Computation via Remote Memory Access. | 1 | 0.34 | 2019 |
| Near-Optimal Massively Parallel Graph Connectivity | 1 | 0.34 | 2019 |
| On-Device Algorithms for Public-Private Data with Absolute Privacy | 1 | 0.36 | 2019 |
| Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models. | 0 | 0.34 | 2018 |
| Metric Sublinear Algorithms via Linear Sampling | 0 | 0.34 | 2018 |
| Optimal Distributed Submodular Optimization via Sketching. | 2 | 0.36 | 2018 |
| Parallel and Streaming Algorithms for K-Core Decomposition. | 0 | 0.34 | 2018 |
| Market Pricing for Data Streams. | 0 | 0.34 | 2017 |
| Almost Optimal Streaming Algorithms for Coverage Problems. | 6 | 0.41 | 2017 |
| Beating 1-1/e for Ordered Prophets. | 12 | 0.72 | 2017 |
| Brief Announcement: Graph Matching in Massive Datasets. | 2 | 0.37 | 2017 |
| A Study of Compact Reserve Pricing Languages. | 0 | 0.34 | 2017 |
| Bi-Objective Online Matching and Submodular Allocations. | 0 | 0.34 | 2016 |
| Beating Ratio 0.5 for Weighted Oblivious Matching Problems. | 3 | 0.41 | 2016 |
| Distributed Coverage Maximization via Sketching. | 0 | 0.34 | 2016 |
| Brief Announcement: Applications of Uniform Sampling: Densest Subgraph and Beyond. | 5 | 0.40 | 2016 |
| Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams. | 12 | 0.56 | 2016 |
| Selling Tomorrow's Bargains Today | 0 | 0.34 | 2015 |
| Streaming algorithms for estimating the matching size in planar graphs and beyond | 20 | 0.86 | 2015 |
| Online Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models | 4 | 0.47 | 2015 |
| Prophet Secretary. | 0 | 0.34 | 2015 |
| Kernelization via Sampling with Applications to Dynamic Graph Streams | 8 | 0.49 | 2015 |
| Applications of Uniform Sampling: Densest Subgraph and Beyond | 7 | 0.73 | 2015 |
| Brief Announcement: New Streaming Algorithms for Parameterized Maximal Matching & Beyond | 1 | 0.38 | 2015 |
| A Tight Algorithm for Strongly Connected Steiner Subgraph On Two Terminals With Demands | 0 | 0.34 | 2015 |
| Some Bounds For The Signed Edge Domination Number Of A Graph | 0 | 0.34 | 2014 |
| A Tight Algorithm For Strongly Connected Steiner Subgraph On Two Terminals With Demands | 3 | 0.39 | 2014 |
