Jon Feldman

Dr. Feldman graduated from Dartmouth College (BS, 97) and MIT (Ph.D., 03). He was an NSF postdoc at Columbia University before joining as a Research Scientist at Google, NY. His research has been in Algorithms, Coding Theory, and other areas of Theoretical Computer Science. Currently he is working on algorithms and systems for sponsored search advertising at Google.

Google Publications

Previous Publications

  •  

    Online Stochastic Ad Allocation: Efficiency and Fairness

    Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Clifford Stein

    CoRR, vol. abs/1001.5076 (2010)

  •   

    A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2

    Guy Even, Jon Feldman, Guy Kortsarz, Zeev Nutov

    ACM Trans. Algorithms, vol. 5 (2009), pp. 1-17

  •   

    Data persistence in sensor networks: towards optimal encoding for data recovery in partial network failures

    Abhinav Kamra, Jon Feldman, Vishal Misra, Dan Rubenstein

    SIGMETRICS Performance Evaluation Review, vol. 33 (2005), pp. 24-26

  •   

    LP decoding achieves capacity

    Jon Feldman, Clifford Stein

    SODA (2005), pp. 460-469

  •   

    Learning mixtures of product distributions over discrete domains

    Jon Feldman, Ryan O'Donnell, Rocco A. Servedio

    FOCS (2005), pp. 501-510

  •   

    Using linear programming to Decode Binary linear codes

    Jon Feldman, Martin J. Wainwright, David R. Karger

    IEEE Transactions on Information Theory, vol. 51 (2005), pp. 954-972

  •   

    Decoding turbo-like codes via linear programming

    Jon Feldman, David R. Karger

    J. Comput. Syst. Sci., vol. 68 (2004), pp. 733-752

  •   

    Decoding Turbo-Like Codes via Linear Programming

    Jon Feldman, David R. Karger

    FOCS (2002), pp. 251-260

  •   

    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

    Guy Even, Jon Feldman, Guy Kortsarz, Zeev Nutov

    RANDOM-APPROX (2001), pp. 90-101

  •   

    Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems

    Reuven Bar-Yehuda, Guy Even, Jon Feldman, Joseph Naor

    J. Graph Algorithms Appl., vol. 5 (2001)

  •   

    Parallel processor scheduling with delay constraints

    Daniel W. Engels, Jon Feldman, David R. Karger, Matthias Ruhl

    SODA (2001), pp. 577-585

  •   

    The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals

    Jon Feldman, Matthias Ruhl

    FOCS (1999), pp. 299-308