| Detecting spam in a twitter network S Yardi, D Romero, G Schoenebeck First Monday 15 (1), 2010 | 354 | 2010 |
| Linear level Lasserre lower bounds for certain k-CSPs G Schoenebeck 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 593-602, 2008 | 212 | 2008 |
| Constrained non-monotone submodular maximization: Offline and secretary algorithms A Gupta, A Roth, G Schoenebeck, K Talwar International Workshop on Internet and Network Economics, 246-257, 2010 | 126 | 2010 |
| Characterizing adversarial subspaces using local intrinsic dimensionality X Ma, B Li, Y Wang, SM Erfani, S Wijewickrema, G Schoenebeck, D Song, ... arXiv preprint arXiv:1801.02613, 2018 | 123 | 2018 |
| Better approximation algorithms for the graph diameter S Chechik, DH Larkin, L Roditty, G Schoenebeck, RE Tarjan, VV Williams Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014 | 78 | 2014 |
| The computational complexity of Nash equilibria in concisely represented games GR Schoenebeck, S Vadhan ACM Transactions on Computation Theory (TOCT) 4 (2), 4, 2012 | 77 | 2012 |
| Optimal testing of Reed-Muller codes A Bhattacharyya, S Kopparty, G Schoenebeck, M Sudan, D Zuckerman 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 488-497, 2010 | 74 | 2010 |
| Tight integrality gaps for Lovász-Schrijver LP relaxations of vertex cover and max cut G Schoenebeck, L Trevisan, M Tulsiani Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007 | 74 | 2007 |
| Conducting truthful surveys, cheaply A Roth, G Schoenebeck Proceedings of the 13th ACM Conference on Electronic Commerce, 826-843, 2012 | 55 | 2012 |
| Finding overlapping communities in social networks: toward a rigorous approach S Arora, R Ge, S Sachdeva, G Schoenebeck Proceedings of the 13th ACM Conference on Electronic Commerce, 37-54, 2012 | 52 | 2012 |
| A linear round lower bound for Lovász-Schrijver SDP relaxations of vertex cover G Schoenebeck, L Trevisan, M Tulsiani Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07 …, 2007 | 51 | 2007 |
| Reaching consensus on social networks E Mossel, G Schoenebeck | 41 | 2009 |
| Buying private data without verification A Ghosh, K Ligett, A Roth, G Schoenebeck Proceedings of the fifteenth ACM conference on Economics and computation …, 2014 | 38 | 2014 |
| Potential networks, contagious communities, and understanding social network structure G Schoenebeck Proceedings of the 22nd international conference on World Wide Web, 1123-1132, 2013 | 24 | 2013 |
| An information theoretic framework for designing information elicitation mechanisms that reward truth-telling Y Kong, G Schoenebeck ACM Transactions on Economics and Computation (TEAC) 7 (1), 2, 2019 | 23 | 2019 |
| Putting peer prediction under the micro (economic) scope and making truth-telling focal Y Kong, K Ligett, G Schoenebeck International Conference on Web and Internet Economics, 251-264, 2016 | 23 | 2016 |
| On the complexity of Nash equilibria of action-graph games C Daskalakis, G Schoenebeck, G Valiant, P Valiant Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009 | 23 | 2009 |
| How complex contagions spread quickly in preferential attachment models and other time-evolving networks R Ebrahimi, J Gao, G Ghasemiesfeh, G Schoenbeck IEEE Transactions on Network Science and Engineering 4 (4), 201-214, 2017 | 17 | 2017 |
| Social learning in a changing world RM Frongillo, G Schoenebeck, O Tamuz International Workshop on Internet and Network Economics, 146-157, 2011 | 17 | 2011 |
| Equilibrium selection in information elicitation without verification via information monotonicity Y Kong, G Schoenebeck arXiv preprint arXiv:1603.07751, 2016 | 14 | 2016 |
