( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Fast algorithms for finding matchings in lopsided bipartite graphs with applications to display ads.

, , , , и . EC, стр. 121-128. ACM, (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Nikhil Sasidharan

Nikhil Ratanje

Nikhil Jethava

Nikhil Karamchandani

Nikhil Chandra

 

Другие публикации лиц с тем же именем

Market equilibrium via a primal-dual algorithm for a convex program., , , и . J. ACM, 55 (5): 22:1-22:18 (2008)Limited and online supply and the bayesian foundations of prior-free mechanism design., и . EC, стр. 41-50. ACM, (2009)Strategyproof cost-sharing mechanisms for set cover and facility location games., , и . EC, стр. 108-114. ACM, (2003)Computing Market Equilibrium: Beyond Weak Gross Substitutes., и . WINE, том 4858 из Lecture Notes in Computer Science, стр. 368-373. Springer, (2007)On Computing the Distinguishing Numbers of Planar Graphs and Beyond: a Counting Approach, , и . CoRR, (2007)Price of Anarchy, Locality Gap, and a Network Service Provider Game., , , , , и . WINE, том 3828 из Lecture Notes in Computer Science, стр. 1046-1055. Springer, (2005)Static Pricing for Multi-unit Prophet Inequalities (Extended Abstract)., , и . WINE, том 13112 из Lecture Notes in Computer Science, стр. 545-546. Springer, (2021)A Duality-Based Unified Approach to Bayesian Mechanism Design., , и . SIAM J. Comput., (2021)Primal Dual Gives Almost Optimal Energy Efficient Online Algorithms., и . SODA, стр. 1123-1140. SIAM, (2014)Fast Algorithms for Online Stochastic Convex Programming., и . SODA, стр. 1405-1424. SIAM, (2015)