| 2009 | ||
|---|---|---|
| 38 | Florin Constantin, Jon Feldman, S. Muthukrishnan, Martin Pál: An online mechanism for ad slot reservations with cancellations. SODA 2009: 1265-1274 | |
| 37 | Guy Even, Jon Feldman, Guy Kortsarz, Zeev Nutov: A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2. ACM Transactions on Algorithms 5(2): (2009) | |
| 36 | Jon Feldman, Aranyak Mehta, Vahab S. Mirrokni, S. Muthukrishnan: Online Stochastic Matching: Beating 1-1/e CoRR abs/0905.4100: (2009) | |
| 2008 | ||
| 35 | Jon Feldman, S. Muthukrishnan, Evdokia Nikolova, Martin Pál: A Truthful Mechanism for Offline Ad Slot Scheduling. SAGT 2008: 182-193 | |
| 34 | Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina: On distributing symmetric streaming computations. SODA 2008: 710-719 | |
| 33 | Eyal Even-Dar, Jon Feldman, Yishay Mansour, S. Muthukrishnan: Position Auctions with Bidder-Specific Minimum Prices. WINE 2008: 577-584 | |
| 32 | Gagan Aggarwal, Jon Feldman, S. Muthukrishnan, Martin Pál: Sponsored Search Auctions with Markovian Users. WINE 2008: 621-628 | |
| 31 | Jon Feldman: LP Decoding. Encyclopedia of Algorithms 2008 | |
| 30 | Jon Feldman, S. Muthukrishnan, Evdokia Nikolova, Martin Pal: A Truthful Mechanism for Offline Ad Slot Scheduling CoRR abs/0801.2931: (2008) | |
| 29 | Gagan Aggarwal, Jon Feldman, S. Muthukrishnan, Martin Pal: Sponsored Search Auctions with Markovian Users CoRR abs/0805.0766: (2008) | |
| 28 | Florin Constantin, Jon Feldman, S. Muthukrishnan, Martin Pal: Online Ad Slotting With Cancellations CoRR abs/0805.1213: (2008) | |
| 27 | Jon Feldman, S. Muthukrishnan: Algorithmic Methods for Sponsored Search Advertising CoRR abs/0805.1759: (2008) | |
| 26 | Kai Yang, Xiaodong Wang, Jon Feldman: A New Linear Programming Approach to Decoding Linear Block Codes. IEEE Transactions on Information Theory 54(3): 1061-1072 (2008) | |
| 25 | Jon Feldman, Ryan O'Donnell, Rocco A. Servedio: Learning Mixtures of Product Distributions over Discrete Domains. SIAM J. Comput. 37(5): 1536-1564 (2008) | |
| 24 | Gagan Aggarwal, Nir Ailon, Florin Constantin, Eyal Even-Dar, Jon Feldman, Gereon Frahling, Monika Rauch Henzinger, S. Muthukrishnan, Noam Nisan, Martin Pál, Mark Sandler, Anastasios Sidiropoulos: Theory research at Google. SIGACT News 39(2): 10-28 (2008) | |
| 2007 | ||
| 23 | Jon Feldman, S. Muthukrishnan, Martin Pál, Clifford Stein: Budget optimization in search-based advertising auctions. ACM Conference on Electronic Commerce 2007: 40-49 | |
| 22 | Kai Yang, Xiaodong Wang, Jon Feldman: Fast ML Decoding of SPC Product Code by Linear Programming Decoding. GLOBECOM 2007: 1577-1581 | |
| 21 | Jon Feldman, Tal Malkin, Rocco A. Servedio, Clifford Stein, Martin J. Wainwright: LP Decoding Corrects a Constant Fraction of Errors. IEEE Transactions on Information Theory 53(1): 82-89 (2007) | |
| 2006 | ||
| 20 | Jon Feldman, Rocco A. Servedio, Ryan O'Donnell: PAC Learning Axis-Aligned Mixtures of Gaussians with No Separation Assumption. COLT 2006: 20-34 | |
| 19 | Abhinav Kamra, Vishal Misra, Jon Feldman, Dan Rubenstein: Growth codes: maximizing sensor network data persistence. SIGCOMM 2006: 255-266 | |
| 18 | Gagan Aggarwal, Jon Feldman, S. Muthukrishnan: Bidding to the Top: VCG and Equilibria of Position-Based Auctions. WAOA 2006: 15-28 | |
| 17 | Gagan Aggarwal, S. Muthukrishnan, Jon Feldman: Bidding to the Top: VCG and Equilibria of Position-Based Auctions CoRR abs/cs/0607117: (2006) | |
| 16 | Jon Feldman, Ryan O'Donnell, Rocco A. Servedio: PAC Learning Mixtures of Axis-Aligned Gaussians with No Separation Assumption CoRR abs/cs/0609093: (2006) | |
| 15 | Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina: On the Complexity of Processing Massive, Unordered, Distributed Data CoRR abs/cs/0611108: (2006) | |
| 14 | Jon Feldman, S. Muthukrishnan, Martin Pál, Clifford Stein: Budget Optimization in Search-Based Advertising Auctions CoRR abs/cs/0612052: (2006) | |
| 13 | Kai Yang, Jon Feldman, Xiaodong Wang: Nonlinear Programming Approaches to Decoding Low-Density Parity-Check Codes. IEEE Journal on Selected Areas in Communications 24(8): 1603-1613 (2006) | |
| 12 | Jon Feldman, Matthias Ruhl: The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals. SIAM J. Comput. 36(2): 543-561 (2006) | |
| 2005 | ||
| 11 | Jon Feldman, Ryan O'Donnell, Rocco A. Servedio: Learning mixtures of product distributions over discrete domains. FOCS 2005: 501-510 | |
| 10 | Jon Feldman, Clifford Stein: LP decoding achieves capacity. SODA 2005: 460-469 | |
| 9 | Jon Feldman, Ralf Koetter, Pascal O. Vontobel: The Benefit of Thresholding in LP Decoding of LDPC Codes CoRR abs/cs/0508014: (2005) | |
| 8 | Jon Feldman, Martin J. Wainwright, David R. Karger: Using linear programming to Decode Binary linear codes. IEEE Transactions on Information Theory 51(3): 954-972 (2005) | |
| 7 | Abhinav Kamra, Jon Feldman, Vishal Misra, Dan Rubenstein: Data persistence in sensor networks: towards optimal encoding for data recovery in partial network failures. SIGMETRICS Performance Evaluation Review 33(2): 24-26 (2005) | |
| 2004 | ||
| 6 | Jon Feldman, David R. Karger: Decoding turbo-like codes via linear programming. J. Comput. Syst. Sci. 68(4): 733-752 (2004) | |
| 2002 | ||
| 5 | Jon Feldman, David R. Karger: Decoding Turbo-Like Codes via Linear Programming. FOCS 2002: 251-260 | |
| 2001 | ||
| 4 | Guy Even, Jon Feldman, Guy Kortsarz, Zeev Nutov: A 3/2-Approximation Algorithm for Augmenting the Edge-Connectivity of a Graph from 1 to 2 Using a Subset of a Given Edge Set. RANDOM-APPROX 2001: 90-101 | |
| 3 | Daniel W. Engels, Jon Feldman, David R. Karger, Matthias Ruhl: Parallel processor scheduling with delay constraints. SODA 2001: 577-585 | |
| 2 | Reuven Bar-Yehuda, Guy Even, Jon Feldman, Joseph Naor: Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems. J. Graph Algorithms Appl. 5(4): (2001) | |
| 1999 | ||
| 1 | Jon Feldman, Matthias Ruhl: The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals. FOCS 1999: 299-308 | |