( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Reconstructing strings from random traces.

, , , и . SODA, стр. 910-918. SIAM, (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

 

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

On Multi-Dimensional Packing Problems., и . SODA, стр. 185-194. ACM/SIAM, (1999)Parallel TCP/IP for Multiprocessor Workstations., , , , , , и . HPN, том C-14 из IFIP Transactions, стр. 103-118. North-Holland, (1992)Locating and Capturing an Evader in a Polygonal Environment., , и . WAFR, том 17 из Springer Tracts in Advanced Robotics, стр. 251-266. Springer, (2004)On the Hardness of Approximating Max k-Cut and Its Dual., , , и . ISTCS, стр. 61-67. IEEE Computer Society, (1996)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)Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games., , и . EC, стр. 73-82. ACM, (2010)Algorithms for 2-Route Cut Problems., и . ICALP (1), том 5125 из Lecture Notes in Computer Science, стр. 472-484. Springer, (2008)A Utility Equivalence Theorem for Concave Functions., и . IPCO, том 8494 из Lecture Notes in Computer Science, стр. 126-137. Springer, (2014)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)