Jon Feldman
Computer Networks and Communications · with Karger · 2005–2009
A researcher in the Science corpus: 2 papers; trusts 3 researchers and is trusted by 6 researchers here, as inferred from the citation graph.
Subfields
- Computer Networks and Communications — 12 citations into it; #4,855 of 9,886 by trust here, #7,492 by citations
- Electrical and Electronic Engineering — 5 citations into it; #10,615 of 16,539 by trust here, #14,827 by citations
Whom Jon Feldman trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Alexander Schrijver
- T. Richardson
- Jonathan S. Yedidia
- Rüdiger L. Urbanke
- Sae-Young Chung
- Yossi Azar
- von Madeleine Leidheiser
- William T. Freeman
- Michael M. Mitzenmacher
- Dimitri P. Bertsekas
Who trusts Jon Feldman overall
- Aranyak Mehta
- Martin J. Wainwright
- Mohammad Mahdian
- Stephen H. Bach
- Qiqi Yan
- Tommi S. Jaakkola
- Matthias Broecheler
Papers from Jon Feldman's perspective
Ordered by how strongly the researchers Jon Feldman trusts endorse each paper. Same corpus, a different order for every researcher.
- Codes on graphs: normal realizations (2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060))
- The capacity of low-density parity-check codes under message-passing decoding (IEEE Transactions on Information Theory)
- Understanding belief propagation and its generalizations
- Introduction to linear optimization
- The Power of Two Choices in Randomized Load Balancing
- Low-Density Parity-Check Codes
- Turbo Decoding as an Instance of Pearl's "Belief Propagation" Algorithm
- On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit (IEEE Communications Letters)
- Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue (Embedded Systems and Applications)
- Dynamic Programming and Optimal Control Problem Set: Deterministic Systems and the Shortest Path Problem
Their papers
- Using linear programming to Decode Binary linear codes (2005) — 545 citations
- Online Stochastic Matching: Beating 1-1/e (2009) — 370 citations