- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| i12 |      | Grant Schoenebeck: Potential Networks, Contagious Communities, and Understanding Social Network Structure. CoRR abs/1304.1845 (2013) |
| 2012 | ||
| j2 | | Grant Schoenebeck, Salil P. Vadhan: The Computational Complexity of Nash Equilibria in Concisely Represented Games. TOCT 4(2): 4 (2012) |
| c15 | | Sanjeev Arora, Rong Ge, Sushant Sachdeva, Grant Schoenebeck: Finding overlapping communities in social networks: toward a rigorous approach. ACM Conference on Electronic Commerce 2012: 37-54 |
| c14 | | Aaron Roth, Grant Schoenebeck: Conducting truthful surveys, cheaply. ACM Conference on Electronic Commerce 2012: 826-843 |
| i11 | | |
| 2011 | ||
| c13 | | Thomas Holenstein, Grant Schoenebeck: General Hardness Amplification of Predicates and Puzzles - (Extended Abstract). TCC 2011: 19-36 |
| c12 | | Rafael M. Frongillo, Grant Schoenebeck, Omer Tamuz: Social Learning in a Changing World. WINE 2011: 146-157 |
| i10 | | Rafael M. Frongillo, Grant Schoenebeck, Omer Tamuz: Social Learning in a Changing World. CoRR abs/1109.5482 (2011) |
| i9 | | Sanjeev Arora, Rong Ge, Sushant Sachdeva, Grant Schoenebeck: Finding Overlapping Communities in Social Networks: Toward a Rigorous Approach. CoRR abs/1112.1831 (2011) |
| 2010 | ||
| j1 | | Sarita Yardi, Daniel M. Romero, Grant Schoenebeck, Danah Boyd: Detecting Spam in a Twitter Network. First Monday 15(1) (2010) |
| c11 | | Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman: Optimal Testing of Reed-Muller Codes. FOCS 2010: 488-497 |
| c10 | | |
| c9 | | Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman: Optimal Testing of Reed-Muller Codes. Property Testing 2010: 269-275 |
| c8 | | Anupam Gupta, Aaron Roth, Grant Schoenebeck, Kunal Talwar: Constrained Non-monotone Submodular Maximization: Offline and Secretary Algorithms. WINE 2010: 246-257 |
| i8 | | Thomas Holenstein, Grant Schoenebeck: General Hardness Amplification of Predicates and Puzzles. CoRR abs/1002.3534 (2010) |
| i7 | | Anupam Gupta, Aaron Roth, Grant Schoenebeck, Kunal Talwar: Constrained Non-Monotone Submodular Maximization: Offline and Secretary Algorithms. CoRR abs/1003.1517 (2010) |
| 2009 | ||
| c7 | | Constantinos Daskalakis, Grant Schoenebeck, Gregory Valiant, Paul Valiant: On the complexity of Nash equilibria of action-graph games. SODA 2009: 710-719 |
| i6 | | Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman: Optimal Testing of Reed-Muller Codes. CoRR abs/0910.0641 (2009) |
| i5 | | Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman: Optimal testing of Reed-Muller codes. Electronic Colloquium on Computational Complexity (ECCC) 16: 86 (2009) |
| 2008 | ||
| c6 | | |
| i4 | | Constantinos Daskalakis, Grant Schoenebeck, Gregory Valiant, Paul Valiant: On the Complexity of Nash Equilibria of Action-Graph Games. CoRR abs/0802.1604 (2008) |
| 2007 | ||
| c5 | | Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani: A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover. IEEE Conference on Computational Complexity 2007: 205-216 |
| c4 | | Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani: Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut. STOC 2007: 302-310 |
| 2006 | ||
| c3 | | Halldor Isak Gylfason, Omar Khan, Grant Schoenebeck: CHORA: Expert-Based P2P Web Search. AP2PC 2006: 74-85 |
| c2 | | Grant Schoenebeck, Salil P. Vadhan: The computational complexity of nash equilibria in concisely represented games. ACM Conference on Electronic Commerce 2006: 270-279 |
| i3 | | Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani: A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover. Electronic Colloquium on Computational Complexity (ECCC) 13(098) (2006) |
| i2 | | Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani: Tight Integrality Gaps for Lovasz-Schrijver LP Relaxations of Vertex Cover and Max Cut. Electronic Colloquium on Computational Complexity (ECCC) 13(132) (2006) |
| 2005 | ||
| i1 | | Grant Schoenebeck, Salil P. Vadhan: The Computational Complexity of Nash Equilibria in Concisely Represented Games. Electronic Colloquium on Computational Complexity (ECCC)(052) (2005) |
| 2004 | ||
| c1 | | |
Colors in the list of coauthors
Last update Thu May 23 21:34:22 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page