| 2013 | ||
|---|---|---|
| j5 | Peter Kinnaird, Inbal Talgam-Cohen: 'Information wants to be free'. ACM Crossroads 19(3): 4-5 (2013) | |
| i3 | ||
| 2012 | ||
| j4 | ||
| j3 | ||
| j2 | ||
| c5 | Hu Fu, Patrick R. Jordan, Mohammad Mahdian, Uri Nadav, Inbal Talgam-Cohen, Sergei Vassilvitskii: Ad auctions with data. INFOCOM Workshops 2012: 184-189 | |
| c4 | Hu Fu, Patrick R. Jordan, Mohammad Mahdian, Uri Nadav, Inbal Talgam-Cohen, Sergei Vassilvitskii: Ad Auctions with Data. SAGT 2012: 168-179 | |
| c3 | Tim Roughgarden, Inbal Talgam-Cohen, Qiqi Yan: Supply-limiting mechanisms. ACM Conference on Electronic Commerce 2012: 844-861 | |
| 2010 | ||
| j1 | Michael S. Bernstein, Inbal Talgam-Cohen: Human computation and crowdsourcing. ACM Crossroads 17(2): 6 (2010) | |
| c2 | Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar: Vertex Sparsifiers: New Results from Old Techniques. APPROX-RANDOM 2010: 152-165 | |
| c1 | Uriel Feige, Inbal Talgam-Cohen: A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium. SAGT 2010: 138-149 | |
| i2 | Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar: Vertex Sparsifiers: New Results from Old Techniques. CoRR abs/1006.4586 (2010) | |
| i1 | Uriel Feige, Inbal Talgam-Cohen: A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium. CoRR abs/1007.3886 (2010) | |
Data released under the ODC-BY 1.0 license — See also our legal information page