| BONUS! Maximizing Surprise | 0 | 0.34 | 2022 |
| Adaptive Greedy versus Non-Adaptive Greedy for Influence Maximization | 0 | 0.34 | 2022 |
| Optimal Local Bayesian Differential Privacy over Markov Chains. | 0 | 0.34 | 2022 |
| A System-Level Analysis of Conference Peer Review | 0 | 0.34 | 2022 |
| Think globally, act locally: On the optimal seeding for nonsubmodular influence maximization | 0 | 0.34 | 2022 |
| Bayesian Persuasion in Sequential Trials | 0 | 0.34 | 2021 |
| Information Elicitation from Rowdy Crowds | 0 | 0.34 | 2021 |
| Information Elicitation Mechanisms For Statistical Estimation | 0 | 0.34 | 2020 |
| Limitations of Greed: Influence Maximization in Undirected Networks Re-visited | 0 | 0.34 | 2020 |
| Influence Maximization on Undirected Graphs: Toward Closing the (1-1/e) Gap | 0 | 0.34 | 2020 |
| Two Strongly Truthful Mechanisms for Three Heterogeneous Agents Answering One Question. | 0 | 0.34 | 2020 |
| Adaptive Greedy Versus Non-Adaptive Greedy For Influence Maximization | 1 | 0.35 | 2020 |
| Escaping Saddle Points in Constant Dimensional Spaces: An Agent-based Modeling Perspective | 0 | 0.34 | 2020 |
| Social Learning With Questions | 1 | 0.36 | 2019 |
| Think Globally, Act Locally - On the Optimal Seeding for Nonsubmodular Influence Maximization. | 0 | 0.34 | 2019 |
| The Volatility of Weak Ties: Co-evolution of Selection and Influence in Social Networks | 0 | 0.34 | 2019 |
| Influence Maximization on Undirected Graphs: Towards Closing the (1-1/e) Gap | 0 | 0.34 | 2019 |
| Contention-aware lock scheduling for transactional databases | 3 | 0.37 | 2018 |
| Consensus of Interacting Particle Systems on Erdös-Rényi Graphs. | 0 | 0.34 | 2018 |
| Contention-Aware Lock Scheduling for Transactional Databases. | 0 | 0.34 | 2018 |
| Eliciting Expertise without Verification. | 0 | 0.34 | 2018 |
| Characterizing Adversarial Subspaces Using Local Intrinsic Dimensionality. | 38 | 0.92 | 2018 |
| Optimizing Bayesian Information Revelation Strategy in Prediction Markets: the Alice Bob Alice Case. | 1 | 0.39 | 2018 |
| Equilibrium Selection in Information Elicitation without Verification via Information Monotonicity. | 2 | 0.38 | 2018 |
| Social Learning with Questions. | 0 | 0.34 | 2018 |
| Water from Two Rocks: Maximizing the Mutual Information. | 2 | 0.36 | 2018 |
| Cascades and Myopic Routing in Nonhomogeneous Kleinberg's Small World Model. | 1 | 0.35 | 2017 |
| Beyond Worst-Case (In)approximability of Nonsubmodular Influence Maximization. | 0 | 0.34 | 2017 |
| How Complex Contagions Spread Quickly in Preferential Attachment Models and Other Time-Evolving Networks. | 3 | 0.43 | 2017 |
| A Top-Down Approach to Achieving Performance Predictability in Database Systems. | 5 | 0.38 | 2017 |
| Engineering Agreement: The Naming Game with Asymmetric and Heterogeneous Agents. | 0 | 0.34 | 2017 |
| Don't Be Greedy: Leveraging Community Structure to Find High Quality Seed Sets for Influence Maximization. | 1 | 0.64 | 2017 |
| Complex Contagions on Configuration Model Graphs with a Power-Law Degree Distribution. | 0 | 0.34 | 2016 |
| Sybil Detection Using Latent Network Structure. | 2 | 0.45 | 2016 |
| Putting Peer Prediction Under the Micro(economic)scope and Making Truth-telling Focal. | 7 | 0.46 | 2016 |
| General Threshold Model for Social Cascades: Analysis and Simulations. | 1 | 0.37 | 2016 |
| A Framework For Designing Information Elicitation Mechanisms That Reward Truth-telling. | 1 | 0.35 | 2016 |
| Graph Isomorphism and the Lasserre Hierarchy. | 4 | 0.56 | 2014 |
| Better approximation algorithms for the graph diameter | 4 | 0.41 | 2014 |
| Buying private data without verification | 7 | 0.51 | 2014 |
| Complex Contagions in Kleinberg's Small World Model | 4 | 0.44 | 2014 |
| How Complex Contagions Spread and Spread Quickly. | 1 | 0.37 | 2014 |
| Characterizing strategic cascades on networks | 3 | 0.44 | 2013 |
| Potential networks, contagious communities, and understanding social network structure | 9 | 0.54 | 2013 |
| The Computational Complexity of Nash Equilibria in Concisely Represented Games | 29 | 2.18 | 2012 |
| Finding overlapping communities in social networks: toward a rigorous approach | 25 | 1.03 | 2012 |
| Conducting truthful surveys, cheaply | 20 | 1.40 | 2012 |
| General Hardness Amplification of Predicates and Puzzles - (Extended Abstract) | 1 | 0.35 | 2011 |
| Social learning in a changing world | 5 | 0.80 | 2011 |
| Constrained non-monotone submodular maximization: offline and secretary algorithms | 43 | 1.92 | 2010 |
