Jon Feldman

According to our database1, Jon Feldman authored at least 42 papers between 2001 and 2014.

Collaborative distances:



In proceedings 
PhD thesis 




Yield Optimization of Display Advertising with Ad Exchange.
Management Science, 2014

Reduce and aggregate: similarity ranking in multi-categorical bipartite graphs.
Proceedings of the 23rd International World Wide Web Conference, 2014

Multiplicative bidding in online advertising.
Proceedings of the ACM Conference on Economics and Computation, 2014

Online allocation of display ads with smooth delivery.
Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2012

On distributing symmetric streaming computations.
ACM Trans. Algorithms, 2010

Online Stochastic Ad Allocation: Efficiency and Fairness
CoRR, 2010

Auctions with intermediaries: extended abstract.
Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

Online Stochastic Packing Applied to Display Ad Allocation.
Proceedings of the Algorithms, 2010

A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2.
ACM Trans. Algorithms, 2009

Online Ad Assignment with Free Disposal.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

An online mechanism for ad slot reservations with cancellations.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Online Stochastic Matching: Beating 1-1/e.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

LP Decoding.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

A New Linear Programming Approach to Decoding Linear Block Codes.
IEEE Trans. Information Theory, 2008

Theory research at Google.
SIGACT News, 2008

Learning Mixtures of Product Distributions over Discrete Domains.
SIAM J. Comput., 2008

Algorithmic Methods for Sponsored Search Advertising
CoRR, 2008

Online Ad Slotting With Cancellations
CoRR, 2008

Position Auctions with Bidder-Specific Minimum Prices.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Sponsored Search Auctions with Markovian Users.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

A Truthful Mechanism for Offline Ad Slot Scheduling.
Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

LP Decoding Corrects a Constant Fraction of Errors.
IEEE Trans. Information Theory, 2007

Budget optimization in search-based advertising auctions.
Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007

Cascaded Formulation of the Fundamental Polytope of General Linear Block Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Fast ML Decoding of SPC Product Code by Linear Programming Decoding.
Proceedings of the Global Communications Conference, 2007

The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals.
SIAM J. Comput., 2006

Nonlinear Programming Approaches to Decoding Low-Density Parity-Check Codes.
IEEE Journal on Selected Areas in Communications, 2006

On the Complexity of Processing Massive, Unordered, Distributed Data
CoRR, 2006

PAC Learning Mixtures of Axis-Aligned Gaussians with No Separation Assumption
CoRR, 2006

Bidding to the Top: VCG and Equilibria of Position-Based Auctions.
Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006

Growth codes: maximizing sensor network data persistence.
Proceedings of the ACM SIGCOMM 2006 Conference on Applications, 2006

Using Many Machines to Handle an Enormous Error-Correcting Code.
Proceedings of the 2006 IEEE Information Theory Workshop, 2006

PAC Learning Axis-Aligned Mixtures of Gaussians with No Separation Assumption.
Proceedings of the Learning Theory, 19th Annual Conference on Learning Theory, 2006

Using linear programming to Decode Binary linear codes.
IEEE Trans. Information Theory, 2005

Data persistence in sensor networks: towards optimal encoding for data recovery in partial network failures.
SIGMETRICS Performance Evaluation Review, 2005

LP decoding achieves capacity.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

The benefit of thresholding in LP decoding of LDPC codes.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Decoding turbo-like codes via linear programming.
J. Comput. Syst. Sci., 2004

Decoding error-correcting codes via linear programming.
PhD thesis, 2003

Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems.
J. Graph Algorithms Appl., 2001

Parallel processor scheduling with delay constraints.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

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.
Proceedings of the Approximation, 2001