| Objective-Based Hierarchical Clustering Of Deep Embedding Vectors | 0 | 0.34 | 2021 |
| Bisect and Conquer - Hierarchical Clustering via Max-Uncut Bisection. | 0 | 0.34 | 2020 |
| Fast Fourier Sparsity Testing. | 0 | 0.34 | 2020 |
| Multi-Dimensional Balanced Graph Partitioning via Projected Gradient Descent. | 0 | 0.34 | 2019 |
| Adversarially Robust Submodular Maximization under Knapsack Constraints. | 0 | 0.34 | 2019 |
| Multi-Dimensional Balanced Graph Partitioning via Projected Gradient Descent. | 2 | 0.39 | 2019 |
| Approximate F2-Sketching of Valuation Functions. | 0 | 0.34 | 2019 |
| Optimality of Linear Sketching under Modular Updates. | 0 | 0.34 | 2018 |
| Massively Parallel Algorithms and Hardness for Single-Linkage Clustering under 𝓁p Distances. | 0 | 0.34 | 2018 |
| Linear Sketching over F_2. | 0 | 0.34 | 2018 |
| Massively Parallel Algorithms and Hardness for Single-Linkage Clustering Under $\ell_p$-Distances. | 1 | 0.35 | 2017 |
| Linear Sketching over $\mathbb F_2$. | 0 | 0.34 | 2016 |
| Private Algorithms For The Protected In Social Network Search | 7 | 0.78 | 2016 |
| Maximum Matchings in Dynamic Graph Streams and the Simultaneous Communication Model. | 19 | 0.63 | 2016 |
| Amplification of One-Way Information Complexity via Codes and Noise Sensitivity. | 1 | 0.37 | 2015 |
| Tight Bounds for Linear Sketches of Approximate Matchings | 9 | 0.50 | 2015 |
| Privacy for the Protected (Only) | 0 | 0.34 | 2015 |
| Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs | 12 | 0.55 | 2015 |
| Steiner transitive-closure spanners of low-dimensional posets | 2 | 0.40 | 2014 |
| Parallel algorithms for geometric graph problems | 26 | 0.91 | 2014 |
| Online Algorithms for Machine Minimization. | 4 | 0.55 | 2014 |
| Lp-testing. | 2 | 0.36 | 2014 |
| Going for Speed: Sublinear Algorithms for Dense r-CSPs. | 0 | 0.34 | 2014 |
| Near Optimal LP Rounding Algorithm for Correlation Clustering on Complete and Complete k-partite Graphs. | 0 | 0.34 | 2014 |
| Beyond set disjointness: the communication complexity of finding the intersection | 7 | 0.52 | 2014 |
| Approximation algorithms for spanner problems and Directed Steiner Forest | 9 | 0.56 | 2013 |
| The Round Complexity of Small Set Intersection | 0 | 0.34 | 2013 |
| Beating the direct sum theorem in communication complexity with implications for sketching | 11 | 0.67 | 2013 |
| Lower Bounds for Testing Properties of Functions over Hypergrid Domains | 3 | 0.38 | 2013 |
| Accurate and efficient private release of datacubes and contingency tables | 19 | 0.77 | 2013 |
| Primal-Dual Approximation Algorithms for Node-Weighted Network Design in Planar Graphs. | 2 | 0.37 | 2012 |
| Learning pseudo-Boolean k-DNF and submodular functions | 9 | 0.50 | 2012 |
| Private Analysis of Graph Structure | 39 | 0.97 | 2011 |
| Private Analysis of Graph Structure. | 0 | 0.34 | 2011 |
| Improved approximation for the directed spanner problem | 11 | 0.54 | 2011 |
| Steiner Transitive-Closure Spanners of d-Dimensional Posets | 2 | 0.36 | 2010 |
| Finding Efficient Circuits Using SAT-Solvers | 12 | 0.84 | 2009 |
