( en | de | ru )

 

Disambiguation of "Khanna, Sanjeev"

Author of the publication

copydeleteadd this publication to your clipboard
The Stochastic Matching Problem with (Very) Few Queries.

, , and . EC, page 43-60. ACM, (2016)

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.

Sanjeev Kumar

Sanjeev Sarpal

Ruchira Khanna

Sanjeev Joshi

Sanjeev Gupta

 

Other publications of authors with the same name

Parallel TCP/IP for Multiprocessor Workstations., , , , , , and . HPN, volume C-14 of IFIP Transactions, page 103-118. North-Holland, (1992)Locating and Capturing an Evader in a Polygonal Environment., , and . WAFR, volume 17 of Springer Tracts in Advanced Robotics, page 251-266. Springer, (2004)A PTAS for the multiple knapsack problem., and . SODA, page 213-222. ACM/SIAM, (2000)Selection with monotone comparison cost., and . SODA, page 10-17. ACM/SIAM, (2003)On the Hardness of Approximating Max k-Cut and Its Dual., , , and . ISTCS, page 61-67. IEEE Computer Society, (1996)On Multi-Dimensional Packing Problems., and . SODA, page 185-194. ACM/SIAM, (1999)To Show or Not to Show in Workflow Provenance., , and . In Search of Elegance in the Theory and Practice of Computation, volume 8000 of Lecture Notes in Computer Science, page 217-226. Springer, (2013)Asymmetric k-center is log* n-hard to approximate., , , , , and . STOC, page 21-27. ACM, (2004)Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games., , and . EC, page 73-82. ACM, (2010)Power-Conserving Computation of Order-Statistics over Sensor Networks., and . PODS, page 275-285. ACM, (2004)