Jon Feldman

2008
28	EE	Jon Feldman, S. Muthukrishnan, Evdokia Nikolova, Martin Pál: A Truthful Mechanism for Offline Ad Slot Scheduling. SAGT 2008: 182-193
27	EE	Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina: On distributing symmetric streaming computations. SODA 2008: 710-719
26	EE	Jon Feldman, S. Muthukrishnan, Evdokia Nikolova, Martin Pal: A Truthful Mechanism for Offline Ad Slot Scheduling CoRR abs/0801.2931: (2008)
25	EE	Gagan Aggarwal, Jon Feldman, S. Muthukrishnan, Martin Pal: Sponsored Search Auctions with Markovian Users CoRR abs/0805.0766: (2008)
24	EE	Florin Constantin, Jon Feldman, S. Muthukrishnan, Martin Pal: Online Ad Slotting With Cancellations CoRR abs/0805.1213: (2008)
23	EE	Jon Feldman, S. Muthukrishnan: Algorithmic Methods for Sponsored Search Advertising CoRR abs/0805.1759: (2008)
2007
22	EE	Jon Feldman, S. Muthukrishnan, Martin Pál, Clifford Stein: Budget optimization in search-based advertising auctions. ACM Conference on Electronic Commerce 2007: 40-49
21	EE	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	EE	Jon Feldman, Rocco A. Servedio, Ryan O'Donnell: PAC Learning Axis-Aligned Mixtures of Gaussians with No Separation Assumption. COLT 2006: 20-34
19	EE	Abhinav Kamra, Vishal Misra, Jon Feldman, Dan Rubenstein: Growth codes: maximizing sensor network data persistence. SIGCOMM 2006: 255-266
18	EE	Gagan Aggarwal, Jon Feldman, S. Muthukrishnan: Bidding to the Top: VCG and Equilibria of Position-Based Auctions. WAOA 2006: 15-28
17	EE	Gagan Aggarwal, S. Muthukrishnan, Jon Feldman: Bidding to the Top: VCG and Equilibria of Position-Based Auctions CoRR abs/cs/0607117: (2006)
16	EE	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	EE	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	EE	Jon Feldman, S. Muthukrishnan, Martin Pál, Clifford Stein: Budget Optimization in Search-Based Advertising Auctions CoRR abs/cs/0612052: (2006)
13	EE	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	EE	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	EE	Jon Feldman, Ryan O'Donnell, Rocco A. Servedio: Learning mixtures of product distributions over discrete domains. FOCS 2005: 501-510
10	EE	Jon Feldman, Clifford Stein: LP decoding achieves capacity. SODA 2005: 460-469
9	EE	Jon Feldman, Ralf Koetter, Pascal O. Vontobel: The Benefit of Thresholding in LP Decoding of LDPC Codes CoRR abs/cs/0508014: (2005)
8	EE	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	EE	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	EE	Jon Feldman, David R. Karger: Decoding turbo-like codes via linear programming. J. Comput. Syst. Sci. 68(4): 733-752 (2004)
2002
5	EE	Jon Feldman, David R. Karger: Decoding Turbo-Like Codes via Linear Programming. FOCS 2002: 251-260
2001
4	EE	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	EE	Daniel W. Engels, Jon Feldman, David R. Karger, Matthias Ruhl: Parallel processor scheduling with delay constraints. SODA 2001: 577-585
2	EE	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	EE	Jon Feldman, Matthias Ruhl: The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals. FOCS 1999: 299-308

Coauthor Index

1	Gagan Aggarwal	[17] [18] [25]
2	Reuven Bar-Yehuda	[2]
3	Florin Constantin	[24]
4	Daniel W. Engels	[3]
5	Guy Even	[2] [4]
6	Abhinav Kamra	[7] [19]
7	David R. Karger	[3] [5] [6] [8]
8	Ralf Koetter	[9]
9	Guy Kortsarz	[4]
10	Tal Malkin	[21]
11	Vishal Misra	[7] [19]
12	S. Muthukrishnan (S. Muthu Muthukrishnan)	[14] [15] [17] [18] [22] [23] [24] [25] [26] [27] [28]
13	Joseph Naor (Seffi Naor)	[2]
14	Evdokia Nikolova	[26] [28]
15	Zeev Nutov	[4]
16	Ryan O'Donnell	[11] [16] [20]
17	Martin Pál (Martin Pal)	[14] [22] [24] [25] [26] [28]
18	Dan Rubenstein	[7] [19]
19	Matthias Ruhl	[1] [3] [12]
20	Rocco A. Servedio	[11] [16] [20] [21]
21	Anastasios Sidiropoulos	[15] [27]
22	Clifford Stein	[10] [14] [15] [21] [22] [27]
23	Zoya Svitkina	[15] [27]
24	Pascal O. Vontobel	[9]
25	Martin J. Wainwright	[8] [21]
26	Xiaodong Wang	[13]
27	Kai Yang	[13]

Colors in the list of coauthors