default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Pál
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]John Delaney, Badih Ghazi, Charlie Harrison, Christina Ilvento, Ravi Kumar, Pasin Manurangsi, Martin Pál, Karthik Prabhakar, Mariana Raykova:
Differentially Private Ad Conversion Measurement. Proc. Priv. Enhancing Technol. 2024(2): 124-140 (2024)- [i12]John Delaney, Badih Ghazi, Charlie Harrison, Christina Ilvento, Ravi Kumar, Pasin Manurangsi, Martin Pal, Karthik Prabhakar, Mariana Raykova:
Differentially Private Ad Conversion Measurement. CoRR abs/2403.15224 (2024) - 2021
- [j11]Hedyeh Beyhaghi, Negin Golrezaei
, Renato Paes Leme, Martin Pál, Balasubramanian Sivan:
Improved Revenue Bounds for Posted-Price and Second-Price Mechanisms. Oper. Res. 69(6): 1805-1822 (2021) - [c29]Allen Liu, Renato Paes Leme, Martin Pál, Jon Schneider, Balasubramanian Sivan:
Variable Decomposition for Prophet Inequalities and Optimal Ordering. EC 2021: 692 - 2020
- [i11]Allen Liu, Renato Paes Leme, Martin Pal, Jon Schneider, Balasubramanian Sivan:
Competing Optimally Against An Imperfect Prophet. CoRR abs/2004.10163 (2020)
2010 – 2019
- 2018
- [i10]Hedyeh Beyhaghi, Negin Golrezaei, Renato Paes Leme, Martin Pal, Balasubramanian Sivan:
Improved Approximations for Free-Order Prophets and Second-Price Auctions. CoRR abs/1807.03435 (2018) - 2016
- [c28]Renato Paes Leme, Martin Pál, Sergei Vassilvitskii:
A Field Guide to Personalized Reserve Prices. WWW 2016: 1093-1102 - [i9]Renato Paes Leme, Martin Pal, Sergei Vassilvitskii:
A Field Guide to Personalized Reserve Prices. CoRR abs/1602.07720 (2016) - 2012
- [j10]Chandra Chekuri, Nitish Korula, Martin Pál:
Improved algorithms for orienteering and related problems. ACM Trans. Algorithms 8(3): 23:1-23:27 (2012) - 2011
- [j9]Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha:
Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems. SIAM J. Comput. 40(5): 1361-1401 (2011) - [j8]Gruia Calinescu, Chandra Chekuri, Martin Pál, Jan Vondrák:
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint. SIAM J. Comput. 40(6): 1740-1766 (2011) - 2010
- [j7]S. Muthukrishnan, Martin Pál, Zoya Svitkina:
Stochastic Models for Budget Optimization in Search-Based Advertising. Algorithmica 58(4): 1022-1044 (2010) - [c27]Tyler Lu, Dávid Pál, Martin Pal:
Contextual Multi-Armed Bandits. AISTATS 2010: 485-492 - [i8]Sudipto Guha, Kamesh Munagala, Martin Pal:
Iterated Allocations with Delayed Feedback. CoRR abs/1011.1161 (2010)
2000 – 2009
- 2009
- [c26]Nitish Korula, Martin Pál:
Algorithms for Secretary Problems on Graphs and Hypergraphs. ICALP (2) 2009: 508-520 - [c25]Florin Constantin, Jon Feldman, S. Muthukrishnan, Martin Pál:
An online mechanism for ad slot reservations with cancellations. SODA 2009: 1265-1274 - [c24]Jon Feldman, Nitish Korula, Vahab S. Mirrokni, S. Muthukrishnan, Martin Pál:
Online Ad Assignment with Free Disposal. WINE 2009: 374-385 - [c23]Gagan Aggarwal, S. Muthukrishnan, Dávid Pál, Martin Pál:
General auction mechanism for search advertising. WWW 2009: 241-250 - 2008
- [j6]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) - [c22]Li (Erran) Li, Martin Pal, Yang Richard Yang:
Proportional Fairness in Multi-Rate Wireless LANs. INFOCOM 2008: 1004-1012 - [c21]Jon Feldman, S. Muthukrishnan, Evdokia Nikolova, Martin Pál:
A Truthful Mechanism for Offline Ad Slot Scheduling. SAGT 2008: 182-193 - [c20]Chandra Chekuri, Nitish Korula, Martin Pál:
Improved algorithms for orienteering and related problems. SODA 2008: 661-670 - [c19]Gagan Aggarwal, Jon Feldman, S. Muthukrishnan, Martin Pál:
Sponsored Search Auctions with Markovian Users. WINE 2008: 621-628 - [i7]Jon Feldman, S. Muthukrishnan, Evdokia Nikolova, Martin Pal:
A Truthful Mechanism for Offline Ad Slot Scheduling. CoRR abs/0801.2931 (2008) - [i6]Gagan Aggarwal, Jon Feldman, S. Muthukrishnan, Martin Pal:
Sponsored Search Auctions with Markovian Users. CoRR abs/0805.0766 (2008) - [i5]Florin Constantin, Jon Feldman, S. Muthukrishnan, Martin Pal:
Online Ad Slotting With Cancellations. CoRR abs/0805.1213 (2008) - [i4]Nitish Korula, Martin Pal:
Algorithms for Secretary Problems on Graphs and Hypergraphs. CoRR abs/0807.1139 (2008) - [i3]Gagan Aggarwal, S. Muthukrishnan, Dávid Pál, Martin Pál:
General Auction Mechanism for Search Advertising. CoRR abs/0807.1297 (2008) - 2007
- [j5]Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden:
Approximation via cost sharing: Simpler and better approximation algorithms for network design. J. ACM 54(3): 11 (2007) - [j4]Retsef Levi, Martin Pál, Robin Roundy, David B. Shmoys:
Approximation Algorithms for Stochastic Inventory Control Models. Math. Oper. Res. 32(2): 284-302 (2007) - [j3]Luca Becchetti, Jochen Könemann, Stefano Leonardi, Martin Pál:
Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy. ACM Trans. Algorithms 3(2): 23 (2007) - [j2]Chandra Chekuri, Martin Pál:
An O(log n) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem. Theory Comput. 3(1): 197-209 (2007) - [c18]Gruia Calinescu, Chandra Chekuri, Martin Pál, Jan Vondrák:
Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract). IPCO 2007: 182-196 - [c17]Jon Feldman, S. Muthukrishnan, Martin Pál, Clifford Stein:
Budget optimization in search-based advertising auctions. EC 2007: 40-49 - [c16]S. Muthukrishnan, Martin Pál, Zoya Svitkina:
Stochastic Models for Budget Optimization in Search-Based Advertising. WINE 2007: 131-142 - 2006
- [c15]Chandra Chekuri, Martin Pál:
An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem. APPROX-RANDOM 2006: 95-103 - [c14]Seungjoon Lee, Girija J. Narlikar, Martin Pal, Gordon T. Wilfong, Lisa Zhang:
Admission control for multihop wireless backhaul networks with QoS support. WCNC 2006: 92-97 - [i2]Jon Feldman, S. Muthukrishnan, Martin Pál, Clifford Stein:
Budget Optimization in Search-Based Advertising Auctions. CoRR abs/cs/0612052 (2006) - [i1]S. Muthukrishnan, Martin Pál, Zoya Svitkina:
Stochastic Models for Budget Optimization in Search-Based Advertising. CoRR abs/cs/0612072 (2006) - 2005
- [b1]Martin Pal:
Cost Sharing and Approximation. Cornell University, USA, 2005 - [j1]Retsef Levi, Martin Pál, Robin O. Roundy, David B. Shmoys, Ravi Subramanian, Xinxin Hu, Gad Allon, Felipe Caro, Holly S. Lutze:
The MSOM Society Student Paper Competition: Extended Abstracts of 2004 Winners. Manuf. Serv. Oper. Manag. 7(1): 81-99 (2005) - [c13]Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha:
What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization. APPROX-RANDOM 2005: 86-98 - [c12]Moses Charikar, Chandra Chekuri, Martin Pál:
Sampling Bounds for Stochastic Optimization. APPROX-RANDOM 2005: 257-269 - [c11]Ara Hayrapetyan, David Kempe, Martin Pál, Zoya Svitkina:
Unbalanced Graph Cuts. ESA 2005: 191-202 - [c10]Chandra Chekuri, Martin Pál:
A Recursive Greedy Algorithm for Walks in Directed Graphs. FOCS 2005: 245-253 - [c9]Anupam Gupta, Martin Pál:
Stochastic Steiner Trees Without a Root. ICALP 2005: 1051-1063 - [c8]Retsef Levi, Martin Pál, Robin Roundy, David B. Shmoys:
Approximation Algorithms for Stochastic Inventory Control Models. IPCO 2005: 306-320 - [c7]Luca Becchetti, Jochen Könemann, Stefano Leonardi, Martin Pál:
Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy. SODA 2005: 375-384 - 2004
- [c6]Hubie Chen, Martin Pál:
Optimization, Games, and Quantified Constraint Satisfaction. MFCS 2004: 239-250 - [c5]Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha:
Boosted sampling: approximation algorithms for stochastic optimization. STOC 2004: 417-426 - 2003
- [c4]Mohammad Mahdian, Martin Pál:
Universal Facility Location. ESA 2003: 409-421 - [c3]Martin Pál, Éva Tardos:
Group Strategyproof Mechanisms via Primal-Dual Algorithms. FOCS 2003: 584-593 - [c2]Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden:
Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem. FOCS 2003: 606-615 - 2001
- [c1]Martin Pál, Éva Tardos, Tom Wexler:
Facility Location with Nonuniform Hard Capacities. FOCS 2001: 329-338
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-10-07 22:21 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:
