( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Power-Conserving Computation of Order-Statistics over Sensor Networks.

, и . PODS, стр. 275-285. ACM, (2004)

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.

Sanjeev Kumar

Sanjeev Sarpal

Ruchira Khanna

Sanjeev Joshi

Sanjeev Gupta

 

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

Asymmetric k-center is log* n-hard to approximate., , , , , и . STOC, стр. 21-27. ACM, (2004)Power-Conserving Computation of Order-Statistics over Sensor Networks., и . PODS, стр. 275-285. ACM, (2004)Logic Programming for Software Testing.. ICCI, том 468 из Lecture Notes in Computer Science, стр. 225-234. Springer, (1990)To Show or Not to Show in Workflow Provenance., , и . In Search of Elegance in the Theory and Practice of Computation, том 8000 из Lecture Notes in Computer Science, стр. 217-226. Springer, (2013)The Angular-Metric Traveling Salesman Problem., , , , и . SIAM J. Comput., 29 (3): 697-711 (1999)Agreeing to Agree: Conflict Resolution for Optimistically Replicated Data., , , , и . DISC, том 4167 из Lecture Notes in Computer Science, стр. 269-283. Springer, (2006)Mechanism Design for a Risk Averse Seller., , и . WINE, том 7695 из Lecture Notes in Computer Science, стр. 198-211. Springer, (2012)A Formal Investigation of., , и . FSTTCS, том 4855 из Lecture Notes in Computer Science, стр. 485-496. Springer, (2007)Data Provenance: Some Basic Issues., , и . FSTTCS, том 1974 из Lecture Notes in Computer Science, стр. 87-93. Springer, (2000)A polynomial time approximation scheme for the SONET ring loading problem.. Bell Labs Tech. J., 2 (2): 36-41 (1997)