default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJon Feldman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j13]Santiago R. Balseiro, Jon Feldman, Vahab S. Mirrokni, S. Muthukrishnan:
Yield Optimization of Display Advertising with Ad Exchange. Manag. Sci. 60(12): 2886-2907 (2014)- [c28]MohammadHossein Bateni, Jon Feldman, Vahab S. Mirrokni, Sam Chiu-wai Wong:
Multiplicative bidding in online advertising. EC 2014: 715-732 - [c27]Alessandro Epasto
, Jon Feldman, Silvio Lattanzi, Stefano Leonardi, Vahab S. Mirrokni:
Reduce and aggregate: similarity ranking in multi-categorical bipartite graphs. WWW 2014: 349-360 - [i13]MohammadHossein Bateni, Jon Feldman, Vahab S. Mirrokni, Sam Chiu-wai Wong:
Multiplicative Bidding in Online Advertising. CoRR abs/1404.6727 (2014) - 2012
- [c26]Anand Bhalgat, Jon Feldman, Vahab S. Mirrokni:
Online allocation of display ads with smooth delivery. KDD 2012: 1213-1221 - 2011
- [c25]Santiago R. Balseiro, Jon Feldman, Vahab S. Mirrokni, S. Muthukrishnan:
Yield optimization of display advertising with ad exchange. EC 2011: 27-28 - [i12]Santiago R. Balseiro, Jon Feldman, Vahab S. Mirrokni, S. Muthukrishnan:
Yield Optimization of Display Advertising with Ad Exchange. CoRR abs/1102.2551 (2011) - 2010
- [j12]Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina:
On distributing symmetric streaming computations. ACM Trans. Algorithms 6(4): 66:1-66:19 (2010) - [c24]Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Clifford Stein:
Online Stochastic Packing Applied to Display Ad Allocation. ESA (1) 2010: 182-194 - [c23]Jon Feldman, Vahab S. Mirrokni, S. Muthukrishnan, Mallesh M. Pai:
Auctions with intermediaries: extended abstract. EC 2010: 23-32 - [i11]Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Clifford Stein:
Online Stochastic Ad Allocation: Efficiency and Fairness. CoRR abs/1001.5076 (2010)
2000 – 2009
- 2009
- [j11]Guy Even, Jon Feldman, Guy Kortsarz, Zeev Nutov:
A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2. ACM Trans. Algorithms 5(2): 21:1-21:17 (2009) - [c22]Jon Feldman, Aranyak Mehta, Vahab S. Mirrokni, S. Muthukrishnan:
Online Stochastic Matching: Beating 1-1/e. FOCS 2009: 117-126 - [c21]Florin Constantin, Jon Feldman, S. Muthukrishnan, Martin Pál:
An online mechanism for ad slot reservations with cancellations. SODA 2009: 1265-1274 - [c20]Jon Feldman, Nitish Korula, Vahab S. Mirrokni, S. Muthukrishnan, Martin Pál:
Online Ad Assignment with Free Disposal. WINE 2009: 374-385 - [i10]Jon Feldman, Aranyak Mehta, Vahab S. Mirrokni, S. Muthukrishnan:
Online Stochastic Matching: Beating 1-1/e. CoRR abs/0905.4100 (2009) - 2008
- [j10]Jon Feldman, Ryan O'Donnell, Rocco A. Servedio:
Learning Mixtures of Product Distributions over Discrete Domains. SIAM J. Comput. 37(5): 1536-1564 (2008) - [j9]Gagan Aggarwal, Nir Ailon, Florin Constantin, Eyal Even-Dar, Jon Feldman, Gereon Frahling, Monika Rauch Henzinger, S. Muthukrishnan, Noam Nisan, Martin Pál, Mark Sandler, Anastasios Sidiropoulos:
Theory research at Google. SIGACT News 39(2): 10-28 (2008) - [j8]Kai Yang, Xiaodong Wang, Jon Feldman:
A New Linear Programming Approach to Decoding Linear Block Codes. IEEE Trans. Inf. Theory 54(3): 1061-1072 (2008) - [c19]Jon Feldman, S. Muthukrishnan, Evdokia Nikolova, Martin Pál:
A Truthful Mechanism for Offline Ad Slot Scheduling. SAGT 2008: 182-193 - [c18]Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina:
On distributing symmetric streaming computations. SODA 2008: 710-719 - [c17]Eyal Even-Dar, Jon Feldman, Yishay Mansour, S. Muthukrishnan:
Position Auctions with Bidder-Specific Minimum Prices. WINE 2008: 577-584 - [c16]Gagan Aggarwal, Jon Feldman, S. Muthukrishnan, Martin Pál:
Sponsored Search Auctions with Markovian Users. WINE 2008: 621-628 - [r1]Jon Feldman:
LP Decoding. Encyclopedia of Algorithms 2008 - [i9]Jon Feldman, S. Muthukrishnan, Evdokia Nikolova, Martin Pal:
A Truthful Mechanism for Offline Ad Slot Scheduling. CoRR abs/0801.2931 (2008) - [i8]Gagan Aggarwal, Jon Feldman, S. Muthukrishnan, Martin Pal:
Sponsored Search Auctions with Markovian Users. CoRR abs/0805.0766 (2008) - [i7]Florin Constantin, Jon Feldman, S. Muthukrishnan, Martin Pal:
Online Ad Slotting With Cancellations. CoRR abs/0805.1213 (2008) - [i6]Jon Feldman, S. Muthukrishnan:
Algorithmic Methods for Sponsored Search Advertising. CoRR abs/0805.1759 (2008) - 2007
- [j7]Jon Feldman, Tal Malkin, Rocco A. Servedio, Clifford Stein, Martin J. Wainwright:
LP Decoding Corrects a Constant Fraction of Errors. IEEE Trans. Inf. Theory 53(1): 82-89 (2007) - [c15]Kai Yang, Xiaodong Wang, Jon Feldman:
Fast ML Decoding of SPC Product Code by Linear Programming Decoding. GLOBECOM 2007: 1577-1581 - [c14]Kai Yang, Xiaodong Wang, Jon Feldman:
Cascaded Formulation of the Fundamental Polytope of General Linear Block Codes. ISIT 2007: 1361-1365 - [c13]Jon Feldman, S. Muthukrishnan, Martin Pál, Clifford Stein:
Budget optimization in search-based advertising auctions. EC 2007: 40-49 - 2006
- [j6]Kai Yang, Jon Feldman, Xiaodong Wang:
Nonlinear Programming Approaches to Decoding Low-Density Parity-Check Codes. IEEE J. Sel. Areas Commun. 24(8): 1603-1613 (2006) - [j5]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) - [c12]Jon Feldman, Rocco A. Servedio, Ryan O'Donnell:
PAC Learning Axis-Aligned Mixtures of Gaussians with No Separation Assumption. COLT 2006: 20-34 - [c11]Jon Feldman:
Using Many Machines to Handle an Enormous Error-Correcting Code. ITW 2006: 180-182 - [c10]Abhinav Kamra, Vishal Misra, Jon Feldman, Dan Rubenstein:
Growth codes: maximizing sensor network data persistence. SIGCOMM 2006: 255-266 - [c9]Gagan Aggarwal, Jon Feldman, S. Muthukrishnan:
Bidding to the Top: VCG and Equilibria of Position-Based Auctions. WAOA 2006: 15-28 - [i5]Gagan Aggarwal, S. Muthukrishnan, Jon Feldman:
Bidding to the Top: VCG and Equilibria of Position-Based Auctions. CoRR abs/cs/0607117 (2006) - [i4]Jon Feldman, Ryan O'Donnell, Rocco A. Servedio:
PAC Learning Mixtures of Axis-Aligned Gaussians with No Separation Assumption. CoRR abs/cs/0609093 (2006) - [i3]Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina:
On the Complexity of Processing Massive, Unordered, Distributed Data. CoRR abs/cs/0611108 (2006) - [i2]Jon Feldman, S. Muthukrishnan, Martin Pál, Clifford Stein:
Budget Optimization in Search-Based Advertising Auctions. CoRR abs/cs/0612052 (2006) - 2005
- [j4]Abhinav Kamra, Jon Feldman, Vishal Misra, Dan Rubenstein:
Data persistence in sensor networks: towards optimal encoding for data recovery in partial network failures. SIGMETRICS Perform. Evaluation Rev. 33(2): 24-26 (2005) - [j3]Jon Feldman, Martin J. Wainwright, David R. Karger:
Using linear programming to Decode Binary linear codes. IEEE Trans. Inf. Theory 51(3): 954-972 (2005) - [c8]Jon Feldman, Ryan O'Donnell, Rocco A. Servedio:
Learning mixtures of product distributions over discrete domains. FOCS 2005: 501-510 - [c7]Jon Feldman, Ralf Koetter, Pascal O. Vontobel:
The benefit of thresholding in LP decoding of LDPC codes. ISIT 2005: 307-311 - [c6]Jon Feldman, Clifford Stein:
LP decoding achieves capacity. SODA 2005: 460-469 - [i1]Jon Feldman, Ralf Koetter, Pascal O. Vontobel:
The Benefit of Thresholding in LP Decoding of LDPC Codes. CoRR abs/cs/0508014 (2005) - 2004
- [j2]Jon Feldman, David R. Karger:
Decoding turbo-like codes via linear programming. J. Comput. Syst. Sci. 68(4): 733-752 (2004) - [c5]Jon Feldman, Tal Malkin, Rocco A. Servedio, Cliff Stein, Martin J. Wainwright:
LP decoding corrects a constant fraction of errors. ISIT 2004: 68 - 2003
- [b1]Jon Feldman:
Decoding error-correcting codes via linear programming. Massachusetts Institute of Technology, Cambridge, MA, USA, 2003 - 2002
- [c4]Jon Feldman, David R. Karger:
Decoding Turbo-Like Codes via Linear Programming. FOCS 2002: 251-260 - 2001
- [j1]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): 1-27 (2001) - [c3]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 - [c2]Daniel W. Engels, Jon Feldman, David R. Karger, Matthias Ruhl:
Parallel processor scheduling with delay constraints. SODA 2001: 577-585
1990 – 1999
- 1999
- [c1]Jon Feldman, Matthias Ruhl:
The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals. FOCS 1999: 299-308
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
