| Using linear programming to decode binary linear codes J Feldman, MJ Wainwright, DR Karger IEEE Transactions on Information Theory 51 (3), 954-972, 2005 | 578 | 2005 |
| Growth codes: Maximizing sensor network data persistence A Kamra, V Misra, J Feldman, D Rubenstein Proceedings of the 2006 conference on Applications, technologies …, 2006 | 404 | 2006 |
| Online stochastic matching: Beating 1-1/e J Feldman, A Mehta, V Mirrokni, S Muthukrishnan 2009 50th Annual IEEE Symposium on Foundations of Computer Science, 117-126, 2009 | 371 | 2009 |
| Online stochastic packing applied to display ad allocation J Feldman, M Henzinger, N Korula, VS Mirrokni, C Stein Algorithms–ESA 2010: 18th Annual European Symposium, Liverpool, UK …, 2010 | 266 | 2010 |
| Decoding error-correcting codes via linear programming J Feldman Massachusetts Institute of Technology, 2003 | 255 | 2003 |
| On the capacity of secure network coding J Feldman, T Malkin, C Stein, RA Servedio Proc. 42nd Annual Allerton Conference on Communication, Control, and …, 2004 | 230 | 2004 |
| Online ad assignment with free disposal J Feldman, N Korula, V Mirrokni, S Muthukrishnan, M Pál Internet and Network Economics: 5th International Workshop, WINE 2009, Rome …, 2009 | 211 | 2009 |
| Budget optimization in search-based advertising auctions J Feldman, S Muthukrishnan, M Pal, C Stein Proceedings of the 8th ACM conference on Electronic commerce, 40-49, 2007 | 205 | 2007 |
| Yield optimization of display advertising with ad exchange S Balseiro, J Feldman, V Mirrokni, S Muthukrishnan Proceedings of the 12th ACM conference on Electronic commerce, 27-28, 2011 | 189 | 2011 |
| Sponsored search auctions with markovian users G Aggarwal, J Feldman, S Muthukrishnan, M Pál Internet and Network Economics: 4th International Workshop, WINE 2008 …, 2008 | 188 | 2008 |
| Learning mixtures of product distributions over discrete domains J Feldman, R O'Donnell, RA Servedio SIAM Journal on Computing 37 (5), 1536-1564, 2008 | 122 | 2008 |
| LP decoding corrects a constant fraction of errors J Feldman, T Malkin, RA Servedio, C Stein, MJ Wainwright IEEE Transactions on Information Theory 53 (1), 82-89, 2006 | 122 | 2006 |
| On distributing symmetric streaming computations J Feldman, S Muthukrishnan, A Sidiropoulos, C Stein, Z Svitkina ACM Transactions on Algorithms (TALG) 6 (4), 1-19, 2010 | 120 | 2010 |
| PAC learning axis-aligned mixtures of Gaussians with no separation assumption J Feldman, RA Servedio, R O’Donnell Learning Theory: 19th Annual Conference on Learning Theory, COLT 2006 …, 2006 | 101 | 2006 |
| An online mechanism for ad slot reservations with cancellations F Constantin, J Feldman, S Muthukrishnan, M Pál Proceedings of the twentieth annual ACM-SIAM symposium on discrete …, 2009 | 91* | 2009 |
| Bidding to the top: VCG and equilibria of position-based auctions G Aggarwal, J Feldman, S Muthukrishnan Approximation and Online Algorithms: 4th International Workshop, WAOA 2006 …, 2007 | 84 | 2007 |
| Preferred cost bidding for online advertising J Feldman, GR Kim, JJY Liang, B Narendran, M Pal, R Rao, A Wildavsky US Patent App. 11/734,765, 2008 | 75 | 2008 |
| The directed Steiner network problem is tractable for a constant number of terminals J Feldman, M Ruhl SIAM Journal on Computing 36 (2), 543-561, 2006 | 74 | 2006 |
| The directed Steiner network problem is tractable for a constant number of terminals J Feldman, M Ruhl SIAM Journal on Computing 36 (2), 543-561, 2006 | 74 | 2006 |
| The directed Steiner network problem is tractable for a constant number of terminals J Feldman, M Ruhl SIAM Journal on Computing 36 (2), 543-561, 2006 | 74 | 2006 |
