( en | de | ru )

 

Disambiguation of "Mirrokni, Vahab S."

Author of the publication

copydeleteadd this publication to your clipboard
On the Non-progressive Spread of Influence through Social Networks.

, , , , , and . LATIN, volume 7256 of Lecture Notes in Computer Science, page 315-326. Springer, (2012)

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. You can also use the button next to the name to display some publications already assigned to the person.

Vahab Pournaghshband

Abbas Vahabzadeh

S Danischewski

S Hilt

S Hüttelmaier

 

Other publications of authors with the same name

Connected Components in MapReduce and Beyond., , , , and . SoCC, page 18:1-18:13. ACM, (2014)Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions., , and . EC, page 70-77. ACM, (2008)Market sharing games applied to content distribution in ad hoc networks., , , and . IEEE J. Sel. Areas Commun., 24 (5): 1020-1033 (2006)Quasi-Proportional Mechanisms: Prior-free Revenue Maximization, , and . CoRR, (2009)Distributed Graph Algorithmics: Theory and Practice., and . WSDM, page 419-420. ACM, (2015)On the Non-progressive Spread of Influence through Social Networks., , , , , and . LATIN, volume 7256 of Lecture Notes in Computer Science, page 315-326. Springer, (2012)Non-monotone submodular maximization under matroid and knapsack constraints., , , and . STOC, page 323-332. ACM, (2009)Smooth Anonymity for Sparse Binary Matrices., , , , and . CoRR, (2022)Almost Tight Approximation Algorithms for Explainable Clustering., , and . SODA, page 2641-2663. SIAM, (2022)A Data-Driven Metric of Incentive Compatibility., , , and . WWW, page 1796-1806. ACM / IW3C2, (2020)