The SCEAS System
| |||||||

## Search the dblp DataBase
Jon Feldman:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Jon Feldman, Rocco A. Servedio, Ryan O'Donnell
**PAC Learning Axis-Aligned Mixtures of Gaussians with No Separation Assumption.**[Citation Graph (0, 0)][DBLP] COLT, 2006, pp:20-34 [Conf] - Jon Feldman, David R. Karger
**Decoding Turbo-Like Codes via Linear Programming.**[Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:251-260 [Conf] - Jon Feldman, Matthias Ruhl
**The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals.**[Citation Graph (0, 0)][DBLP] FOCS, 1999, pp:299-308 [Conf] - Jon Feldman, Ryan O'Donnell, Rocco A. Servedio
**Learning mixtures of product distributions over discrete domains.**[Citation Graph (0, 0)][DBLP] FOCS, 2005, pp:501-510 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] RANDOM-APPROX, 2001, pp:90-101 [Conf] - Abhinav Kamra, Vishal Misra, Jon Feldman, Dan Rubenstein
**Growth codes: maximizing sensor network data persistence.**[Citation Graph (0, 0)][DBLP] SIGCOMM, 2006, pp:255-266 [Conf] - Daniel W. Engels, Jon Feldman, David R. Karger, Matthias Ruhl
**Parallel processor scheduling with delay constraints.**[Citation Graph (0, 0)][DBLP] SODA, 2001, pp:577-585 [Conf] - Jon Feldman, Clifford Stein
**LP decoding achieves capacity.**[Citation Graph (0, 0)][DBLP] SODA, 2005, pp:460-469 [Conf] - Gagan Aggarwal, Jon Feldman, S. Muthukrishnan
**Bidding to the Top: VCG and Equilibria of Position-Based Auctions.**[Citation Graph (0, 0)][DBLP] WAOA, 2006, pp:15-28 [Conf] - Jon Feldman, David R. Karger
**Decoding turbo-like codes via linear programming.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2004, v:68, n:4, pp:733-752 [Journal] - Reuven Bar-Yehuda, Guy Even, Jon Feldman, Joseph Naor
**Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems.**[Citation Graph (0, 0)][DBLP] J. Graph Algorithms Appl., 2001, v:5, n:4, pp:- [Journal] - Jon Feldman, Matthias Ruhl
**The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2006, v:36, n:2, pp:543-561 [Journal] - Abhinav Kamra, Jon Feldman, Vishal Misra, Dan Rubenstein
**Data persistence in sensor networks: towards optimal encoding for data recovery in partial network failures.**[Citation Graph (0, 0)][DBLP] SIGMETRICS Performance Evaluation Review, 2005, v:33, n:2, pp:24-26 [Journal] - Jon Feldman, Martin J. Wainwright, David R. Karger
**Using linear programming to Decode Binary linear codes.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2005, v:51, n:3, pp:954-972 [Journal] - Jon Feldman, Tal Malkin, Rocco A. Servedio, Clifford Stein, Martin J. Wainwright
**LP Decoding Corrects a Constant Fraction of Errors.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2007, v:53, n:1, pp:82-89 [Journal] - Jon Feldman, S. Muthukrishnan, Martin Pal, Clifford Stein
**Budget optimization in search-based advertising auctions.**[Citation Graph (0, 0)][DBLP] ACM Conference on Electronic Commerce, 2007, pp:40-49 [Conf] - Jon Feldman, S. Muthukrishnan, Martin Pal, Clifford Stein
**Budget Optimization in Search-Based Advertising Auctions**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] - Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina
**On the Complexity of Processing Massive, Unordered, Distributed Data**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] - Jon Feldman, Ryan O'Donnell, Rocco A. Servedio
**PAC Learning Mixtures of Axis-Aligned Gaussians with No Separation Assumption**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] - Gagan Aggarwal, S. Muthukrishnan, Jon Feldman
**Bidding to the Top: VCG and Equilibria of Position-Based Auctions**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] **Online Stochastic Packing Applied to Display Ad Allocation.**[Citation Graph (, )][DBLP]**Online Stochastic Matching: Beating 1-1/e.**[Citation Graph (, )][DBLP]**Auctions with intermediaries: extended abstract.**[Citation Graph (, )][DBLP]**On distributing symmetric streaming computations.**[Citation Graph (, )][DBLP]**An online mechanism for ad slot reservations with cancellations.**[Citation Graph (, )][DBLP]**Online Ad Assignment with Free Disposal.**[Citation Graph (, )][DBLP]**Position Auctions with Bidder-Specific Minimum Prices.**[Citation Graph (, )][DBLP]**Sponsored Search Auctions with Markovian Users.**[Citation Graph (, )][DBLP]**Fast ML Decoding of SPC Product Code by Linear Programming Decoding.**[Citation Graph (, )][DBLP]**A Truthful Mechanism for Offline Ad Slot Scheduling.**[Citation Graph (, )][DBLP]**The Benefit of Thresholding in LP Decoding of LDPC Codes**[Citation Graph (, )][DBLP]**A Truthful Mechanism for Offline Ad Slot Scheduling**[Citation Graph (, )][DBLP]**Sponsored Search Auctions with Markovian Users**[Citation Graph (, )][DBLP]**Online Ad Slotting With Cancellations**[Citation Graph (, )][DBLP]**Algorithmic Methods for Sponsored Search Advertising**[Citation Graph (, )][DBLP]**Online Stochastic Matching: Beating 1-1/e**[Citation Graph (, )][DBLP]**Online Stochastic Ad Allocation: Efficiency and Fairness**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.007secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |