| Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based ℓ1-Oblivious Routing | 0 | 0.34 | 2022 |
| On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer | 0 | 0.34 | 2022 |
| Minor Sparsifiers and the Distributed Laplacian Paradigm | 0 | 0.34 | 2021 |
| String Matching with Wildcards in the Massively Parallel Computation Model | 0 | 0.34 | 2021 |
| Fully Dynamic s-t Edge Connectivity in Subpolynomial Time (Extended Abstract) | 1 | 0.35 | 2021 |
| On the Hardness of Massively Parallel Computation | 0 | 0.34 | 2020 |
| Massively Parallel Approximation Algorithms for Edit Distance and Longest Common Subsequence. | 0 | 0.34 | 2019 |
| Approximating LCS in Linear Time - Beating the √n Barrier. | 2 | 0.38 | 2019 |
| Approximation Algorithms for LCS and LIS with Truly Improved Running Times | 1 | 0.36 | 2019 |
| Probability-Revealing Samples. | 0 | 0.34 | 2018 |
| The query complexity of graph isomorphism: bypassing distribution testing lower bounds. | 0 | 0.34 | 2018 |
| The complexity of optimal multidimensional pricing for a unit-demand buyer. | 1 | 0.36 | 2018 |
| Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs. | 1 | 0.35 | 2018 |
| Linear regression without correspondence. | 3 | 0.49 | 2017 |
| Efficient massively parallel methods for dynamic programming. | 8 | 0.46 | 2017 |
| Correspondence retrieval. | 0 | 0.34 | 2017 |
| Structure and automorphisms of primitive coherent configurations | 0 | 0.34 | 2015 |
| On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms | 4 | 0.44 | 2015 |
| Faster Canonical Forms for Primitive Coherent Configurations: Extended Abstract | 1 | 0.37 | 2015 |
| Near-Optimal Density Estimation in Near-Linear Time Using Variable-Width Histograms. | 13 | 0.67 | 2014 |
| Distinguishing properties and applications of higher order derivatives of Boolean functions. | 1 | 0.41 | 2014 |
| A Composition Theorem for Parity Kill Number | 0 | 0.34 | 2013 |
| The complexity of optimal multidimensional pricing | 2 | 0.36 | 2013 |
| Efficient density estimation via piecewise polynomial approximation | 25 | 1.13 | 2013 |
| Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systems | 6 | 0.71 | 2013 |
| Faster Canonical Forms for Strongly Regular Graphs | 7 | 0.67 | 2013 |
| Information dissemination via random walks in d-dimensional space | 6 | 0.55 | 2012 |
| Learning mixtures of structured distributions over discrete domains | 31 | 1.47 | 2012 |
| Participation Maximization Based on Social Influence in Online Discussion Forums. | 1 | 0.35 | 2011 |
| Optimal pricing in social networks with incomplete information | 10 | 0.64 | 2011 |
| Influence Maximization in Social Networks When Negative Opinions May Emerge and Propagate. | 108 | 3.53 | 2011 |
| Community detection in social networks through community formation games | 6 | 0.50 | 2011 |
| Asymptotically optimal strategy-proof mechanisms for two-facility games | 60 | 3.45 | 2010 |
| Distinguishing Properties of Higher Order Derivatives of Boolean Functions. | 1 | 0.36 | 2010 |
| Pricing in Social Networks: Equilibrium and Revenue Maximization | 1 | 0.41 | 2010 |
| A game-theoretic framework to identify overlapping communities in social networks | 71 | 2.57 | 2010 |
| Improved Integral Attacks on MISTY1 | 7 | 0.50 | 2009 |
| The Key-Dependent Attack on Block Ciphers | 10 | 0.55 | 2009 |
