| Convergence of incentive-driven dynamics in Fisher markets | 0 | 0.34 | 2022 |
| Hadamard Extensions and the Identification of Mixtures of Product Distributions | 0 | 0.34 | 2022 |
| Source Identification for Mixtures of Product Distributions. | 0 | 0.34 | 2021 |
| Condition number bounds for causal inference. | 0 | 0.34 | 2021 |
| Edge Expansion and Spectral Gap of Nonnegative Matrices. | 0 | 0.34 | 2020 |
| Explicit Binary Tree Codes with Polylogarithmic Size Alphabet. | 0 | 0.34 | 2018 |
| Learning Dynamics and the Co-Evolution of Competing Sexual Species. | 2 | 0.40 | 2018 |
| Quasi-regular sequences and optimal schedules for security games. | 0 | 0.34 | 2018 |
| The duality gap for two-team zero-sum games | 1 | 0.36 | 2017 |
| Online codes for analog signals. | 0 | 0.34 | 2017 |
| Convergence of Incentive-Driven Dynamics in Fisher Markets. | 1 | 0.35 | 2017 |
| Market Dynamics of Best-Response with Lookahead. | 0 | 0.34 | 2016 |
| Extractors for Near Logarithmic Min-Entropy | 8 | 0.45 | 2016 |
| Stability of Causal Inference. | 1 | 0.35 | 2016 |
| The Adversarial Noise Threshold for Distributed Protocols. | 2 | 0.37 | 2016 |
| Analysis of a Classical Matrix Preconditioning Algorithm. | 3 | 0.56 | 2015 |
| Learning Arbitrary Statistical Mixtures of Discrete Distributions. | 3 | 0.50 | 2015 |
| Symbolic Integration and the Complexity of Computing Averages | 0 | 0.34 | 2015 |
| Tree codes and a conjecture on exponential sums | 14 | 0.73 | 2014 |
| Achieving Target Equilibria in Network Routing Games without Knowing the Latency Functions | 8 | 0.84 | 2014 |
| Network improvement for equilibrium routing | 2 | 0.42 | 2014 |
| Special Section on the Forty-Second Annual ACM Symposium on Theory of Computing (STOC 2010). | 0 | 0.34 | 2013 |
| A Two-Round Variant of EM for Gaussian Mixtures | 56 | 7.75 | 2013 |
| Clustering affine subspaces: hardness and algorithms | 0 | 0.34 | 2013 |
| The Network Improvement Problem for Equilibrium Routing. | 2 | 0.39 | 2013 |
| An MQ/Code Cryptosystem Proposal. | 0 | 0.34 | 2013 |
| Optimal Coding for Streaming Authentication and Interactive Communication | 21 | 0.97 | 2013 |
| Cryptography from tensor problems. | 0 | 0.34 | 2012 |
| Data reduction for weighted and outlier-resistant clustering | 15 | 0.77 | 2012 |
| The effectiveness of lloyd-type methods for the k-means problem | 96 | 8.63 | 2012 |
| Learning mixtures of arbitrary distributions over large discrete domains | 7 | 0.51 | 2012 |
| Allocation of Divisible Goods Under Lexicographic Preferences. | 13 | 0.94 | 2012 |
| The Quantifier Semigroup for Bipartite Graphs. | 0 | 0.34 | 2011 |
| Dimensionality reduction: beyond the Johnson-Lindenstrauss bound | 11 | 0.52 | 2011 |
| Clustering lines in high-dimensional space: Classification of incomplete data | 1 | 0.35 | 2010 |
| Volume in General Metric Spaces | 2 | 0.41 | 2010 |
| Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010 | 45 | 3.91 | 2010 |
| Error-correcting codes for automatic control | 24 | 1.22 | 2009 |
| Universal Immersion Spaces for Edge-Colored Graphs and Nearest-Neighbor Metrics | 0 | 0.34 | 2009 |
| Contraction and Expansion of Convex Sets | 2 | 0.39 | 2009 |
| Solvency Games | 1 | 0.39 | 2008 |
| On a capacitated multivehicle routing problem | 0 | 0.34 | 2008 |
| The Symmetric Group Defies Strong Fourier Sampling | 25 | 1.15 | 2008 |
| Analysis of incomplete data and an intrinsic-dimension Helly theorem | 4 | 0.43 | 2008 |
| On partitioning graphs via single commodity flows | 28 | 1.42 | 2008 |
| Approximation algorithms for labeling hierarchical taxonomies | 1 | 0.36 | 2008 |
| The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts | 12 | 0.64 | 2007 |
| Physical Limits of Heat-Bath Algorithmic Cooling | 6 | 3.26 | 2007 |
| A Probabilistic Analysis of EM for Mixtures of Separated, Spherical Gaussians | 48 | 2.67 | 2007 |
| Quantum Algorithms for Hidden Nonlinear Structures | 30 | 1.31 | 2007 |
