( en | de | ru )

 

Disambiguation of "Khanna, Sanjeev"

Author of the publication

copydeleteadd this publication to your clipboard
Automatic construction of a minimum size motion graph.

, , , and . Symposium on Computer Animation, page 27-35. ACM, (2009)

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

Agreeing to Agree: Conflict Resolution for Optimistically Replicated Data., , , , and . DISC, volume 4167 of Lecture Notes in Computer Science, page 269-283. Springer, (2006)Parallel TCP/IP for Multiprocessor Workstations., , , , , , and . HPN, volume C-14 of IFIP Transactions, page 103-118. North-Holland, (1992)Asymmetric k-center is log* n-hard to approximate., , , , , and . STOC, page 21-27. ACM, (2004)Data Provenance: Some Basic Issues., , and . FSTTCS, volume 1974 of Lecture Notes in Computer Science, page 87-93. Springer, (2000)A Formal Investigation of., , and . FSTTCS, volume 4855 of Lecture Notes in Computer Science, page 485-496. Springer, (2007)Mechanism Design for a Risk Averse Seller., , and . WINE, volume 7695 of Lecture Notes in Computer Science, page 198-211. Springer, (2012)On Syntactic versus Computational Views of Approximability, , , and . Electron. Colloquium Comput. Complex., (1995)The Optimization Complexity of Constraint Satisfaction Problems, and . Electron. Colloquium Comput. Complex., (1996)Approximation Schemes for Preemptive Weighted Flow Time, and . Electron. Colloquium Comput. Complex., (2001)Streaming Lower Bounds for Approximating MAX-CUT., , and . CoRR, (2014)